# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289771 | dvdg6566 | Vision Program (IOI19_vision) | C++14 | 225 ms | 1140 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=151000;
const ll MOD=998244353;
vi A;
void construct_network(int H, int W, int K) {
int cur=H*W;
ll P=0;
for(int i=0;i<H;++i)for(int k=0;k<W;++k){
vi X;
for(int j=0;j<H;++j)for(int l=0;l<W;++l){
if(abs(i-j) + abs(k-l) != K)continue;
if(i<j)continue;
X.pb(j*W+l);
}
add_or(X);
vi Y;
Y.pb(cur);++cur;
Y.pb(i*W+k);
add_and(Y);
A.pb(cur);
++cur;
}
add_or(A);
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |