# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1025372 | 2024-07-17T00:55:28 Z | LeaRouse | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "vision.h" #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long #define ff first #define ss second using namespace std; const int MAX=2e5+5; ll P[MAX],bit[MAX],d=0; void construct_network(int h,int w,int k){ vector<pair<int,int>>v; bool awa=false; for(int i=0;i<w*h;i++){ int a=i/w; int b=i-w*a; for(int j=i+1;j<w*h;j++){ int c=j/w; int d=j-w*c; if(abs(a-c)+abs(b-d)==k){ v.push_back({i,j}); if(v.size()==2){ awa=true; break; } } } if(awa) break; } int a=w*h; vector<int>r; for(auto it:v){ r.push_back(it.ff); r.push_back(it.ss); add_and(r); r.clear(); m.push_back(a); a++; } if(v.size()==2){ add_not(w*h); add_not(w*h+1); add_or(m); } }