Submission #1239057

#TimeUsernameProblemLanguageResultExecution timeMemory
1239057LudisseyVision Program (IOI19_vision)C++20
8 / 100
1 ms328 KiB
#include "vision.h" #include <bits/stdc++.h> #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() int h,w; using namespace std; int conv(int i, int j){ return (j+i*w); } int dist(int i, int j, int _i, int _j){ return (abs(i-_i)+abs(j-_j)); } void construct_network(int H, int W, int K) { h=H; w=W; vector<int> nodesCHECK; for (int i = 0; i < 1; i++) { for (int j = 0; j < 1; j++) { vector<int> tocheck; for (int _i = 0; _i < H; _i++) { for (int _j = j; _j < W; _j++) { if(dist(i,j,_i,_j)==K) tocheck.push_back(conv(_i,_j)); } } if(sz(tocheck)>0){ nodesCHECK.push_back(add_and({conv(i,j),add_or(tocheck)})); } } } add_or(nodesCHECK); }
#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...