Submission #261884

#	Time	Username	Problem	Language	Result	Execution time	Memory
261884		kshitij_sodani	Vision Program (IOI19_vision)	C++14	44 / 100	236 ms	3056 KiB

vision

#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#include "vision.h"

void construct_network(int n, int m, int k) {
	vector<int> cur;
	//cout<<n<<","<<m<<","<<k<<endl;
	int pos=n*m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			vector<int> cur2;
			for(int kk=0;kk<n;kk++){
				for(int ll=0;ll<m;ll++){
					if(abs(i-kk)+abs(j-ll)==k){
					//	cout<<i<<":"<<j<<":"<<kk<<":"<<ll<<endl;
						cur2.pb(kk*m+ll);
					}
				}
			}
			if(cur2.size()==0){
				continue;
			}
		//	cout<<i<<":"<<j<<":"<<cur2.size()<<endl;
		/*	cout<<i+j*n<<endl;
			for(auto j:cur2){
				cout<<j<<",";
			}
			cout<<endl;*/

			add_or(cur2);
			add_and({pos,i*m+j});
			cur.pb(pos+1);
			pos+=2;
		}
	}
	add_or(cur);

	/*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);*/
}



//g++   -o bb grader.cpp vision.cpp

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