oj.uz

Submission #155421

# Submission time Handle Problem Language Result Execution time Memory
155421 2019-09-28T02:55:22 Z aer0park Ideal city (IOI12_city) C++14
23 / 100
 324 ms 262148 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)
{
	assert(a!=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].s+1==ar[i].s) num[i]=cnt;
		else num[i]=++cnt;
		sz[cnt]++;
	}
	ll j=0,i=0;
	while(ar[j].f!=ar[0].f) j++;
	for(int j=0;j<n;j++)
	{
		while(j<n&&ar[i].f+1!=ar[j].f)
		{
			if(ar[i].f>=ar[j].f) j++;
			else i++;
		}
		while(j<n&&ar[i].f+1==ar[j].f&&ar[i].s!=ar[j].s)
		{
			if(ar[i].s>ar[j].s) j++;
			else i++;
		}
		if(num[i]!=num[j]&&!mp[{num[i],num[j]}])
			add(num[i],num[j]),mp[{num[i],num[j]}]++;
	}
	dfs(1,-1);
}
 
int DistanceSum (int N, int *x, int *y)
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	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: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:40:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<ar.size();i++)
              ~^~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2732 KB Output is correct
2 Correct 4 ms 2684 KB Output is correct
3 Runtime error 279 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 253 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3448 KB Output is correct
2 Correct 14 ms 3448 KB Output is correct
3 Correct 28 ms 4084 KB Output is correct
4 Correct 28 ms 4084 KB Output is correct
5 Correct 53 ms 5228 KB Output is correct
6 Correct 54 ms 5360 KB Output is correct
7 Correct 56 ms 5400 KB Output is correct
8 Correct 52 ms 5232 KB Output is correct
9 Correct 55 ms 5488 KB Output is correct
10 Correct 76 ms 9584 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -