QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#594123#6303. Inversionshiqiaqiaya#WA 66ms34196kbC++201.3kb2024-09-27 19:31:042024-09-27 19:31:04

Judging History

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

  • [2024-09-27 19:31:04]
  • 评测
  • 测评结果:WA
  • 用时:66ms
  • 内存:34196kb
  • [2024-09-27 19:31:04]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;

    vector<int> a;
    a.push_back(1);

    vector vis(n + 1, vector<int> (n + 1, -1));
    auto ask = [&](int l, int r) -> int {
    	if (l >= r) return 0;
    	if (vis[l][r] != -1) return vis[l][r];
    	cout << "? " << l << " " << r << endl;
    	int x;
    	cin >> x;
    	return vis[l][r] = x;
    };

    auto compare = [&](int x, int y) -> bool {
    	int a = ask(x, y - 1);
    	int b = ask(x + 1, y);
    	int c = ask(x, y);
    	int d = ask(x + 1, y - 1);
    	if ((a + b + c - d + 2) % 2 == 0) return false;
    	return true;
    };

    for (int i = 2; i <= n; i++) {
    	int L = 0, R = a.size() - 1, res = -1;
    	while (L <= R) {
    		int mid = (L + R) / 2;
    		if (!compare(a[mid], i)) {
    			res = mid;
    			L = mid + 1;
    		} else {
    			R = mid - 1;
    		}
    	}
    	// cout << " ? " << i << " " << res << "\n";
    	a.insert(a.begin() + res + 1, i);
    }

    vector<int> ans(n + 1);
    for (int i = 0; i < n; i++) {
    	ans[a[i]] = i + 1;
    }

    cout << "! ";
    for (int i = 1; i <= n; i++) {
    	cout << ans[i] << " ";
    }
    cout << endl;

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
0
1
0

output:

? 1 2
? 2 3
? 1 3
! 2 3 1 

result:

ok OK, guesses=3

Test #2:

score: -100
Wrong Answer
time: 66ms
memory: 34196kb

input:

1993
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
1
0
1
0
0
0
0
1
1
0
1
1
1
1
1
1
0
1
1
1
0
1
1
0
0
1
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
1
1
0
1
0
1
0
1
1
0
1
1
1
1
0
0
0
1
0
1
1
1
1
0
0
0
1
0
0
0
0
0
1
0
1
0
1
0
1
0
1
1
0
0
1
1
0
1
0
0
1
0
0
1
1
1
1
1
1
1
1
0
0
0
1
0
0
0
0
1
1
1
0
0
1
0
0
1
0
0
1
0
1
0...

output:

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

result:

wrong output format Unexpected end of file - int32 expected