Submission #602865

#TimeUsernameProblemLanguageResultExecution timeMemory
602865misteg168Vision Program (IOI19_vision)C++17
0 / 100
1 ms468 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int dist(ll a, ll b,int W){ return abs(a%W-b%W) + abs(a/W-b/W); } void construct_network(int H, int W, int K) { vector<int> Ns; ll it = 0; for(int i = 0; i < 1; i+=2){ for(int j = 0; j < W*H; j+=2){ for(int x = -1; x <= 1; x++){ for(int y = -1; y <= 1; y++){ if( !(x+i >= 0 && x+i < H && y+j >= 0 && y+j < W) ) continue; Ns.push_back((x+i)*W+y+j); } } it++; Ns.clear(); } } for(int i = H*W; i < H*W+it; i++) Ns.push_back(i); if(!Ns.empty()) add_or(Ns); else add_or({0, 1}); }
#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...