oj.uz

Submission #15391

# Submission time Handle Problem Language Result Execution time Memory
15391 2015-07-12T07:04:25 Z tonyjjw 쿼터너리 컴퓨터 (kriii3_Z) C++
0 / 126
 0 ms 1092 KB 
#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];
		}
		return;
	}
	for(c[x]=0;c[x]<4;c[x]++){
		if(c[x]==b[x])continue;
		f(x+1);
	}
}
int main(){
	int i,j;
	scanf("%d%d",&n,&m);
	for(i=0;i<n;i++){
		scanf("%d",&b[i]);
	}
	for(i=0;i<m;i++){
		scanf("%d%d%d%d",&cmd[i][0],&cmd[i][1],&cmd[i][2],&cmd[i][3]);
	}
	f(0);
	for(i=0;i<n;i++){
		printf("%d ",ans[i]%4);
	}
}

Subtask #1
0.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1092 KB Output is correct
2 Correct 0 ms 1092 KB Output is correct
3 Correct 0 ms 1092 KB Output is correct
4 Incorrect 0 ms 1092 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -