제출 #122265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122265		TuGSGeReL	이상적인 도시 (IOI12_city)	C++14	100 / 100	307 ms	36436 KiB

city

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key
#define lb lower_bound
#define ub upper_bound
#define inbuf_len 1 << 16
#define outbuf_len 1 << 16

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

ll ans, mod = 1e9, sum, z, tr[100001], w[100001], h[4] = {0, 0, 1, -1}, v[4] = {1, -1, 0, 0}, sub[100001];
pii p[100001];
vector <int> edg[100001];
map<int, int> m[100001], hs[100001], idx[100001];

void dfs(int u, int par)
{
	sub[u] = w[u];
	
	for (auto x : edg[u])
		if ( x != par )
			dfs(x, u);
			
	sub[par] += sub[u];
}

void dfs1(int u, int par)
{
	ans = (ans + ((sum - sub[u]) * sub[u]) % mod) % mod;
	
	for (auto x : edg[u])
		if ( x != par )
			dfs1(x, u);
}

void solve(int n, int *x, int *y) {
	sum = n;
	z = 0;
	memset(w, 0, sizeof w);
	for (int i = 0; i < n; i++)
	{
		p[i].ff = x[i];
		p[i].ss = y[i];
		edg[i].clear();
		m[i].clear();
		hs[i].clear();
		idx[i].clear();
	}

	sort(p, p + n);
	
	for (int i = 0; i < n; i++)
	{
		if ( !i || p[i].ff != p[i - 1].ff || p[i].ss > p[i - 1].ss + 1 )
		{
			tr[i] = ++z;
			m[p[i].ff][p[i].ss] = z;
			w[z]++;
		} else {
			tr[i] = tr[i - 1];
			m[p[i].ff][p[i].ss] = tr[i - 1];
			w[tr[i - 1]]++;
		}
	}
	
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < 4; j++)
		{
			if ( p[i].ff + h[j] >= 0 && p[i].ff + h[j] <= n && p[i].ss + v[j] >= 0 && p[i].ss + v[j] <= n && m[p[i].ff + h[j]][p[i].ss + v[j]] && !hs[tr[i]][m[p[i].ff + h[j]][p[i].ss + v[j]]] && tr[i] != m[p[i].ff + h[j]][p[i].ss + v[j]] )
			{
				hs[tr[i]][m[p[i].ff + h[j]][p[i].ss + v[j]]] = hs[m[p[i].ff + h[j]][p[i].ss + v[j]]][tr[i]] = 1;
				edg[tr[i]].pub(m[p[i].ff + h[j]][p[i].ss + v[j]]);
				edg[m[p[i].ff + h[j]][p[i].ss + v[j]]].pub(tr[i]);
			}
		}
	}
		
	dfs(1, 0);
	dfs1(1, 0);
}

int DistanceSum(int n, int *x, int *y) {
	int mnx = INT_MAX, mny = INT_MAX;
	
	for (int i = 0; i < n; i++)
	{
		mnx = min(mnx, x[i]);
		mny = min(mny, y[i]);
	}
	
	for (int i = 0; i < n; i++)
	{
		x[i] -= mnx;
		y[i] -= mny;
	}
	
	solve(n, x, y);
	solve(n, y, x);
	return ans;
}

//int main() {
//  int tmp;
//
//  int N, i;
//  scanf("%d", &N);
//
//  int sq_x[100001], sq_y[100001];
//  for (i = 0; i < N; i++) {
//    tmp = scanf("%d %d", &sq_x[i], &sq_y[i]);
//  }
//
//  int ds = DistanceSum(N, sq_x, sq_y);
//  printf("%d\n", ds);
//
//  return 0;
//
//}

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 23 / 23
• Subtask 4: 45 / 45