제출 #278263

#제출 시각아이디문제언어결과실행 시간메모리
278263petar_vitoracVision Program (IOI19_vision)C++14
20 / 100
1 ms384 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { // TEST CASE 5 if(min(H, W) == 1) { vector<int> toor; for(int i = 0; i < max(H, W)-K; i++) { vector<int> toadd = {i, i+K}; toor.push_back(add_and(toadd)); } add_or(toor); } // TEST CASE 6 else{ vector<int> toor; for(int i = 0; i < H; i++) { if(K-i < W) { toor.push_back(K-i + W*i); } } add_or(toor); } }
#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...