제출 #421381

#제출 시각아이디문제언어결과실행 시간메모리
421381Dan4LifeVision Program (IOI19_vision)C++17
33 / 100
1075 ms1896 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { set<pair<int,int> > S; S.clear(); vector<int> v; v.clear(); for(int i = 0; i < H; i++) { for(int j = 0; j < W; j++) { for(int k = i; k < H; k++) { for(int l = 0; l < W; l++) { vector<int> Ns; Ns.clear(); Ns = {i*W+j, k*W+l}; if(abs(i-k)+abs(j-l)!=K or S.count({i*W+j, k*W+l})) continue; S.insert({i*W+j, k*W+l}); S.insert({k*W+l, i*W+j}); int x = add_and(Ns); v.push_back(x); } } } } add_or(v); }
#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...