#include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define Add(x,y) x=(x+y)%mod
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=1e6+99,mod=1e9;
ll n,t,w[N];
pair<ll,ll> a[N];
vector<ll> g[N];
map<pair<ll,ll>,ll> edge,mark;
ll ans;
void Add_edge(ll u,ll v){
if(edge[mp(u,v)]) return ;
g[u].pb(v);
g[v].pb(u);
edge[mp(u,v)]=1;
edge[mp(v,u)]=1;
}
void dfs(ll x,ll par){
f(i,0,g[x].size()){
if(g[x][i]!=par){
dfs(g[x][i],x);
w[x]+=w[g[x][i]];
}
}
ans+=1ll*w[x]*(n-w[x]);
}
void solve(){
f(i,0,N) g[i].clear();
fill(w,w+N,0);
mark.clear();
edge.clear();
sort(a,a+n);
ll cnt=1;
f(i,0,n){
mark[mp(a[i].F,a[i].S)]=mark[mp(a[i].F-1,a[i].S)];
if(!mark[mp(a[i].F,a[i].S)]){
mark[mp(a[i].F,a[i].S)]=cnt++;
}
w[mark[mp(a[i].F,a[i].S)]]++;
}
f(i,0,n){
if(mark[mp(a[i].F,a[i].S+1)]){
Add_edge(mark[mp(a[i].F,a[i].S)],mark[mp(a[i].F,a[i].S+1)]);
}
}
dfs(1,0);
}
ll DistanceSum(int N,int *X,int *Y){
n=N;
f(i,0,n) a[i].F=X[i],a[i].S=Y[i];
solve();
f(i,0,n) a[i].F=Y[i],a[i].S=X[i];
solve();
return ans%mod;
}
/*
2,5
v = (2, 6), v = (3, 3), v = (3, 6), v = (4, 3), v = (4, 4), v = (4, 5), v = (4, 6), v = (5, 3), v = (5,
4), and v = (5, 6)
11
2 5
2 6
3 3
3 6
4 3
4 4
4 5
4 6
5 3
5 4
5 6
*/
Compilation message
city.cpp: In function 'void dfs(long long int, long long int)':
city.cpp:7:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
7 | #define f(i,a,b) for(int i=a;i<b;i++)
......
36 | f(i,0,g[x].size()){
| ~~~~~~~~~~~~~~~
city.cpp:36:2: note: in expansion of macro 'f'
36 | f(i,0,g[x].size()){
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
31564 KB |
Output is correct |
2 |
Correct |
19 ms |
31564 KB |
Output is correct |
3 |
Correct |
19 ms |
31592 KB |
Output is correct |
4 |
Correct |
20 ms |
31600 KB |
Output is correct |
5 |
Correct |
22 ms |
31508 KB |
Output is correct |
6 |
Correct |
20 ms |
31652 KB |
Output is correct |
7 |
Correct |
21 ms |
31612 KB |
Output is correct |
8 |
Correct |
23 ms |
31596 KB |
Output is correct |
9 |
Correct |
20 ms |
31564 KB |
Output is correct |
10 |
Correct |
20 ms |
31532 KB |
Output is correct |
11 |
Correct |
20 ms |
31580 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
31816 KB |
Output is correct |
2 |
Correct |
21 ms |
31824 KB |
Output is correct |
3 |
Correct |
23 ms |
31856 KB |
Output is correct |
4 |
Correct |
22 ms |
31856 KB |
Output is correct |
5 |
Correct |
25 ms |
32004 KB |
Output is correct |
6 |
Correct |
23 ms |
31876 KB |
Output is correct |
7 |
Correct |
23 ms |
31912 KB |
Output is correct |
8 |
Correct |
22 ms |
31820 KB |
Output is correct |
9 |
Correct |
22 ms |
31864 KB |
Output is correct |
10 |
Correct |
23 ms |
31792 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
33336 KB |
Output is correct |
2 |
Correct |
49 ms |
33640 KB |
Output is correct |
3 |
Correct |
89 ms |
36440 KB |
Output is correct |
4 |
Correct |
102 ms |
36552 KB |
Output is correct |
5 |
Correct |
168 ms |
41168 KB |
Output is correct |
6 |
Correct |
187 ms |
41316 KB |
Output is correct |
7 |
Correct |
161 ms |
41764 KB |
Output is correct |
8 |
Correct |
194 ms |
40996 KB |
Output is correct |
9 |
Correct |
219 ms |
41860 KB |
Output is correct |
10 |
Correct |
211 ms |
49424 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
58 ms |
35524 KB |
Output is correct |
2 |
Correct |
52 ms |
34852 KB |
Output is correct |
3 |
Correct |
118 ms |
41704 KB |
Output is correct |
4 |
Correct |
107 ms |
39708 KB |
Output is correct |
5 |
Correct |
228 ms |
51684 KB |
Output is correct |
6 |
Correct |
187 ms |
45128 KB |
Output is correct |
7 |
Correct |
220 ms |
51956 KB |
Output is correct |
8 |
Correct |
189 ms |
45432 KB |
Output is correct |
9 |
Correct |
185 ms |
44596 KB |
Output is correct |
10 |
Correct |
186 ms |
44004 KB |
Output is correct |