# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101455 | jamielim | Adriatic (CEOI13_adriatic) | C++14 | 2078 ms | 258988 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 main(){
int n;
scanf("%d",&n);
pair<pair<int,int>,int> arr[n];
for(int i=0;i<n;i++){
scanf("%d%d",&arr[i].first.first,&arr[i].first.second);
arr[i].second=i;
}
sort(arr,arr+n);
vector<int> adj[n];
for(int i=0;i<n;i++){
int j=i+1;
while(j<n&&arr[i].first.first==arr[j].first.first)j++;
for(;j<n;j++){
if(arr[i].first.second<arr[j].first.second){
adj[arr[i].second].push_back(arr[j].second);
adj[arr[j].second].push_back(arr[i].second);
}
}
}
queue<int> q;
int dist[n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)dist[j]=1000000010;
dist[i]=0;
q.push(i);
while(!q.empty()){
int cur=q.front();q.pop();
for(int j=0;j<(int)adj[cur].size();j++){
if(dist[adj[cur][j]]>dist[cur]+1){
dist[adj[cur][j]]=dist[cur]+1;
q.push(adj[cur][j]);
}
}
}
long long ans=0;
for(int j=0;j<n;j++){
ans+=dist[j];
}
printf("%lld\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... |