Submission #294900

#	Time	Username	Problem	Language	Result	Execution time	Memory
294900		egekabas	Vision Program (IOI19_vision)	C++14	44 / 100	37 ms	10992 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;
vector<int> g[200*200+5];
vector<pii> dir{{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
int vis[200*200+5];
int col[200*200+5];
void dfs(int v){
	vis[v] = 1;
	if(col[v] == 0)
		for(auto u : g[v])
			col[u] = 1;
	for(auto u : g[v])
		if(vis[u] == 0)
			dfs(u);
}
void construct_network(int H, int W, int K){
	srand(time(NULL));
	vector<int> finalcomp;
	for(int i = 0; i < H; ++i)
		for(int j = 0; j < W; ++j){
			for(int k = 0; k <= K; ++k)
				for(auto u : dir){
					int i1 = i + u.ff*k;
					int j1 = j + u.ss*(K-k);
					if(i1 >= 0 && i1 < H && j1 >= 0 && j1 < W)
						g[i*W+j].pb(i1*W+j1);
				}
		}
	for(int i = 0; i < H*W; ++i){
		if(vis[i] == 0){
			col[i] = rand()%2;
			dfs(i);
		}
		if(col[i] && g[i].size())
			finalcomp.pb(add_and({i, add_or(g[i])}));
	}
	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