# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892913 | Muhammad_Aneeq | Vision Program (IOI19_vision) | C++17 | 1044 ms | 109136 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 <vector>
#include <map>
#include "vision.h"
using namespace std;
int h,w;
int ind;
map<pair<int,int>,bool>d;
vector<int>g;
void check(int i,int j,int k,int l)
{
if (i<0||i>=h||j<0||j>=w)
return;
int x=i*w+j;
if (d[{x,k*w+l}]==1)
return;
d[{x,k*w+l}]=d[{k*w+l,x}]=1;
g.push_back(x);
}
void check1(vector<int>z)
{
add_or(z);
}
void construct_network(int H,int W,int K)
{
h=H;w=W;
ind = H*W;
for (int i=0;i<H;i++)
for (int j=0;j<W;j++)
{
g={};
# | 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... |