oj.uz

Submission #155428

# Submission time Handle Problem Language Result Execution time Memory
155428 2019-09-28T04:28:14 Z aer0park Ideal city (IOI12_city) C++14
0 / 100
 18 ms 3952 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해보자  
int sz[100005],num[100005],cnt;
ll anw,n;
map<pi,ll> mp;
vector<int> 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();
	cout<<anw;
}

Compilation message

city.cpp: In function 'll dfs(ll, ll)':
city.cpp:20: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:39:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<ar.size();i++)
              ~^~~~~~~~~~
city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:77:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 3320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 3952 KB Output isn't correct
2 Halted 0 ms 0 KB -