oj.uz

Submission #155430

# Submission time Handle Problem Language Result Execution time Memory
155430 2019-09-28T04:28:57 Z aer0park Ideal city (IOI12_city) C++14
100 / 100
 90 ms 10288 KB 
#include <bits/stdc++.h>
#define f first
#define s second
 
using namespace std;
 
typedef long long ll;
typedef pair<int,int> pi;
//간선 연결후 tree dp해보자  
ll sz[100005],num[100005],cnt,anw,n;
map<pi,ll> mp;
vector<ll> g[100005];
vector<pi> ar;
const ll mod=1e9;
 
ll dfs(ll a,ll p)
{
	ll ret=sz[a];
	for(int i=0;i<g[a].size();i++)
		if(g[a][i]!=p)
			ret+=dfs(g[a][i],a);	
	anw=(anw+ret*(n-ret))%mod;
	return ret;
}
 
void add(ll a,ll b)
{
	g[a].push_back(b),g[b].push_back(a);
}
 
void calc()
{
	sort(ar.begin(),ar.end());  //점 0부터. 
	for(int i=0;i<=n;i++)
		g[i].clear(),sz[i]=0;
	cnt=0,mp.clear();
	num[0]=++cnt,sz[cnt]=1;
	for(int i=1;i<ar.size();i++)
	{
		if(ar[i-1].f==ar[i].f&&ar[i-1].s+1==ar[i].s) num[i]=cnt;
		else num[i]=++cnt;
		sz[cnt]++;
	}
	for(ll j=0,i=0;j<n;)
	{
		while(i<n&&j<n&&ar[i].f+1!=ar[j].f)
		{
			if(ar[i].f+1>ar[j].f) j++;
			else i++;
		}
		while(i<n&&j<n&&ar[i].f+1==ar[j].f)
		{
			if(ar[i].s==ar[j].s)
			{
				if(!mp[{num[i],num[j]}])
					add(num[i],num[j]),mp[{num[i],num[j]}]++;
				i++,j++;
			}
			else if(ar[i].s>ar[j].s) j++;
			else i++;
		}
	}
	dfs(1,-1);
}
 
int DistanceSum (int N, int *x, int *y)
{
	n=N;
	for(int i=0;i<n;i++)
		ar.push_back({x[i],y[i]});
	calc();
	for(int i=0;i<n;i++)
		swap(ar[i].f,ar[i].s);
	calc();
	return anw;
}

Compilation message

city.cpp: In function 'll dfs(ll, ll)':
city.cpp:19:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[a].size();i++)
              ~^~~~~~~~~~~~
city.cpp: In function 'void calc()':
city.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<ar.size();i++)
              ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2684 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 5 ms 2680 KB Output is correct
6 Correct 4 ms 2684 KB Output is correct
7 Correct 5 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 5 ms 2680 KB Output is correct
10 Correct 5 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 4 ms 2808 KB Output is correct
3 Correct 5 ms 2808 KB Output is correct
4 Correct 5 ms 2828 KB Output is correct
5 Correct 5 ms 2812 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 5 ms 2808 KB Output is correct
9 Correct 5 ms 2808 KB Output is correct
10 Correct 5 ms 2808 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3444 KB Output is correct
2 Correct 14 ms 3576 KB Output is correct
3 Correct 28 ms 4468 KB Output is correct
4 Correct 28 ms 4472 KB Output is correct
5 Correct 53 ms 6128 KB Output is correct
6 Correct 51 ms 6128 KB Output is correct
7 Correct 55 ms 6256 KB Output is correct
8 Correct 52 ms 6000 KB Output is correct
9 Correct 54 ms 6256 KB Output is correct
10 Correct 76 ms 10288 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4212 KB Output is correct
2 Correct 17 ms 3956 KB Output is correct
3 Correct 43 ms 6388 KB Output is correct
4 Correct 37 ms 5624 KB Output is correct
5 Correct 90 ms 10068 KB Output is correct
6 Correct 66 ms 7532 KB Output is correct
7 Correct 86 ms 10224 KB Output is correct
8 Correct 67 ms 7664 KB Output is correct
9 Correct 63 ms 7152 KB Output is correct
10 Correct 62 ms 7028 KB Output is correct