# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25630 | Extazy | Adriatic (CEOI13_adriatic) | C++14 | 2000 ms | 97776 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;
const int N = 7000;
const int INF = (1e4) + 7;
int n;
short d[N][N];
pair < int, int > a[N];
int main() {
int i,j,z;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d %d", &a[i].first, &a[i].second);
}
for(i=1;i<=n;i++) {
for(j=i+1;j<=n;j++) {
if((a[i].first>a[j].first && a[i].second>a[j].second) || (a[i].first<a[j].first && a[i].second<a[j].second)) {
d[i][j]=d[j][i]=1;
}
}
}
for(i=1;i<=n;i++) for(j=1;j<=n;j++) if(i!=j && d[i][j]==0) d[i][j]=INF;
for(z=1;z<=n;z++) {
for(i=1;i<=n;i++) {
for(j=i+1;j<=n;j++) {
d[i][j]=min(d[i][j],(short)(d[i][z]+d[z][j]));
d[j][i]=min(d[j][i],(short)(d[j][z]+d[z][i]));
}
}
}
for(i=1;i<=n;i++) {
long long sum=0;
for(j=1;j<=n;j++) if(i!=j) sum+=d[i][j];
printf("%lld\n", sum);
}
return 0;
}
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... |