Submission #602941

#TimeUsernameProblemLanguageResultExecution timeMemory
602941misteg168Vision Program (IOI19_vision)C++17
33 / 100
1089 ms976 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; vector<bool> vis(W*H); for(int i = 0; i < W*H; i++){ //~ if(!add_or({i})) continue; for(int j = i+1; j < W*H; j++){ if(dist(i, j, W) == K) add_and({i, j}), it++; } } 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...