Submission #294854

#	Time	Username	Problem	Language	Result	Execution time	Memory
294854		egekabas	Vision Program (IOI19_vision)	C++14	44 / 100	66 ms	3056 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
void construct_network(int H, int W, int K){
	vector<int> finalcomp;
	for(int i = 0; i < H; ++i)
		for(int j = 0; j < W; ++j){
			vector<int> fr;
			if(K == 1){
				if(i > 0)
					fr.pb(i*W+j-W);
				if(i < H-1)
					fr.pb(i*W+j+W);
				if(j > 0)
					fr.pb(i*W+j-1);
				if(j < W-1)
					fr.pb(i*W+j+1);
			}
			else{
				for(int i1 = 0; i1 < H; ++i1)
					for(int j1 = 0; j1 < W; ++j1)
						if(abs(i1-i)+abs(j1-j) == K)
							fr.pb(i1*W+j1);
			}
			if(fr.size())
				finalcomp.pb(add_and({i*W+j, add_or(fr)}));
		}
	add_or(finalcomp);
}

• 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