# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723695 | LittleCube | Vision Program (IOI19_vision) | C++14 | 25 ms | 3532 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>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
int id[405][405], last, zero;
void construct_network(int H, int W, int K)
{
if (H * W == 2)
return;
last = H * W;
for (int i = 1; i < H + W; i++)
for (int j = 1; j < H + W; j++)
id[i][j] = -1;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
id[j + i + 1][H - i + j] = i * W + j;
vector<int> Hs(H + W), Ws(H + W);
for (int i = 1; i < H + W; i++)
{
vector<int> input;
for (int j = 1; j < H + W; j++)
if (id[i][j] >= 0)
input.emplace_back(id[i][j]);
Hs[i] = last++;
# | 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... |