제출 #986423

#제출 시각아이디문제언어결과실행 시간메모리
986423thinknoexitVision Program (IOI19_vision)C++17
8 / 100
1 ms760 KiB
#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 < 1;i++) {
		for (int j = 0;j < 1;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()) ans.push_back(add_and({ a[i][j], add_xor(Q) }));
		}
	}
	add_or(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...