Submission #398590

#	Time	Username	Problem	Language	Result	Execution time	Memory
398590		ly20	Vision Program (IOI19_vision)	C++17	14 / 100	13 ms	1532 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 210;
vector <int> resp;
vector <int> col[MAXN], ln[MAXN];
int d0c, d0l;
int idc[MAXN], idl[MAXN];
int d1l, d1c;
void construct_network(int h, int w, int k) {
	for(int i = 0; i < h; i++) {
		for(int j = 0; j < w; j++) {
			int id = i * w + j;
			col[j].push_back(id);
			ln[i].push_back(id);
		}
	}
	for(int i = 0; i < h; i++) idl[i] = add_or(ln[i]);
	for(int i = 0; i < w; i++) idc[i] = add_or(col[i]);
	vector <int> cl, l;
	for(int i = 0; i < h; i++) l.push_back(idl[i]);
	for(int i = 0; i < w; i++) cl.push_back(idc[i]);
	d0c = add_xor(cl); d0l = add_xor(l);
	cl.clear(); l.clear();
	for(int i = 0; i < h - 1; i++) {
		vector <int> t;
		t.push_back(idl[i]); t.push_back(idl[i + 1]);
		l.push_back(add_and(t));
	}
	if(l.size() == 0) {
		d1l = add_not(d0l);
 	}
	else d1l = add_or(l);
	for(int i = 0; i < w - 1; i++) {
		vector <int> t;
		t.push_back(idc[i]); t.push_back(idc[i + 1]);
		cl.push_back(add_and(t));
	}
	if(cl.size() == 0) {
		d1c = add_not(d0c);
	}
	else d1c = add_or(cl);
	vector <int> t, t1, t2;
	t1.push_back(d0c); t1.push_back(d1l);
	t2.push_back(d1c); t2.push_back(d0l);
	t.push_back(add_and(t1)); t.push_back(add_and(t2));
	add_or(t);
}

• 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: 14 / 14
• Subtask 8: 0 / 19