Submission #294838

#	Time	Username	Problem	Language	Result	Execution time	Memory
294838		egekabas	Vision Program (IOI19_vision)	C++14	12 / 100	13 ms	1404 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> neighbour;
			for(int k = 0; k <= K; ++k){
				int i1 = i+k;
				int j1 = j+(K-k);
				if(i1 < H && j1 < W)
					neighbour.pb(i1*W+j1);
			}
			for(int k = 0; k <= K; ++k){
				int i1 = i-k;
				int j1 = j-(K-k);
				if(i1 >= 0 && j1 >= 0)
					neighbour.pb(i1*W+j1);
			}
			if(neighbour.empty())
				continue;
			int cur = add_or(neighbour);
			finalcomp.pb(add_and({cur, i*W+j}));
		}
	add_or(finalcomp);
}

• 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