# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683332 | groshi | Wall (CEOI14_wall) | C++17 | 610 ms | 171764 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>
using namespace std;
int t[500][500];
int kraw1[500][500];
int kraw2[500][500];
long long odw[200000];
int skad[200000];
bool bylo[200000];
vector<pair<int,int> > Q;
map<int,int> krawedz[700000];
map<int,bool> specjalna[700000];
int n,m;
struct wi{
vector<pair<int,int> > Q;
int bylo=0;
long long odw=0;
}*w;
void dodaj(int x)
{
while(x!=0)
{
specjalna[x][skad[x]]=1;
specjalna[skad[x]][x]=1;
x=skad[x];
}
}
void obwod(int x1,int y1)
{
int x=(x1-1)*(m+1)+y1-1;
int y=(x1-1)*(m+1)+y1;
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... |