# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15388 | tonyjjw | 쿼터너리 컴퓨터 (kriii3_Z) | C++98 | 0 ms | 1092 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int n,m;
int b[20];
int cmd[420][4];
int ans[420];
int c[20];
int d[20];
void f(int x){
if(x==n){
int i;
for(i=0;i<n;i++){
d[i]=c[i];
}
for(i=0;i<m;i++){
if(cmd[i][0]==0){
d[cmd[i][1]]=d[cmd[i][2]]+d[cmd[i][3]];
}
if(cmd[i][0]==1){
d[cmd[i][1]]=d[cmd[i][2]]^d[cmd[i][3]];
}
if(cmd[i][0]==2){
d[cmd[i][1]]=d[cmd[i][2]]+cmd[i][3];
}
if(cmd[i][0]==3){
d[cmd[i][1]]=d[cmd[i][2]]^cmd[i][3];
}
}
for(i=0;i<n;i++){
ans[i]+=d[i];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |