Submission #245359

#TimeUsernameProblemLanguageResultExecution timeMemory
245359crossing0verVision Program (IOI19_vision)C++17
41 / 100
7 ms1148 KiB
#include<bits/stdc++.h> #define vi vector<int> #define pii pair<int,int> #define pb push_back #ifndef local #include "vision.h" #endif using namespace std; int k,H,W; int get_id(int i,int j) { return i*W+j; } void smallCase() { vector<pii> s; for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) for (int a = i; a < H; a++) for (int b = 0; b < W; b++) { if (abs(i-a)+abs(j-b) == k) s.pb({get_id(i,j),get_id(a,b)}); } int a = 0; for (auto i : s) { vector<int> v = {i.first,i.second}; a|=add_and(v); } int x = s.size(); vi v; for (int i = H*W; i < H*W + x;i++) v.pb(i); if (v.size() == 0) { add_not(1); return; } add_or(v); } void construct_network(int H1, int W1, int k1) { k = k1; H = H1, W = W1; vector<pii> s; if (H1*W1*4 < 10000) { smallCase(); return; } vector<int> v; int cnt = 0; for (int i = 0; i < H;i++) for (int j = 0;j < W; j++) if (i + j == k) { add_and({0,get_id(i,j)}); cnt++; } for (int i = H*W; i < H*W + cnt; i++) v.pb(i); add_or(v); }
#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...