QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#822924#9804. Guess the Polygonucup-team2179#WA 51ms4072kbC++238.7kb2024-12-20 17:30:342024-12-20 17:30:38

Judging History

This is the latest submission verdict.

  • [2024-12-20 17:30:38]
  • Judged
  • Verdict: WA
  • Time: 51ms
  • Memory: 4072kb
  • [2024-12-20 17:30:34]
  • Submitted

answer

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
using namespace std;

class Int {
public:
	using ll = long long;
	Int() {};
	Int(const string& s);
	Int(ll a) :Int(to_string(a)) {}
	Int(const Int& bInt) :nums(bInt.nums), isPositive(bInt.isPositive), length(bInt.length) {}
	Int(Int&& bInt) noexcept :nums(move(bInt.nums)), isPositive(bInt.isPositive), length(bInt.length) {}
	Int(const vector<int>& vec, bool sign = true) :nums(vec), isPositive(sign) { cutLeadZero(); }
	friend istream& operator >>(istream& is, Int& bInt) {
		string s;
		is >> s;
		bInt = move(Int(s));
		return is;
	}
	friend ostream& operator <<(ostream& os, const Int& bInt);
	operator string() const;
	const Int& operator +() const { return *this; }
	Int operator -() const {
		Int tmp(*this);
		if (!tmp.isZero())
			tmp.isPositive = !isPositive;
		return tmp;
	}
	bool operator <(const Int& bInt) const;
	bool operator <=(const Int& bInt) const;
	bool operator ==(const Int& bInt) const;
	Int operator +(const Int& bInt) const;
	Int operator -(const Int& bInt) const;
	Int operator *(const Int& bInt) const;
	// 除法会返回 商和余数
	pair<Int, Int> operator /(const Int& bInt) const;
	int operator[](int idx) const { return nums[idx]; }
	Int& operator =(const Int& bInt) {
		if (bInt == *this)
			return *this;
		nums = bInt.nums;
		isPositive = bInt.isPositive;
		length = bInt.length;
		return *this;
	}
	Int& operator =(Int&& bInt)noexcept {
		nums = move(bInt.nums);
		isPositive = bInt.isPositive;
		length = bInt.length;
		return *this;
	}
	size_t size() const { return nums.size(); }
	void cutLeadZero();
	bool isZero() const;
	Int absValue() const {
		return move(Int(nums));
	}
	static Int e(size_t n) {
		if (n <= 0)
			return move(Int(vector<int>(1, 1)));
		int m = n / digit;
		n -= m * digit;
		vector<int> ans(m);
		string s = "1";
		s += move(string(n, '0'));
		ans.push_back(stoi(s));
		return move(Int(ans));
	}
private:
	// 低位到高位
	vector<int> nums;
	bool isPositive = 1;
	int length = 0;
	static int digit;
	static int mod;
};
int Int::digit = 8;
int Int::mod = 100000000;
Int::Int(const string& s) {
	int n = s.size(), minIdx = 0;
	if(s[0]=='-')
		isPositive = false, minIdx = 1;
	else if(s[0]=='+')
		isPositive = true, minIdx = 1;
	for (int i = n - 1; i >= minIdx; i -= digit) {
		int beg = max(minIdx, i - digit + 1);
		nums.push_back(stoi(s.substr(beg, i - beg + 1)));
	}
	cutLeadZero();
}
ostream& operator <<(ostream& os, const Int& bInt) {
	os << (string)bInt;
	return os;
}
Int::operator string() const {
	string ans;
	if (!isPositive)
		ans += "-";
	int n = nums.size();
	for (int i = n - 1; i >= 0; i--) {
		string s = to_string(nums[i]);
		if (i != n - 1)
			ans += string(digit - s.size(), '0');
		ans += s;
	}
	return ans;
}
bool Int::operator<(const Int& bInt) const {
	if (isPositive && !bInt.isPositive)
		return false;
	if (!isPositive && bInt.isPositive)
		return true;
	bool flag = true;
	if (!isPositive)
		flag = false;
	if (length < bInt.length)
		return flag;
	else if (length > bInt.length)
		return !flag;
	int n = size();
	for (int i = n - 1; i >= 0; i--) {
		if (nums[i] < bInt[i])
			return flag;
		else if (nums[i] > bInt[i])
			return !flag;
	}
	return false;
}
bool Int::operator<=(const Int& bInt) const {
	if (isPositive && !bInt.isPositive)
		return false;
	if (!isPositive && bInt.isPositive)
		return true;
	bool flag = true;
	if (!isPositive)
		flag = false; // 都为负数
	if (length < bInt.length)
		return flag;
	else if (length > bInt.length)
		return !flag;
	int n = size();
	for (int i = n - 1; i >= 0; i--) {
		if (nums[i] < bInt[i])
			return flag;
		else if (nums[i] > bInt[i])
			return !flag;
	}
	return true;
}
bool Int::operator==(const Int& bInt) const {
	if (length != bInt.length)
		return false;
	int n = size();
	for (int i = 0; i < n; i++)
		if (nums[i] != bInt[i])
			return false;
	return true;
}
Int Int::operator+(const Int& bInt) const {
	if (!bInt.isPositive)
		return *this - (-bInt);
	if (!isPositive)
		return bInt - (-*this);
	vector<int> ans;
	int n = size(), m = bInt.size(), sum = 0, i = 0, j = 0;
	while (i < n || j < m || sum)
	{
		if (i < n)
			sum += nums[i++];
		if (j < m)
			sum += bInt[j++];
		ans.push_back(sum % mod);
		sum /= mod;
	}
	return move(Int(ans, isPositive));
}
Int Int::operator-(const Int& bInt) const
{
	if (!bInt.isPositive)
		return *this + (-bInt);
	if (!isPositive)
		return -((-*this) + bInt);
	if (*this < bInt)
		return -(bInt - *this);
	vector<int> ans;
	int i = 0, j = 0, n = size(), m = bInt.size(), sum = 0;
	while (i < n || j < m || sum) {
		if (i < n)
			sum += nums[i++];
		if (j < m)
			sum -= bInt[j++];
		int flag = 0;
		if (sum < 0) {
			flag = -1;
			sum += mod;
		}
		ans.push_back(sum);
		sum = flag;
	}
	return move(Int(ans));
}
Int Int::operator*(const Int& bInt) const {
	int n = size(), m = bInt.size();
	vector<int> ans(n + m);
	using ll = long long;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			ll tmp = ans[i + j] + nums[i] * 1ll * bInt[j];
			ans[i + j] = tmp % mod;
			ans[i + j + 1] += tmp / mod;
		}
	}
	return move(Int(ans, isPositive == bInt.isPositive));
}
pair<Int, Int> Int::operator/(const Int& bInt) const {
	Int a = absValue();
	Int b = bInt.absValue();
	if (b.isZero())
		return pair<Int, Int>(*this, move(b));
	if (a < b)
		return pair<Int, Int>(move(Int(0)), *this);
	int len = a.length - b.length + 1;
	string ans;
	if (isPositive != bInt.isPositive)
		ans = "-";
	for (int i = 0; i < len; i++) {
		Int tmp = e(len - i - 1) * b;
		int times = 0;
		while (tmp <= a) {
			a = a - tmp;
			++times;
		}
		ans += times + '0';
	}
	a.isPositive = isPositive;
	return pair<Int, Int>(move(Int(ans)), move(a));
}
void Int::cutLeadZero() {
	while(nums.size() > 1 && nums.back() == 0)
		nums.pop_back();
	if(nums.empty()) length = 0;
	else length = (nums.size() - 1) * digit + to_string(nums.back()).size();
}
bool Int::isZero() const {
	return nums.size() == 1 && nums.back() == 0;
}

Int biggcd(Int a,Int b){
    if(a<Int(0))a=-a;
    if(b<Int(0))b=-b;
    if(a<b)swap(a,b);
    if(b==Int(0ll))return a;
    return biggcd(b,(a/b).second);
}

struct num{
    Int a,b;
    num(Int x,Int y){
        Int d=biggcd(x,y);
        a=(x/d).first;
        b=(y/d).first;
        if(b<Int(0)){
            a=-a;
            b=-b;
        }
    }
    num(){a=0,b=1;}
    num(Int x){
        a=x;
        b=1;
    }
    num operator+(num y){
        return num(a*y.b+y.a*b,b*y.b);
    }
    num operator*(num y){
        return num(a*y.a,b*y.b);
    }
    num operator/(num y){
        return num(a*y.b,b*y.a);
    }
    num operator-(num y){
        return num(a*y.b-y.a*b,b*y.b);
    }
};
struct Point 
{
    num x,y;
    Point(){}
    Point(num a,num b){
        x=a,y=b;
    }
};
num getval(Point a1,Point a2,num x){
    auto [x1,y1]=a1;
    auto [x2,y2]=a2;
    return y1+(y2-y1)/(x2-x1)*(x-x1);
}
num query(num u){
    cout<<"? "<<u.a<<" "<<u.b<<endl;
    int x,y;
    cin>>x>>y;
    return num(x,y);
}

num diff=num(1,5);

void solve() {
    int n;
    cin>>n;
    vector<int>vx;
    map<int,int>mp;
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        mp[x]++;
    }
    for(auto [x,cnt]:mp){
        vx.pb(x);
    }
    n=vx.size();
    Point val[n][2];
    num ans(0);
    if(mp[vx[0]]>1){
        num now=query(num(vx[0])+diff);
        val[0][1]=Point(num(vx[0])+diff,now);
    }
    else {
        num now=num(0);
        val[0][1]=Point(num(vx[0]),now);
    }

    if(mp[vx[n-1]]>1){
        num now=query(num(vx[n-1])-diff);
        val[n-1][0]=Point(num(vx[n-1])-diff,now);
    }
    else {
        num now=num(0);
        val[n-1][0]=Point(num(vx[n-1]),now);
    }
    for(int i=1;i<n-1;i++){
        if(mp[vx[i]]==1){
            num now=query(num(vx[i]));
            val[i][0]=Point(num(vx[i]),now);
            val[i][1]=Point(num(vx[i]),now);
        }
        else {
            num now=query(num(vx[i])-diff);
            val[i][0]=Point(num(vx[i])-diff,now);
            now=query(num(vx[i])+diff);
            val[i][1]=Point(num(vx[i])+diff,now);
        }
    }

    for(int i=0;i<n-1;i++){
        num high=num(vx[i+1]-vx[i]);
        num len1=getval(val[i][1],val[i+1][0],num(vx[i]));
        num len2=getval(val[i][1],val[i+1][0],num(vx[i+1]));
        ans=ans+high*(len1+len2)/num(2);
    }
    cout<<"! "<<ans.a<<" "<<ans.b<<endl;
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3620kb

input:

2
4
3 0
1 3
1 1
0 0
8 5
9 5
3
0 0
999 1000
1000 999
1999 1000

output:

? 4 5
? 6 5
! 3 1
? 999 1
! 1999 2

result:

ok correct! (2 test cases)

Test #2:

score: 0
Accepted
time: 2ms
memory: 3868kb

input:

9
4
1 1
1 3
3 0
0 0
12 5
9 10
4
0 0
1 3
1 1
3 0
4 5
27 10
4
0 0
3 0
1 2
1 1
4 5
9 10
4
0 0
3 0
1 2
1 1
8 5
9 10
4
0 0
3 0
1 1
1 2
4 5
9 5
3
1000 0
0 0
0 1000
4999 5
4
0 0
1000 0
1000 1000
0 1000
1000 1
1000 1
5
0 1
1000 1000
1000 0
0 1000
1 0
4996 5
1000 1
1000 1
9
4 1000
3 1
2 1000
3 1000
1 1
2 1
0...

output:

? 4 5
? 6 5
! 5 2
? 4 5
? 6 5
! 7 2
? 4 5
? 6 5
! 3 2
? 4 5
? 6 5
! 2 1
? 4 5
? 6 5
! 5 2
? 1 5
! 500000 1
? 1 5
? 4999 5
! 1000000 1
? 1 5
? 4999 5
? 1 1
! 1999999 2
? 19 5
? 4 5
? 6 5
? 9 5
? 11 5
? 14 5
? 16 5
! 4003 2

result:

ok correct! (9 test cases)

Test #3:

score: 0
Accepted
time: 24ms
memory: 3596kb

input:

78
8
951 614
927 614
957 614
957 604
937 614
942 619
951 610
927 604
10 1
10 1
10 1
15 1
31 5
10 1
7
562 260
602 250
582 255
587 260
602 260
562 250
577 260
10 1
10 1
10 1
5 1
10 1
3
454 98
494 68
455 68
117 4
3
526 589
566 559
527 559
117 4
3
854 496
854 466
894 466
597 20
3
797 264
827 254
857 264...

output:

? 4636 5
? 4784 5
? 937 1
? 942 1
? 4754 5
? 4756 5
! 317 1
? 2811 5
? 3009 5
? 577 1
? 582 1
? 587 1
! 375 1
? 455 1
! 585 1
? 527 1
! 585 1
? 4271 5
! 600 1
? 827 1
! 300 1
? 3596 5
! 600 1
? 162 1
! 400 1
? 3711 5
? 3959 5
? 3734 5
? 3736 5
? 3759 5
? 3761 5
! 275 1
? 4661 5
? 4934 5
? 4684 5
? 4...

result:

ok correct! (78 test cases)

Test #4:

score: -100
Wrong Answer
time: 51ms
memory: 4072kb

input:

34
24
123 815
168 800
133 795
27 827
153 805
28 830
178 780
138 810
78 830
192 772
148 790
88 810
43 825
183 795
103 805
163 785
118 800
93 825
63 835
73 815
58 820
198 790
48 840
108 820
10 3
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
95 6
15 2
15 1
24...

output:

? 28 1
? 43 1
? 48 1
? 58 1
? 63 1
? 73 1
? 78 1
? 88 1
? 93 1
? 103 1
? 108 1
? 118 1
? 123 1
? 133 1
? 138 1
? 148 1
? 153 1
? 163 1
? 168 1
? 178 1
? 183 1
? 192 1
! 1925 1
? 54 1
? 69 1
? 74 1
? 84 1
? 89 1
? 99 1
? 104 1
? 114 1
? 119 1
? 129 1
? 134 1
? 144 1
? 149 1
? 159 1
? 164 1
? 174 1
? ...

result:

wrong answer format  Expected integer, but "141068740583210015889528756746...9345202615869544581505582990223" found (test case 27)