# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153453 | myungwoo | Vision Program (IOI19_vision) | C++14 | 6 ms | 760 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 <bits/stdc++.h>
#include "vision.h"
using namespace std;
int num[201][201];
void construct_network(int H, int W, int K)
{
int idx = 0;
for (int i=1;i<=H;i++) for (int j=1;j<=W;j++) num[i][j] = idx++;
vector <int> or_arr;
for (int i=1;i<=H;i++) for (int j=1;j<=W;j++){
// Subtask 6
if (!(H <= 30 && W <= 30 || min(H, W) == 1))
if (i != 1 || j != 1)
continue;
vector <int> diamond;
for (int dy=-K;dy<=K;dy++){
for (int sx=-1;sx<2;sx+=2){
int dx = sx*(K-abs(dy));
int y = i+dy, x = j+dx;
if (y < 1 || y > H || x < 1 || x > W) continue;
diamond.push_back(num[y][x]);
}
}
if (diamond.empty()) continue;
int x = add_or(diamond);
or_arr.push_back(add_and({x, num[i][j]}));
}
add_or(or_arr);
}
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... |