# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259224 | dsjong | Vision Program (IOI19_vision) | C++14 | 11 ms | 1280 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;
int H,W,K;
int get(int x,int y){
return x*W+y;
}
void construct_network(int h, int w, int k) {
H=h, W=w, K=k;
int ans1, ans2;
vector<int>cur, dif;
for(int i=0;i<H+W-1;i++){
vector<int>diag;
for(int j=0;j<H;j++){
int k=i-j;
if(0<=k && k<W) diag.push_back(get(j, k));
}
cur.push_back(add_xor(diag));
}
for(int i=1;i<cur.size();i++){
dif.push_back(add_and({cur[i], cur[i-1]}));
}
ans1=add_or(dif);
cur.clear();
dif.clear();
for(int i=-W+1;i<H;i++){
vector<int>diag;
for(int j=0;j<H;j++){
int k=j-i;
if(0<=k && k<W) diag.push_back(get(j, k));
}
cur.push_back(add_xor(diag));
}
for(int i=1;i<cur.size();i++){
dif.push_back(add_and({cur[i], cur[i-1]}));
}
ans2=add_or(dif);
add_and({ans1, ans2});
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... |