QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#225535	#6303. Inversion	Freeuni1^#	RE	1ms	3420kb	C++14	1.5kb	2023-10-24 19:30:19	2023-10-24 19:30:19

Judging History

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

[2023-10-24 19:30:19]
评测

测评结果：RE
用时：1ms
内存：3420kb

查看

[2023-10-24 19:30:19]
提交

answer

#include<bits/stdc++.h>
#include<bits/extc++.h>

using namespace std;
int dp[42][22][2];
int dp1[42][22][2];
int cnt = 0;
map<pair<int, int>, int> q;
bool inv(int i1, int i2) {
    if (q[{i1, i2}]) {
        return q[{i1, i2}] - 1;
    }
    cnt ++;
    assert(cnt < 40000);
    cout << "? " << i1 << " " << i2 << endl;
    int x;
    cin >> x;
    q[{i1, i2}] = x + 1;
    return x;
}

bool grt(int i1, int i2) {
    //cout << i1 << " " << i2 << endl;
    bool swp = false;
    if (i1 > i2) {
        swap(i1, i2);
        swp = true;
    }
    if (i2 - i1 == 1) {
        return inv(i1, i2) ^ swp;
    }
    if (i2 - i1 == 2) {
        return inv(i1, i2) ^ inv(i1 + 1, i2) ^ inv(i1, i2 - 1) ^ swp;
    }
    return inv(i1, i2) ^ inv(i1 + 1, i2) ^ inv(i1, i2 - 1) ^ inv(i1 + 1, i2 - 1) ^ swp;
}
main() {
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> v, srt(n + 3);
    v.push_back(1);

    for (int i = 2; i <= n; i++) {
        int l = -1, r = v.size();
        while (r - l > 1) {
            //cout << l << " " << r << en
            int m = (l + r) / 2;
            if (grt(v[m], i)) {
                r = m;
            } else {
                l = m;
            }
        }
        v.insert(v.begin() + r, i);

    }

    for (int i = 0; i < v.size(); i ++) {
        srt[v[i]] = i + 1;
    }
    cout << "! ";
    for (int i = 1; i <= n; i ++) {
        cout << srt[i] << " ";
    }
    cout << endl;
}
/*


*/

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3420kb

input:

output:

result:

ok OK, guesses=3

Test #2:

score: -100

Runtime Error

input:

output: