제출 #439196

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
439196	2021-06-29 11:26:31	dutch	Vision Program (IOI19_vision)	C++17	100 / 100	18 ms	1440 KiB

vision

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;
#include "vision.h"
#define G(i, j) (rotated ? j*h + i : i*w + j)
#define V(i, j) vector<int> {i, j}
const int N = 200, BIT = 8;
int a[N], b[2][N], p, pTrue, pFalse;
bool rotated = 0;
vector<int> sum(vector<int> &x, vector<int> &y){
  vector<int> res(BIT);
  int extra = pFalse;
  for(int c=0; c<BIT; ++c){
    add_xor(vector<int> {x[c], y[c], extra}); res[c] = p++;
    add_and(V(x[c], extra)); int a1 = p++;
    add_and(V(y[c], extra)); int a2 = p++;
    add_and(V(x[c], y[c])); int a3 = p++;
    add_or(vector<int> {a1, a2, a3}); extra = p++;
  }
  return res;
}
void construct_network(int h, int w, int k){
  if((p = h*w) < 3) return void(add_and(V(0, 1)));
  add_and(vector<int> {0, 1, 2}); pFalse = p++;
  add_not(pFalse); pTrue = p++;
  vector<int> one(BIT, pFalse); one[0] = pTrue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 15 / 15
• Subtask 5: 12 / 12
• Subtask 6: 8 / 8
• Subtask 7: 14 / 14
• Subtask 8: 19 / 19