Submission #256681

#TimeUsernameProblemLanguageResultExecution timeMemory
256681b00n0rpVision Program (IOI19_vision)C++17
41 / 100
3 ms1148 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; #define REP(i,n) for(int i = 0; i < n; i ++) #define FOR(i,a,b) for(int i = a; i < b; i++) #define vi vector<int> #define pb push_back void construct_network(int H, int W, int K){ if(max(H,W) <= 30 or min(H,W) == 1){ vi v; REP(i1,H){ REP(j1,W){ REP(i2,H){ REP(j2,W){ if(i1*W+j1 < i2*W+j2 and abs(i1-i2)+abs(j1-j2) == K){ v.pb(add_and({i1*W+j1,i2*W+j2})); } } } } } add_or(v); // cout << ":-> " << v.size()+1 << endl; } else{ vi v; REP(i1,1){ REP(j1,1){ REP(i2,H){ REP(j2,W){ if(i1*W+j1 < i2*W+j2 and abs(i1-i2)+abs(j1-j2) == K){ v.pb(add_and({i1*W+j1,i2*W+j2})); } } } } } add_or(v); // cout << ":-> " << v.size()+1 << endl; } }
#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...