QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#460655	#8239. Mysterious Tree	CRN2010	TL	1ms	3672kb	C++20	2.9kb	2024-07-01 23:44:22	2024-07-01 23:44:22

Judging History

你现在查看的是最新测评结果

[2024-07-01 23:44:22]
评测

测评结果：TL
用时：1ms
内存：3672kb

查看

[2024-07-01 23:44:22]
提交

answer

#include <bits/stdc++.h>

using namespace std ;


void solve() {
	int n , op ;
	cin >> n ;
	
	for(int i = 2 ; i <= n ; i += 2)
	{
		cout << "? " << i << ' ' << i - 1 << endl ;
		cin >> op ;
		if (op)
		{
			if ( i == n ) {
				cout << "? " << 1 << ' ' << i << endl ;
				cin >> op ;
				if ( op ) {
					cout << "? " << 2 << ' ' << i << endl ;
					cin >> op ;
					if ( op ) {
						cout << "! 2" << endl ;
						return ;
					} else {
						cout << "! 1" << endl ;
						return ;
					}
				} else {
					cout << "? " << 1 << ' ' << i - 1 << endl ;
					cin >> op ;
					if ( op ) {
						cout << "? " << 2 << ' ' << i - 1 << endl ;
						cin >> op ;
						if ( op ) {
							cout << "! 2" << endl ;
							return ;
						} else {
							cout << "! 1" << endl ;
							return ;
						}
					} else {
						cout << "! 1" << endl ;
						return ;
					}
				}
			} else {
				cout << "? " << i << ' ' << n << endl ;
				cin >> op ;
				if ( op ) {
					if ( i == n - 1 ) {
						cout << "? " << 1 << ' ' << i << endl ;
						cin >> op ;
						if ( op ) {
							cout << "! 2" << endl ;
							return ;
						} else {
							cout << "! 1" << endl ;
							return ;
						}
					} else {
						cout << "? " << i << ' ' << n - 1 << endl ; 
						cin >> op ;
						if ( op ) {
							cout << "! 2" << endl ;
							return ;
						} else {
							cout << "! 1" << endl ;
							return ;
						}
					}
				} else {
					cout << "? " << i - 1 << ' ' << n << endl ;
					cin >> op ;
					if ( op ) {
						if ( i == n - 1 ) {
							cout << "? " << 1 << ' ' << i - 1 << endl ;
							cin >> op ;
							if ( op ) {
								cout << "! 2" << endl ;
								return ;
							} else {
								cout << "! 1" << endl ;
								return ;
							}							
						} else {
							cout << "? " << i - 1 << ' ' << n - 1 << endl ; 
							cin >> op ;
							if ( op ) {
								cout << "! 2" << endl ;
								return ;
							} else {
								cout << "! 1" << endl ;
								return ;
							}
						}
					} else {
						cout << "! 1" << endl ;
						return ;
					}
				}
			}
		}
	}
	if ( n & 1 ) {
		cout << "? " << n - 1 << ' ' << n << endl ;
		cin >> op ;
		cout << "? " << 1 << ' ' << n << endl ;
		cin >> op ;
		if ( op ) {
			cout << "? " << 2 << ' ' << n << endl ;
			cin >> op ; 
			if ( op ) {
				cout << "! 2" << endl ;
				return ;
			} else {
				cout << "! 1" << endl ;
				return ;
			}
		} else {
			cout << "? " << 1 << ' ' << n - 1 << endl ;
			cin >> op ;
			if (op) {
				cout << "? " << 2 << ' ' << n - 1 << endl ; 
				cin >> op ;
				if ( op ) {
					cout << "! 2" << endl ;
					return ;
				} else {
					cout << "! 1" << endl ;
					return ; 
				}
			} else {
				cout << "! 1" << endl ;
				return ;
			}
		}
	}
}

int main() 
{
	int t ;
	cin >> t ;
	while (t--)
	{
		solve() ;
	}
	return 0 ; 
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3672kb

input:

output:

result:

ok Correct (2 test cases)

Test #2:

score: -100

Time Limit Exceeded

input:

output: