Submission #298504

#TimeUsernameProblemLanguageResultExecution timeMemory
298504square1001Vision Program (IOI19_vision)C++14
33 / 100
851 ms1768 KiB
#include "vision.h" #include <vector> using namespace std; void construct_network(int H, int W, int K) { vector<pair<int, int> > cond; for(int i = 0; i < H; ++i) { for(int j = 0; j < W; ++j) { for(int k = i; k < H; ++k) { for(int l = (k == i ? j + 1 : 0) ; l < W; ++l) { int d = (k - i) + abs(l - j); if(d == K) { cond.push_back(make_pair(i * W + j, k * W + l)); } } } } } for(int i = 0; i < int(cond.size()); ++i) { add_and({ cond[i].first, cond[i].second }); } vector<int> fin; for(int i = 0; i < int(cond.size()); ++i) { fin.push_back(H * W + i); } add_or(fin); }
#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...