QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#62114#2829. Cryptographyxuancx#TL 3ms5376kbC++20720b2022-11-17 14:38:172022-11-17 14:38:17

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-11-17 14:38:17]
  • 评测
  • 测评结果:TL
  • 用时:3ms
  • 内存:5376kb
  • [2022-11-17 14:38:17]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 200010
int f[maxn], g[maxn], h[maxn];
int m, q;
int main(void){
    ios::sync_with_stdio(0);
    cin.tie(0);
    while(cin>>m>>q){
        for (int i = 0; i < (1 << m);i++){
            cin >> f[i];
        }
        for (int i = 0; i < (1 << m);i++){
            cin >> g[i];
        }
        for (int i = 0; i < (1 << m);i++){
            cin >> h[i];
        }
        for (int i = 1; i <= q;i++){
            int a, b;
            cin>>a>>b;
            int c = b ^ h[a];
            int y = a ^ g[c];
            int x = c ^ f[y];
            cout << x << " " << y << endl;
        }
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 3ms
memory: 5376kb

input:

2 2
0 1 2 3
1 2 3 0
2 3 0 1
0 1
2 3
1 1
0 0
0 0
0 0
0 0

output:

3 0
1 2
0 0

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 2ms
memory: 3252kb

input:

1 1
0 0
0 0
0 0
0 0

output:

0 0

result:

ok single line: '0 0'

Test #3:

score: -100
Time Limit Exceeded

input:

1 2
1 1
0 0
0 0
1 1
1 0
1 2
0 0
0 1
0 1
1 0
1 1
1 2
0 1
1 0
0 0
1 0
1 0
1 2
0 0
0 1
1 1
0 0
1 1
1 2
0 1
1 0
0 1
0 1
0 0
1 2
1 1
0 1
0 1
1 0
0 0
1 2
1 1
0 1
1 0
1 0
0 1
1 2
0 0
1 0
1 1
1 1
1 1
1 2
1 1
0 1
1 0
1 0
0 1
1 2
0 1
0 0
0 0
0 1
0 1
1 2
1 1
1 0
1 0
1 0
1 1
1 2
1 1
1 0
1 1
0 1
0 0
1 2
1 1
0 1
...

output:

0 1
1 1
1 0
0 1
0 0
0 0
1 1
0 1
1 0
1 1
0 0
1 0
1 1
1 0
0 0
0 0
1 1
1 0
1 0
1 0
1 0
0 1
1 1
0 0
0 1
0 1
1 0
1 1
0 1
1 0
0 1
0 1
1 0
0 1
1 1
1 1
0 0
0 1
0 1
1 0
1 1
1 0
0 1
1 1
0 1
0 0
1 1
0 1
1 1
0 1
0 0
0 1
1 1
0 0
0 0
1 1
0 0
1 1
1 1
0 1
0 1
0 0
1 1
1 1
0 1
1 0
0 0
1 1
1 0
1 1
1 0
0 1
0 1
1 0
1 1
...

result: