# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131922 | 2019-07-18T04:19:47 Z | faustaadp | Towns (IOI15_towns) | C++17 | 62 ms | 3320 KB |
#include "towns.h" #include<bits/stdc++.h> typedef long long ll; #define pb push_back #define mp make_pair #define fi first #define se second using namespace std; ll i,j,d[1010][1010],jum[1010],p[1010],has; vector<ll> isi[1010]; int hubDistance(int N, int sub) { for(i=0;i<N;i++) for(j=i+1;j<N;j++) { d[i][j]=getDistance(i,j); d[j][i]=d[i][j]; } memset(p,-1,sizeof(p)); for(i=0;i<N;i++) for(j=0;j<N;j++) jum[i]+=d[i][j]; for(i=0;i<N;i++) for(j=i+1;j<N;j++) { ll tem=abs(jum[j]-jum[i]),X,Y; tem/=(N-2); X=(d[i][j]-tem)/2; Y=d[i][j]-X; if(jum[i]>jum[j]) swap(X,Y); //cout<<i<<" "<<j<<" "<<d[i][j]<<" "<<tem<<" "<<X<<" "<<Y<<"\n"; isi[i].pb(X); isi[j].pb(Y); } for(i=0;i<N;i++) { sort(isi[i].begin(),isi[i].end()); has=max(has,isi[i][N-2]); //for(j=0;j<isi[i].size();j++) // cout<<i<<" "<<j<<" "<<isi[i][j]<<"\n"; } return has; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 62 ms | 3320 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 50 ms | 2984 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 632 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |