제출 #1238105

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238105		Sir_Ahmed_Imran	Vision Program (IOI19_vision)	C++17	0 / 100	5 ms	1096 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 20000001
#define append push_back

int r[MAXN];
int c[MAXN];

void construct_network(int H, int W, int k) {
	int n, m, xr, xc, cr, cc, x, y;
	n = H, m = W;
	vector<int> v;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++)
			v.append(i * m + j);
		r[i] = add_xor(v);
		v.clear();
	}
	for(int j = 0; j < m; j++){
		for(int i = 0; i < n; i++)
			v.append(i * m + j);
		c[j] = add_xor(v);
		v.clear();
	}
	for(int i = 0; i < n; i++)
		v.append(r[i]);
	xr = add_or(v);
	xr = add_not(xr);
	v.clear();
	for(int j = 0; j < m; j++)
		v.append(c[j]);
	xc = add_or(v);
	xc = add_not(xc);
	v.clear();
	for(int i = 1; i < n; i++)
		v.append(add_and({r[i - 1], r[i]}));
	cr = add_or(v);
	v.clear();
	for(int j = 1; j < m; j++)
		v.append(add_and({c[j - 1], c[j]}));
	cc = add_or(v);
	v.clear();
	x = add_and({xr, cc});
	y = add_and({xc, cr});
	add_or({x, y});
}

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