Submission #812727

#	Time	Username	Problem	Language	Result	Execution time	Memory
812727		fatemetmhr	Vision Program (IOI19_vision)	C++17	12 / 100	9 ms	2576 KiB

vision

// Comment!


#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


typedef long long ll;

#define mp     make_pair
#define all(x) x.begin(), x.end()
#define pb     push_back
#define fi     first
#define se     second

const int maxn5 = 2e5 + 10;

vector <int> ns;
int h, w, lenh[maxn5], lenw[maxn5];

int isk(int st, int k, int n){
	//cout << "here " << st << ' ' << k << ' ' << n << endl;
	if(n - 1 < k)
		return -1;
	if(k == 0){
		ns.clear();
		for(int i = 0; i < n; i++)
			ns.pb(i + st);
		int cur = add_or(ns);
		return add_not(cur);
	}
	////cout << "here " << st << ' ' << k << ' ' << n << endl;
	ns.clear();
	int st2 = -1;
	int last = -1;
	for(int i = 0; i + k < n; i++){
		ns.clear();
		ns = {i + st, i + k + st};
		////cout << i + st << ' ' << i + k + st << ' ' << i << endl;
		last = add_and(ns);
		if(st2 == -1)
			st2 = last;
	}
	////cout << "all here " << endl;
	ns.clear();
	for(int i = st2; i <= last; i++)
		ns.pb(i);
	//cout << "well " << endl;
	return add_or(ns);
}

void construct_network(int H, int W, int k) {

	h = H;
	w = W;
	int sth = -1, last = -1;
	for(int i = 0; i < h; i++){
		ns.clear();
		for(int j = 0; j < w; j++)
			ns.pb(i * w + j);
		last = add_xor(ns);
		if(sth == -1)
			sth = last;
	}
	int stw = last + 1;
	for(int j = 0; j < w; j++){
		ns.clear();
		for(int i = 0; i < h; i++)
			ns.pb(i * w + j);
		last = add_xor(ns);
	}
	//assert(false);
	memset(lenh, -1, sizeof lenh);
	memset(lenw, -1, sizeof lenw);
	int canh = 0, canw = 0;
	for(int i = 0; i <= k; i++){
		if(h - 1 >= i && w - 1 >= k - i)
			canh++;
		if(w - 1 >= i && h - 1 >= k - i)
			canw++;
	}
	int keeph = canh, keepw = canw;
	//cout << "ok " << keeph << ' ' << keepw << endl;
	if(keeph == 1){
		int have = 0;
		for(int i = 0; i <= k; i++) if(h - 1 >= i && w - 1 >= k - i)
			have = i;
		//cout << have << endl;
		int id = isk(sth, have, h);
		int id2 = isk(stw, k - have, w);
		ns = {id, id2};
		add_and(ns);
		return;
	}
	if(keepw == 1){
		int have = 0;
		for(int i = 0; i <= k; i++) if(h - 1 >= k - i && w - 1 >= i)
			have = i;
		int id = isk(stw, have, w);
		int id2 = isk(sth, k - have, h);
		ns = {id, id2};
		add_and(ns);
		return;
	}
	//cout << "here " << endl;
	for(int i = 0; i <= k; i++){
		if(h - 1 >= i && w - 1 >= k - i){
			if(canh == 1){
				ns.clear();
				for(int j = 0; j < i; j++) if(lenh[j] != -1)
					ns.pb(lenh[j]);
				if(ns.size()){
					lenh[i] = add_or(ns);
					lenh[i] = add_not(lenh[i]);
				}
				else
					assert(false);
			}
			else
				lenh[i] = isk(sth, i, h);

			canh--;
		}
		if(w - 1 >= i && h - 1 >= k - i){
			if(canw == 1){
				ns.clear();
				for(int j = 0; j < i; j++) if(lenw[j] != -1)
					ns.pb(lenw[j]);
				if(ns.size()){
					lenw[i] = add_or(ns);
					lenw[i] = add_not(lenw[i]);
				}
				else
					assert(false);
			}
			else
				lenw[i] = isk(stw, i, w);
			canw--;
		}
	}
	////cout << "done with h w" << endl; 
	int fr = -1;
	last = -1;
	for(int i = 0; i <= k; i++) if(lenh[i] != -1 && lenw[k - i] != -1){
		ns.clear();
		ns = {lenh[i], lenw[k - i]};
		last = add_and(ns);
		if(fr == -1)
			fr = last;
	}
	ns.clear();
	for(int i = fr; i <= last; i++)
		ns.pb(i);
	add_or(ns);
	return;
}

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