Submission #289769

#	Time	Username	Problem	Language	Result	Execution time	Memory
289769		dvdg6566	Vision Program (IOI19_vision)	C++14	33 / 100	118 ms	1148 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=151000;
const ll MOD=998244353;

vi A;

void construct_network(int H, int W, int K) {
	int cur=H*W;
	for(int i=0;i<H;++i)for(int j=0;j<H;++j){
		for(int k=0;k<W;++k)for(int l=0;l<W;++l){
			if(abs(i-j) + abs(k-l) != K)continue;
			if(i<j)continue;
			vi X;
			X.pb(i*W+k);
			X.pb(j*W+l);
			// for(auto i:X)cerr<<i<<' ';cerr<<'\n';
			add_and(X);
			// cerr<<"Ok\n";
			A.pb(cur);++cur;
		}
	}
	// for(auto t:A)cerr<<t<<' ';cerr<<'\n';
	add_or(A);
	return;
}

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