제출 #1246171

#제출 시각아이디문제언어결과실행 시간메모리
1246171lizaVision Program (IOI19_vision)C++20
33 / 100
1 ms964 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { std::vector<int> Ns; int a; for(int i=0; i < H; i++) { for(int j=0; j < W; j++) { for(int k=0; k <= K; k++) { if(i*W+j < H*W && (i+k)*(W)+j+K-k < H*W && j+K-k<W) { // cout << i*W+j << " " << (i+k)*(W)+j+K-k<< "\n"; a = add_and({i*W+j, (i+k)*(W)+j+K-k}); } if(i*W+j < H*W && (i+k)*(W)+j-(K-k) < H*W && (i+k)*(W)+j-(K-k)>=0 && j-K+k<W && j-K+k>=0) { // cout << i*W+j << " " << (i+k)*(W)+j-K+k<< "\n"; a = add_and({i*W+j, (i+k)*(W)+j-(K-k)}); } } } } for(int i = H*W; i <= a; i++) { Ns.push_back(i); } add_or(Ns); }
#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...