#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> muchii[250005];
struct point
{
int x,y;
} v[250005];
ll dist[250005];
void bfs(int start)
{
for(int i=1;i<=n;i++)
dist[i]=1e9;
dist[start]=0;
queue<int> coada;
coada.push(start);
while(!coada.empty())
{
int nod=coada.front();
coada.pop();
for(int i:muchii[nod])
if(dist[i]>dist[nod]+1)
{
dist[i]=dist[nod]+1;
coada.push(i);
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i].x>>v[i].y;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
{
if(v[i].x<v[j].x&&v[i].y<v[j].y)
{
muchii[i].push_back(j);
muchii[j].push_back(i);
}
else if(v[i].x>v[j].x&&v[i].y>v[j].y)
{
muchii[i].push_back(j);
muchii[j].push_back(i);
}
}
for(int i=1;i<=n;i++)
{
bfs(i);
ll suma=0;
for(int j=1;j<=n;j++)
suma+=dist[j];
cout<<suma<<'\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
6100 KB |
Output is correct |
2 |
Correct |
5 ms |
6208 KB |
Output is correct |
3 |
Correct |
4 ms |
6212 KB |
Output is correct |
4 |
Correct |
4 ms |
6228 KB |
Output is correct |
5 |
Correct |
4 ms |
6100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
212 ms |
6948 KB |
Output is correct |
2 |
Correct |
1458 ms |
13328 KB |
Output is correct |
3 |
Correct |
98 ms |
6436 KB |
Output is correct |
4 |
Correct |
1482 ms |
13184 KB |
Output is correct |
5 |
Correct |
1222 ms |
12680 KB |
Output is correct |
6 |
Correct |
108 ms |
6528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2062 ms |
11300 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1980 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1160 ms |
262144 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |