QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#318673#5533. Trickminhnhatnoe0 25ms3688kbC++141.7kb2024-01-31 16:43:332024-01-31 16:43:33

Judging History

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

  • [2024-01-31 16:43:33]
  • 评测
  • 测评结果:0
  • 用时:25ms
  • 内存:3688kb
  • [2024-01-31 16:43:33]
  • 提交

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<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;
        }
    }
};

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();
        }
    }
}

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 25ms = 0ms + 25ms
memory: 0kb,3688kb

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:

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

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:

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

input:

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

output:

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

result:

wrong answer the card you returned is 9, but expected 8 (test case 3)

Subtask #2:

score: 0
Skipped

Subtask #3:

score: 0
Wrong Answer

Test #11:

score: 0
Wrong Answer
time: 19ms = 0ms + 19ms
memory: 0kb,3608kb

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 12
10 5
12 7
7 11
8 9
0 3
10 11
1 4
11 6
8 5
5 6
14 3
3 12
2 13
11 9
10 2
0 7
1 6
5 9
1 2
0 8
2 13
9 10
11 4
15 6
2 13
10 4
17 9
13 10
1 14
0 8
11 9
1 10
2 4
13 4
17 15
0 5
0 4
11 5
0 7
20 14
2 20
5 7
4 21
0 5
12 4
17 5
20 11
12 18
17 6
0 3
18 11
0 5
3 11
15 11
11 16
0 19
6 12
2 14
12 5
1 20
17 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:

5 9
2 8
3 5
0 5
0 7
2 5
10 12
4 7
0 2
2 9
8 13
5 10
7 10
0 5
1 9
12 13
10 14
8 10
3 7
2 16
10 13
0 14
1 14
11 13
3 15
1 9
12 18
5 14
2 3
11 15
4 15
4 17
1 10
4 9
17 19
4 18
3 18
0 11
2 6
2 11
0 13
13 17
3 10
0 19
13 17
15 18
1 13
7 15
5 6
3 6
0 6
3 19
1 18
5 13
0 22
2 7
9 14
0 17
2 16
5 15
0 2
6 11
...

input:

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

output:

7
0
6
2
2
12
11
6
3
8
3
3
6
3
12
7
8
0
0
15
16
16
17
4
17
12
17
17
7
17
19
19
19
19
16
19
19
19
19
19
21
6
11
15
11
13
12
13
21
13
4
9
6
8
23
11
23
11
6
13
13
0
23
23
19
23
23
23
23
8
23
13
0
3
10
23
7
6
6
5
23
17
23
13
3
23
4
23
16
14
17
1
2
3
0
16
23
23
23
11
23
4
8
8
17
1
23
14
3
23
10
23
1
8
8
2...

result:

wrong answer the card you returned is 12, but expected 9 (test case 6)

Subtask #4:

score: 0
Skipped