QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#613095#8939. PermutationFork512HzWA 81ms3712kbC++201.0kb2024-10-05 13:34:222024-10-05 13:34:22

Judging History

This is the latest submission verdict.

  • [2024-10-05 13:34:22]
  • Judged
  • Verdict: WA
  • Time: 81ms
  • Memory: 3712kb
  • [2024-10-05 13:34:22]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pii;
ll query(ll x, ll y)
{
	cout << "? " << x << ' ' << y << '\n';
	cout.flush();
	ll tmp;
	cin >> tmp;
	return tmp;
}
void answer(ll x)
{
	cout << "! " << x << '\n';
	cout.flush();
}
void solve(ll l, ll r, ll po)
{
	if(r-l == 1)
	{
		answer(l);
		throw 0ll;
	}
	else if(r-l == 2)
	{
		if(po == l) answer(l+1);
		else if(po == l+1) answer(l);
		else answer(2*l+1 - query(l, l+1));
		throw 0ll;
	}
	if(po == -1) po = query(l, r-1);
	ll mid = (l+r) / 2;
	if((r-l) % 2 && po < mid) mid++;
	if(po < mid)
	{
		ll t = query(l, mid-1);
		if(t == po) solve(l, mid, po);
		else solve(mid, r, -1);
	}
	else
	{
		ll t = query(mid, r-1);
		if(t == po) solve(mid, r, po);
		else solve(l, mid, -1);
	}
}
int main()
{
	ll z;
	cin >> z;
	while(z--)
	{
		ll n;
		cin >> n;
		try
		{
			solve(1, n+1, -1);
		}
		catch(const ll &e)
		{
			;
		}
		
	}
	return 0;
}

詳細信息

Test #1:

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

input:

3
5
3
3
3
6
6
5
3
3
4
3
3

output:

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

result:

ok Correct (3 test cases)

Test #2:

score: 0
Accepted
time: 81ms
memory: 3712kb

input:

10000
10
2
2
3
5
10
10
10
8
7
10
5
1
10
9
6
10
4
4
4
5
10
10
6
3
5
2
10
3
3
5
2
10
1
5
9
9
10
10
1
3
8
10
6
10
2
4
9
9
9
10
3
3
3
3
10
4
1
7
8
9
10
8
7
1
1
2
10
4
1
9
9
9
10
7
8
2
1
4
10
5
1
7
6
10
10
8
8
8
9
10
2
1
7
7
8
10
6
6
8
10
10
1
3
8
9
6
10
7
9
5
5
4
10
7
8
4
4
5
10
3
4
7
8
10
10
4
4
4
4
10...

output:

? 1 10
? 1 5
? 1 3
? 4 5
! 4
? 1 10
? 6 10
? 8 10
? 6 7
! 6
? 1 10
? 1 5
? 6 10
? 8 10
? 6 7
! 7
? 1 10
? 1 5
? 3 5
? 4 5
! 3
? 1 10
? 6 10
? 1 5
? 3 5
? 1 2
! 1
? 1 10
? 1 5
? 3 5
? 1 2
! 1
? 1 10
? 1 5
? 6 10
? 8 10
? 9 10
! 8
? 1 10
? 1 5
? 6 10
? 8 10
? 6 7
! 7
? 1 10
? 1 5
? 6 10
? 8 10
? 9 10
...

result:

ok Correct (10000 test cases)

Test #3:

score: -100
Wrong Answer
time: 16ms
memory: 3696kb

input:

10000
3
1
2
11
5
5
5
5
2
2
19
3
3
4
6
8
9
7
5
7
1
2
3
3
3
19
6
6
10
1
1
2
2
2
15
11
11
11
10
8
14
1
1
1
2
3
16
4
4
1
8
7
5
3
3
2
19
13
17
5
6
2
1
4
2
2
4
1
2
3
7
2
2
2
3
2
3
17
1
1
1
2
4
14
9
9
9
8
11
20
9
3
18
17
13
14
11
6
4
4
5
18
7
7
7
7
7
8
8
6
3
3
8
6
7
1
2
3
16
10
10
10
10
6
1
3
6
5
10
3
3
3
...

output:

? 1 3
? 1 2
! 3
? 1 11
? 1 6
? 4 6
? 5 6
! 6
? 1 2
! 1
? 1 19
? 1 10
? 1 5
? 6 10
? 6 8
? 9 10
! 10
? 1 7
? 4 7
? 1 3
? 1 2
! 3
? 1 3
? 2 3
! 2
? 1 19
? 1 10
? 6 10
? 1 5
? 1 3
? 1 2
! 3
? 1 2
! 1
? 1 15
? 8 15
? 8 11
? 10 11
? 8 9
! 9
? 1 14
? 1 7
? 1 4
? 1 2
? 3 4
! 4
? 1 16
? 1 8
? 1 4
? 5 8
? 7 ...

result:

wrong answer Too many queries , n = 16 , now_q 7 (test case 34)