Submission #986442

#	Time	Username	Problem	Language	Result	Execution time	Memory
986442		thinknoexit	Vision Program (IOI19_vision)	C++17	0 / 100	3 ms	1240 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[202][202];
int n, m;
bool in(int i, int j) {
	return 0 <= i && i < n && 0 <= j && j < m;
}
void construct_network(int H, int W, int K) {
	n = H, m = W;
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < m;j++) {
			a[i][j] = i * m + j;
		}
	}
	vector<int> ans;
	for (int i = 0;i < n;i++) {
		for (int j = 0;j < m;j++) {
			vector<int> Q;
			int ii = i, jj = j + K;
			while (jj != j) {
				if (in(ii, jj)) Q.push_back(a[ii][jj]);
				ii++;
				jj--;
			}
			while (ii != i) {
				if (in(ii, jj)) Q.push_back(a[ii][jj]);
				ii--;
				jj--;
			}
			if (!Q.empty()) {
				Q.push_back(a[i][j]);
				ans.push_back(add_xor(Q));
			}
		}
	}
	add_not(add_or(ans));
}

• 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: 0 / 14
• Subtask 8: 0 / 19