Submission #1216582

#TimeUsernameProblemLanguageResultExecution timeMemory
1216582brintonVision Program (IOI19_vision)C++20
8 / 100
1 ms328 KiB
#include <bits/stdc++.h> #include "vision.h" using namespace std; void construct_network(int H, int W, int K) { auto id = [&](int i,int j){ return i*W+j; }; auto dist = [](int i1,int i2,int j1,int j2){ return abs(i1-i2)+abs(j1-j2); }; vector<int> good; for(int i = 0;i <= 0;i++){ for(int j = 0;j <= 0;j++){ vector<int> cur; for(int pi = 0;pi < H;pi++){ for(int pj = 0;pj < W;pj++){ if(dist(i,pi,j,pj) == K){ cur.push_back(id(pi,pj)); } } } if(!cur.empty()){ int a = add_or(cur); good.push_back(add_and({a,id(i,j)})); } } } if(good.size() > 1) add_or(good); }
#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...