# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101516 | dantoh000 | Adriatic (CEOI13_adriatic) | C++14 | 2053 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];
int x[n], y[n];
for (int i = 0; i < n; i++){
scanf("%d%d",&x[i],&y[i]);
for (int j = 0; j < i; j++){
if ((x[i]<x[j] &&y[i]<y[j]) ||
(x[i]>y[j] &&y[i]>y[j])){
adjlist[i].push_back(j);
adjlist[j].push_back(i);
}
}
}
int ans = 0;
int adjmat[n][n];
memset(adjmat,-1,sizeof(adjmat));
for (int i = 0; i < n; i++){
queue<int> q;
adjmat[i][i] = 0; q.push(i);
while (q.size()){
int u = q.front(); q.pop();
for (auto v : adjlist[u]){
if (adjmat[i][v] != -1) continue;
adjmat[i][v] = adjmat[i][u]+1;
q.push(v);
}
}
}
for (int i = 0; i < n; i++){
int sum = 0;
for (int j = 0; j < n; j++){
sum += adjmat[i][j];
//printf("%d ",adjmat[i][j]);
}
printf("%d\n",sum);
}
}
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... |