# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159976 | 44442 | Konj (COCI19_konj) | C++11 | 16 ms | 8952 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 n,ax[200004],ay[200004],bx[200004],by[200004],c,d,v[304][304],x,y,a,b,f[304][304],minn,maxx,MINN,MAXX,ok=1,t,tt,aa,aaa,bb,bbb,ca,da,ii,jj,ox,oy,kx,ky;
bool k[304][304],vis[200004];
deque<int>kor;
pair<int,int>p,r,h[304][304],g[400004];
int main (){
ios::sync_with_stdio(0);
scanf("%d",&n);
minn=504;
MINN=504;
for(int i=1;i<n+1;i++){
scanf("%d %d %d %d\n", &ax[i],&ay[i],&bx[i],&by[i]);
p=make_pair(ax[i],ay[i]);
r=make_pair(bx[i],by[i]);
if(!h[ax[i]][ay[i]].first){
g[ok]=p;
ok++;
h[ax[i]][ay[i]]=make_pair(1,ok-1);
}
if(!h[bx[i]][by[i]].first){
g[ok]=r;
ok++;
h[bx[i]][by[i]]=make_pair(1,ok-1);
}
t=h[ax[i]][ay[i]].second;
tt=h[bx[i]][by[i]].second;
k[t][tt]=1;
k[tt][t]=1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |