답안 #15760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15760 2015-07-21T10:13:02 Z myungwoo 쿼터너리 컴퓨터 (kriii3_Z) C++14
126 / 126
371 ms 1728 KB
//*
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<queue>
 
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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1728 KB Output is correct
2 Correct 1 ms 1728 KB Output is correct
3 Correct 0 ms 1728 KB Output is correct
4 Correct 0 ms 1728 KB Output is correct
5 Correct 0 ms 1728 KB Output is correct
6 Correct 0 ms 1728 KB Output is correct
7 Correct 0 ms 1728 KB Output is correct
8 Correct 0 ms 1728 KB Output is correct
9 Correct 0 ms 1728 KB Output is correct
10 Correct 0 ms 1728 KB Output is correct
11 Correct 0 ms 1728 KB Output is correct
12 Correct 0 ms 1728 KB Output is correct
13 Correct 0 ms 1728 KB Output is correct
14 Correct 0 ms 1728 KB Output is correct
15 Correct 6 ms 1728 KB Output is correct
16 Correct 6 ms 1728 KB Output is correct
17 Correct 17 ms 1728 KB Output is correct
18 Correct 23 ms 1728 KB Output is correct
19 Correct 23 ms 1728 KB Output is correct
20 Correct 22 ms 1728 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1728 KB Output is correct
2 Correct 81 ms 1728 KB Output is correct
3 Correct 160 ms 1728 KB Output is correct
4 Correct 324 ms 1728 KB Output is correct
5 Correct 39 ms 1728 KB Output is correct
6 Correct 79 ms 1728 KB Output is correct
7 Correct 157 ms 1728 KB Output is correct
8 Correct 307 ms 1728 KB Output is correct
9 Correct 48 ms 1728 KB Output is correct
10 Correct 95 ms 1728 KB Output is correct
11 Correct 192 ms 1728 KB Output is correct
12 Correct 371 ms 1728 KB Output is correct
13 Correct 42 ms 1728 KB Output is correct
14 Correct 84 ms 1728 KB Output is correct
15 Correct 172 ms 1728 KB Output is correct
16 Correct 338 ms 1728 KB Output is correct
17 Correct 37 ms 1728 KB Output is correct
18 Correct 92 ms 1728 KB Output is correct
19 Correct 165 ms 1728 KB Output is correct
20 Correct 327 ms 1728 KB Output is correct