| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 155398 | aer0park | Ideal city (IOI12_city) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
//간선 연결후 tree dp해보자
ll n,x[100005],y[100005],sz[100005],num[100005],cnt,anw;
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].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 main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i];
for(int i=1;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;
return 0;
}