제출 #1050611

#제출 시각아이디문제언어결과실행 시간메모리
1050611dead0neVision Program (IOI19_vision)C++17
12 / 100
4 ms1240 KiB
#pragma GCC optimize("unroll-loops,Ofast,O3") #include <bits/stdc++.h> #include "vision.h" #define pb push_back #define mp make_pair #define spc << " " << #define endl "\n" #define all(x) x.begin(), x.end() //#define int long long #define ii pair<long long,int> #define vi vector<int> #define vii vector<ii> #define st first #define nd second #define inf 1e15 #define MOD 1000000007 #define MX 50005 using namespace std; void construct_network(int H, int W, int K){ vi results; for(int i=0; i<H; i++){ for(int j=0; j<W; j++){ if(i+j+K > H+W-2) continue; vi ors; for(int k=0; k<=K; k++){ if(i+k<H && j+K-k<W) ors.pb((i+k)*W+(j+K-k)); } int res = add_or(ors); results.pb(add_and({i*W+j, res})); } } add_or(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...
#Verdict Execution timeMemoryGrader output
Fetching results...