# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48315 | Extazy | Adriatic (CEOI13_adriatic) | C++17 | 2077 ms | 8636 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>
#define endl '\n'
using namespace std;
const int N = 250007;
const pair < int, int > NEUTRAL = make_pair(-1,-1);
int n;
int dist[N];
bool used[N];
vector < int > v[N];
pair < int, int > a[N];
int bfs(int start) {
int ans=0,i,curr;
queue < int > q;
fill(used+1,used+1+n,false);
dist[start]=0;
used[start]=true;
q.push(start);
for(i=1;i<=n;i++) {
if((a[i].first>a[start].first && a[i].second>a[start].second) || (a[i].first<a[start].first && a[i].second<a[start].second)) {
used[i]=true;
dist[i]=1;
q.push(i);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |