Submission #1369815

#TimeUsernameProblemLanguageResultExecution timeMemory
1369815viduxVision Program (IOI19_vision)C++17
33 / 100
58 ms1216 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void construct_network(int n, int m, int K) {
	// sub 1 2 5
	{
		vector<int> Q, all;
		for (int i1 = 0; i1 < n; i1++) for (int j1 = 0; j1 < m; j1++) {
			for (int i2 = i1; i2 < n; i2++) for (int j2 = 0; j2 < m; j2++) {
				if (i2-i1+abs(j2-j1) != K) continue;
				int id1 = i1*m+j1;
				int id2 = i2*m+j2;
				Q = {id1, id2};
				int p = add_and(Q);
				all.push_back(p);
			}
		}
		Q.clear();
		for (int i : all) Q.push_back(i);
		int ans = add_or(Q);
	}
}

// 1 2 3 5 6 7
// 10+11+11+12+8+14 = 66
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...