| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1363920 | vivkostov | Vision Program (IOI19_vision) | C++20 | 0 ms | 348 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>v;
int n,m,k;
void add(int i,int j,int ind)
{
if(ind)
{
v.push_back(ind);
return;
}
if(i<n&&j<m)
{
v.push_back(i*m+j);
}
}
void resh()
{
int i=k,j=0;
for(int z=0;z<=k;z++)
{
add(i,j,0);
i--;
j++;
}
add_or(v);
}
void construct_network(int H, int W, int K)
{
n=H;
m=W;
k=K;
if((H>100||W>100)&&(H!=1&&W!=1))
{
resh();
return;
}
int ii,jj;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(i==n-1&&j==m-1)continue;
v.clear();
add(i,j,0);
ii=i+k;
jj=j;
for(int z=0;z<=k;z++)
{
add(ii,jj,0);
ii--;
jj++;
}
add_xor(v);
}
}
v.clear();
add(n-1,m-1,0);
for(int i=n*m;i<=n*m-2;i++)
{
add(0,0,i);
}
add_xor(v);
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
