QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #21768 | #2829. Cryptography | LFCode# | WA | 1ms | 1808kb | C++14 | 665b | 2022-03-08 15:03:40 | 2022-05-08 04:02:55 |
Judging History
answer
//什么时候我才能有杜爷一半强啊/kk
#include<cstdio>
const int N=200086;
int n,m,f[N],g[N],h[N];
int read(){
char ch=getchar();int nn=0,ssss=1;
while(ch<'0'||ch>'9'){if(ch=='-')ssss*=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){nn=nn*10+(ch-'0');ch=getchar();}
return nn*ssss;
}
bool solve(){
for(int i=0;i<(1<<m);i++)f[i]=read();
for(int i=0;i<(1<<m);i++)g[i]=read();
for(int i=0;i<(1<<m);i++)h[i]=read();
for(int i=1;i<=n;i++){
int a=read();int b=read();
int y=g[b^h[a]]^a;
int x=b^f[y]^h[a];
printf("%d %d\n",x,y);
}
return true;
}
int main(){
freopen("C.in","r",stdin);
while(~scanf("%d%d",&n,&m))solve();
}
详细
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 1808kb
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:
result:
wrong answer 1st lines differ - expected: '3 0', found: ''