QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#318682	#5533. Trick	minhnhatnoe	0	13ms	3564kb	C++14	1.7kb	2024-01-31 16:58:02	2024-01-31 16:58:03

Judging History

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

[2024-01-31 16:58:03]
评测

测评结果：0
用时：13ms
内存：3564kb

查看

[2024-01-31 16:58:02]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> gperm(int n){
    vector<int> p(2*n+1); iota(p.begin(), p.end(), 0);
    shuffle(p.begin(), p.end(), mt19937(24032006));
    return p;
}
struct cplayer{
    cplayer(){
        int n; cin >> n;
        vector<int> p = gperm(n);
        vector<int> a(n), b(n);
        vector<pair<int, int>> b_sorted(n);
        for (int i=0; i<n; i++){
            cin >> a[i];
            b[i] = p[a[i]];
            b_sorted[i] = {b[i], i};
        }
        sort(b_sorted.begin(), b_sorted.end());

        int x = 0;
        for (int i=0; i<p.size(); i++) x ^= p[i];
        for (int i=0; i<n; i++) x = x ^ b[i];

        for (int i=0; i<n; i++){
            int y = x ^ b[i];
            auto it = lower_bound(b_sorted.begin(), b_sorted.end(), pair<int, int> (y, -1));
            if (it == b_sorted.end() || it->first != y || it->second == i) continue;
            cout << a[i] << " " << a[it->second] << "\n";
            return;
        }
        exit(1);
    }
};

struct hplayer{
    hplayer(){
        int n; cin >> n;
        vector<int> p = gperm(n);
        
        int x = 0;
        for (int i=0; i<p.size(); i++) x ^= p[i];
        for (int i=0; i<4; i++){
            int v; cin >> v; x ^= p[v];
        }
        cout << find(p.begin(), p.end(), x) - p.begin() << "\n";
    }
};
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    // freopen("trick.in", "r", stdin);
    // freopen("trick.out", "w", stdout);

    int t, r; cin >> t >> r;
    if (r == 1 || r == 2){
        for (int i=0; i<t; i++){
            cplayer();
        }
    }
    else{
        for (int i=0; i<t; i++){
            hplayer();
        }
    }
}

源文件, 语言: C++14

詳細信息

Subtask #1:

score: 0

Runtime Error

Test #1:

score: 0

Runtime Error

input:

12012
1
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 5
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 4 6
6
0 1 2 3 5 6
6
0 1 2 3 5 6
6
0 1 2 3 5 6
6
0 1 2 3 5 6
6
0 1 2 3 5 6
6
0 1 2 3 5 6
6
0 1 2 3 5 ...

output:

input:

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

output:

input:

12012
3
6
-2142965016 32633 7 8
6
-2142965016 32633 6 8
6
-2142965016 32633 6 7
6
-2142965016 32633 7 12
6
-2142965016 32633 6 11
6
-2142965016 32633 6 10
6
-2142965016 32633 7 9
6
-2142965016 32633 7 8
6
-2142965016 32633 5 8
6
-2142965016 32633 5 7
6
-2142965016 32633 7 11
6
-2142965016 32633 5 11...

output:

result:

Subtask #2:

score: 0

Skipped

Subtask #3:

score: 0

Wrong Answer

Test #11:

score: 0

Wrong Answer

time: 13ms = 0ms + 13ms

memory: 0kb,3564kb

input:

6525
1
6
10 1 11 3 12 6
6
1 7 10 12 5 6
6
0 10 12 7 9 8
6
12 1 8 4 7 11
6
11 8 9 4 10 6
6
0 7 2 3 4 5
6
0 8 3 10 11 6
6
0 1 2 4 7 6
6
0 1 11 9 5 6
6
7 1 12 8 6 5
7
0 1 13 10 12 5 6
7
0 14 2 3 4 12 6
7
11 1 3 8 12 6 13
7
0 1 2 3 13 5 14
7
11 9 10 8 4 14 7
7
0 8 14 3 4 13 11
7
0 10 2 14 8 5 6
7
0 13 2...

output:

10 1

input:

6525
2
6
0 2 4 5 8 9
6
2 3 4 8 9 11
6
1 2 3 4 5 11
6
0 3 5 6 9 10
6
0 1 3 5 7 12
6
1 6 8 10 11 12
6
2 4 5 7 9 12
6
5 8 9 10 11 12
6
3 4 7 8 10 12
6
0 2 3 4 9 11
7
2 3 4 7 8 9 11
7
1 5 7 8 9 10 13
7
0 4 5 7 9 10 14
7
4 6 7 8 9 10 11
7
0 1 2 3 5 6 13
7
1 2 5 7 9 10 12
7
1 3 4 9 11 12 13
7
1 3 4 6 10 1...

output:

input:

output:

result:

wrong answer the card you returned is 6, but expected 7 (test case 1)

Subtask #4:

score: 0

Skipped