Submission #15458

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
15458	2015-07-12 08:02:17	myungwoo	쿼터너리 컴퓨터 (kriii3_Z)	C++14	31 / 126	4000 ms	1728 KiB

Z

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int N, M;
int F[18], A[18], B[18], ans[18];
struct Z{
  int t, x, y, z;
} Q[401];
void dfs(int n)
{
  if (n == N){
    for (int i=0;i<N;i++) B[i] = A[i];
    for (int i=1;i<=M;i++){
      if (Q[i].t == 0){
        B[Q[i].x] = (B[Q[i].y] + B[Q[i].z]) & 3;
      }else if (Q[i].t == 1){
        B[Q[i].x] = (B[Q[i].y] ^ B[Q[i].z]);
      }else if (Q[i].t == 2){
        B[Q[i].x] = (B[Q[i].y] + Q[i].z) & 3;
      }else{
        B[Q[i].x] = (B[Q[i].y] ^ Q[i].z);
      }
    }
    for (int i=0;i<N;i++) ans[i] = (ans[i] + B[i]) & 3;
    return;
  }
  for (int i=0;i<4;i++) if (i != F[n]){
    A[n] = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 31 / 31
• Subtask 2: 0 / 95