Submission #15761

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
15761	2015-07-21 10:14:29	myungwoo	쿼터너리 컴퓨터 (kriii3_Z)	C++14	126 / 126	363 ms	1088 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
#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];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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