Submission #795896

#TimeUsernameProblemLanguageResultExecution timeMemory
795896APROHACKVision Program (IOI19_vision)C++17
40 / 100
4 ms596 KiB
#include "vision.h" #include <bits/stdc++.h> #define pb push_back using namespace std; int h, w, k; int getPos(int x, int y){ return x*w + y; } void construct_network(int H, int W, int K) { h = H; w = W; k = K; if(max(H, W) <= 30){ vector<int>todos; for(int i = 0 ; i < H ; i ++){ for(int j = 0 ; j < W ; j ++){ vector<int>cuales; for(int xi = 0 ; xi < H ; xi ++){ for(int xj = 0; xj < W ; xj ++){ if(abs(xi-i) + abs(xj-j) == k)cuales.pb(getPos(xi, xj)); } } if(cuales.empty()){ continue; } int idxOr = add_or(cuales); todos.pb(add_and({idxOr, getPos(i, j)})); } } add_or(todos); }else{ vector<int> N; for(int i = 0 ; i < H ; i ++){ for(int j = 0 ; j < W ; j ++){ if(i + j == k)N.pb(getPos(i, j)); } } add_or(N); } }
#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...