제출 #1164918

#제출 시각아이디문제언어결과실행 시간메모리
1164918AlgorithmWarriorVision Program (IOI19_vision)C++20
8 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include "vision.h" using namespace std; int ind(int lin,int col,int W){ return lin*W+col; } bool inmat(int lin,int col,int H,int W){ return 0<=lin && lin<H && 0<=col && col<W; } void construct_network(int H, int W, int K) { vector<int>ask; int lin=0,col=K; while(col>=0){ if(inmat(lin,col,H,W)) ask.push_back({ind(lin,col,W)}); ++lin; --col; } add_or(ask); }
#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...