oj.uz

Submission #487703

# Submission time Handle Problem Language Result Execution time Memory
487703 2021-11-16T12:20:35 Z Koosha_mv Ideal city (IOI12_city) C++14
100 / 100
 279 ms 46196 KB 
#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;

int n,t,w[N];
pair<int,int> a[N];
vector<int> g[N];
map<pair<int,int>,int> edge,mark;
int 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]];
		}
	}
	Add(ans,1ll*w[x]*(n-w[x])%mod);
}
void solve(){
	f(i,0,N) g[i].clear();
	fill(w,w+N,0);
	mark.clear();
	edge.clear();
	sort(a,a+n);
	int 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);
}
int 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;
}

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<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()){
      |  ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 27704 KB Output is correct
2 Correct 16 ms 27596 KB Output is correct
3 Correct 18 ms 27596 KB Output is correct
4 Correct 16 ms 27596 KB Output is correct
5 Correct 18 ms 27596 KB Output is correct
6 Correct 16 ms 27724 KB Output is correct
7 Correct 23 ms 27708 KB Output is correct
8 Correct 19 ms 27724 KB Output is correct
9 Correct 22 ms 27584 KB Output is correct
10 Correct 22 ms 27724 KB Output is correct
11 Correct 25 ms 27724 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 27836 KB Output is correct
2 Correct 19 ms 27724 KB Output is correct
3 Correct 20 ms 27980 KB Output is correct
4 Correct 26 ms 27852 KB Output is correct
5 Correct 21 ms 28064 KB Output is correct
6 Correct 23 ms 27948 KB Output is correct
7 Correct 28 ms 28064 KB Output is correct
8 Correct 26 ms 27888 KB Output is correct
9 Correct 26 ms 27888 KB Output is correct
10 Correct 24 ms 27852 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 29360 KB Output is correct
2 Correct 46 ms 29472 KB Output is correct
3 Correct 97 ms 31784 KB Output is correct
4 Correct 124 ms 31972 KB Output is correct
5 Correct 178 ms 35752 KB Output is correct
6 Correct 193 ms 35932 KB Output is correct
7 Correct 172 ms 36180 KB Output is correct
8 Correct 220 ms 35684 KB Output is correct
9 Correct 235 ms 36432 KB Output is correct
10 Correct 259 ms 43956 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 31300 KB Output is correct
2 Correct 65 ms 30608 KB Output is correct
3 Correct 145 ms 36880 KB Output is correct
4 Correct 118 ms 34768 KB Output is correct
5 Correct 279 ms 45892 KB Output is correct
6 Correct 204 ms 39556 KB Output is correct
7 Correct 265 ms 46196 KB Output is correct
8 Correct 230 ms 39912 KB Output is correct
9 Correct 201 ms 38852 KB Output is correct
10 Correct 248 ms 38420 KB Output is correct