제출 #1291355

#제출 시각아이디문제언어결과실행 시간메모리
1291355MMihalevVision Program (IOI19_vision)C++20
0 / 100
2 ms956 KiB
#include<iostream> #include<algorithm> #include<vector> #include "vision.h" using namespace std; int n,m,k; int tonum(int i,int j) { return i*n+j; } void construct_network(int H, int W, int K) { n=H; m=W; k=K; vector<int>positionscheck; for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { vector<int>cells; for(int i2=i;i2<n;i2++) { if(i2==i && j+k<m)cells.push_back(tonum(i2,j+k)); if(i2>i) { int rem=k-(i2-i); if(rem<0)break; if(j-rem>=0)cells.push_back(tonum(i2,j-rem)); if(j+rem<m)cells.push_back(tonum(i2,j+rem)); } } if(cells.size()==0)continue; int pos=add_or(cells); positionscheck.push_back(add_and({pos,tonum(i,j)})); } } add_or(positionscheck); }
#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...