제출 #484482

#제출 시각아이디문제언어결과실행 시간메모리
484482StrawHatWessVision Program (IOI19_vision)C++17
8 / 100
1 ms292 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int>vi; #define pb push_back #define FOR(i,a,b) for(int i=a; i<b; i++) int ckmax(int &x, int y){x=max(x,y); return x; } //-------------------------------------------- //sub 1,2,5 int N,M; int cell(int x, int y){return x*M+y;} void construct_network(int N, int M, int K) { ::N=N; ::M=M; vi vec; FOR(x,0,min(N,K+1)){ int y=K-x; if(y<0 || y>=M) continue; vec.pb(add_and(vi{0,cell(x,y)})); } add_or(vec); } /* 2 3 3 0 0 0 1 0 0 0 2 0 0 1 0 0 0 1 1 0 0 1 2 0 1 0 2 0 1 1 0 0 1 1 1 0 1 1 2 0 2 1 0 0 2 1 1 0 2 1 2 1 0 1 1 1 0 1 2 1 1 1 2 -1 */
#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...