답안 #15761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
15761	2015-07-21T10:14:29 Z	myungwoo	쿼터너리 컴퓨터 (kriii3_Z)	C++14	126 / 126	363 ms	1088 KB

Z

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<algorithm>
 
using namespace std;
 
typedef long long ll;
typedef pair<int,int> pii;

int D[30];
int ord[400][4];
ll ans[30];

int main()
{
	int N, M;
	scanf("%d%d", &N, &M);
	for(int i = 0; i < N; i++) scanf("%d", D+i);
	for(int i = 0; i < M; i++) scanf("%d%d%d%d", ord[i], ord[i]+1, ord[i]+2, ord[i]+3);
	for(int i = 0; i < 1<<N; i++){
		pii mem[30] = {};
		ll mul = 1;
		for(int j = 1, k = 0; j < 1<<N; j*=2, k++){
			int p = !!(i&j), q = 1 - D[k] / 2;
			mem[k].first = p;
			if( p ^ (D[k]%2 == 0) ) mem[k].second = q;
			else mem[k].second = 1<<k+1, mul = mul * 2;
		}
		for(int j = 0; j < M; j++){
			int o = ord[j][0], x = ord[j][1], y = ord[j][2], z = ord[j][3];
			pii A = mem[y], B = mem[z], C;
			if( o >= 2 ) B = pii(z%2, z/2);
			if( A.first == 1 && B.first == 1 && o%2 == 0){
				C.first = 0;
				C.second = A.second ^ B.second ^ 1;
			}
			else{
				C.first = A.first ^ B.first;
				C.second = A.second ^ B.second;
			}
			mem[x] = C;
		}
		for(int j = 0; j < N; j++){
			if( mem[j].second > 1 ) ans[j] += mul;
			else if( mem[j].second == 1 ) ans[j] += mul * 2;
			ans[j] += mem[j].first * mul;
		}
	}
	for(int i = 0; i < N; i++) printf("%lld ", ans[i]%4);
    return 0;
}

Subtask #1

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1088 KB	Output is correct
2	Correct	0 ms	1088 KB	Output is correct
3	Correct	0 ms	1088 KB	Output is correct
4	Correct	0 ms	1088 KB	Output is correct
5	Correct	0 ms	1088 KB	Output is correct
6	Correct	0 ms	1088 KB	Output is correct
7	Correct	0 ms	1088 KB	Output is correct
8	Correct	0 ms	1088 KB	Output is correct
9	Correct	0 ms	1088 KB	Output is correct
10	Correct	0 ms	1088 KB	Output is correct
11	Correct	0 ms	1088 KB	Output is correct
12	Correct	0 ms	1088 KB	Output is correct
13	Correct	0 ms	1088 KB	Output is correct
14	Correct	0 ms	1088 KB	Output is correct
15	Correct	6 ms	1088 KB	Output is correct
16	Correct	6 ms	1088 KB	Output is correct
17	Correct	21 ms	1088 KB	Output is correct
18	Correct	22 ms	1088 KB	Output is correct
19	Correct	21 ms	1088 KB	Output is correct
20	Correct	20 ms	1088 KB	Output is correct

Subtask #2

95.0 / 95.0

#	결과	실행 시간	메모리	Grader output
1	Correct	40 ms	1088 KB	Output is correct
2	Correct	80 ms	1088 KB	Output is correct
3	Correct	164 ms	1088 KB	Output is correct
4	Correct	326 ms	1088 KB	Output is correct
5	Correct	35 ms	1088 KB	Output is correct
6	Correct	78 ms	1088 KB	Output is correct
7	Correct	158 ms	1088 KB	Output is correct
8	Correct	310 ms	1088 KB	Output is correct
9	Correct	46 ms	1088 KB	Output is correct
10	Correct	90 ms	1088 KB	Output is correct
11	Correct	182 ms	1088 KB	Output is correct
12	Correct	363 ms	1088 KB	Output is correct
13	Correct	39 ms	1088 KB	Output is correct
14	Correct	85 ms	1088 KB	Output is correct
15	Correct	165 ms	1088 KB	Output is correct
16	Correct	330 ms	1088 KB	Output is correct
17	Correct	40 ms	1088 KB	Output is correct
18	Correct	82 ms	1088 KB	Output is correct
19	Correct	164 ms	1088 KB	Output is correct
20	Correct	327 ms	1088 KB	Output is correct