# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101487 | dantoh000 | Adriatic (CEOI13_adriatic) | C++14 | 2067 ms | 263168 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;
typedef pair<int,int> ii;
int main(){
int n;
scanf("%d",&n);
vector<int> adjlist[n];
vector<ii> co(n);
for (int i = 0; i < n; i++){
scanf("%d%d",&co[i].first,&co[i].second);
for (int j = 0; j < i; j++){
if ((co[i].first < co[j].first && co[i].second < co[j].second) ||
(co[i].first > co[j].first && co[i].second > co[j].second)){
adjlist[i].push_back(j);
adjlist[j].push_back(i);
}
}
}
int ans = 0;
int dist[n];
for (int i = 0; i < n; i++){
ans = 0;
memset(dist,-1,sizeof(dist));
queue<int> q;
dist[i] = 0; q.push(i);
while (q.size()){
int u = q.front(); q.pop();
for (auto v : adjlist[u]){
if (dist[v] == -1){
dist[v] = dist[u]+1;
ans += dist[v];
q.push(v);
}
}
}
printf("%d\n",ans);
}
}
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... |