Submission #301044

#	Time	Username	Problem	Language	Result	Execution time	Memory
301044		MickyOr	Vision Program (IOI19_vision)	C++17	14 / 100	62 ms	6132 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define fore(i, b, e) for (int i = b; i < (int)e; ++i)
#define pb push_back

using namespace std;

typedef vector<int> vi;

vector<vi> diagL(410), diagR(410);

vi getRes(int H, int W, int k, vector<vi> &diag) {
	vi res, v, pref;
	fore(i, 0, H+W-1) {
		v.pb(add_or(diag[i]));
		pref.pb(add_or(v));
		if (i > 0) {
			if (i >= k) {
				int tmp = add_xor({pref[i-1], pref[i-k]});
				res.pb( add_and({v[i], tmp}) );
			}
			else if (i == k-1) {
				res.pb( add_and({v[i], pref[i-1]}) );
			}
		}
	}
	return res;
}

// dist < k
int solve(int H, int W, int k) {
	vi resR, resL;
	resL = getRes(H, W, k, diagL);
	resR = getRes(H, W, k, diagR);
	int rL = add_or(resL);
	int rR = add_or(resR);
	return add_and({rL, rR});
}

void construct_network(int H, int W, int K) {
	fore(i, 0, H) {
		fore(j, 0, W) {
			diagL[i+j].pb(i*W + j);
			diagR[i-j+W-1].pb(i*W + j);
		}
	}
	add_xor({solve(H, W, K), solve(H, W, K+1)});
}

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