Submission #818118

#	Time	Username	Problem	Language	Result	Execution time	Memory
818118		Lobo	Vision Program (IOI19_vision)	C++17	21 / 100	13 ms	3404 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(),x.end()

void construct_network(int n, int m, int K) {
	// std::vector<int> Ns;
	// Ns = {0, 1};
	// int a = add_and(Ns);
	// Ns = {0, a};
	// int b = add_or(Ns);
	// Ns = {0, 1, b};
	// int c = add_xor(Ns);
	// add_not(c);

	// vector<pair<int,int>> wtf = {{1,1},{1,-1},{-1,1},{-1,-1}};

	// vector<int> checks;
	// for(int i = 0; i < n; i++) {
	// 	if(max(n,m) > 30 && min(n,m) != 1 && i != 0) continue;
	// 	for(int j = 0; j < m; j++) {
	// 		if(max(n,m) > 30 && min(n,m) != 1 && j != 0) continue;
	// 		vector<int> valid_pos;
	// 		for(int d1 = 0; d1 <= k; d1++) {
	// 			for(auto X : wtf) {
	// 				int ii = i+d1*X.fr;
	// 				if(d1 == 0 && X.fr == -1) continue;
	// 				int jj = j+(k-d1)*X.sc;
	// 				if((k-d1) == 0 && X.sc == -1) continue;

	// 				if(ii >= 0 && ii < n && jj >= 0 && jj < m && i*m+j < ii*m+jj) {
	// 					valid_pos.pb(ii*m+jj);
	// 				}
	// 			}
	// 		}
	// 		if(valid_pos.size() == 0) continue;
	// 		int or_valid_pos = add_or(valid_pos);
	// 		checks.pb(add_and(vector<int>{i*m+j,or_valid_pos}));
	// 	}
	// }
	// add_or(checks);

	vector<int> checks0;

	for(int add = 0; K+add <= n+m-2 && add <= 20; add+= 2) {
		int k = K+add;
		vector<int> checks;
		for(int it = 0; it <= n+m-2; it++) {
			int i,j;
			if(it <= n-1) {
				i = n-1-it;
				j = 0;
			}
			else {
				i = 0;
				j = it-n+1;
			}

			vector<int> diag0,diag1;
			int i0,j0,i1,j1;

			i0 = i-i;
			j0 = j-i;
			i1 = i-i;
			j1 = j+k-i;

			while(i0 <= n-1) {
				if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0);
				i0++;
				j0++;
			}

			while(i1 <= n-1) {
				if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1);
				i1++;
				j1++;
			}

			if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)}));
			for(auto x : diag0) {
				// cout << " ++ " << x/m << " " << x%m << endl;
			}
			for(auto x : diag1) {
				// cout << " -- " << x/m << " " << x%m << endl;
			}
			diag0.clear();
			diag1.clear();

			if(it <= n-1) {
				i = it;
				j = 0;
			}
			else {
				i = n-1;
				j = it-n+1;
			}

			i0 = i-i;
			j0 = j+i;
			i1 = i-i;
			j1 = j+k+i;

			// cout << i << " " << j << endl;

			while(i0 <= n-1) {
				if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0);
				i0++;
				j0--;
			}

			while(i1 <= n-1) {
				if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1);
				i1++;
				j1--;
			}

			if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)}));
		}

		if(add == 0) checks0.pb(add_or(checks));
		else checks0.pb(add_not(add_or(checks)));
	}

	add_and(checks0);
}

Compilation message (stderr)

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:84:13: warning: unused variable 'x' [-Wunused-variable]
   84 |    for(auto x : diag0) {
      |             ^
vision.cpp:87:13: warning: unused variable 'x' [-Wunused-variable]
   87 |    for(auto x : diag1) {
      |             ^

• Subtask 1: 10 / 10
• Subtask 2: 11 / 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