oj.uz

Submission #62683

# Submission time Handle Problem Language Result Execution time Memory
62683 2018-07-29T18:37:15 Z zadrga Ideal city (IOI12_city) C++14
100 / 100
 121 ms 17548 KB 
// 19.28

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF ((int) 1e9)
#define MOD (1000 * 1000 * 1000)
#define maxn 100111

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

struct node{
	int ind, l, d, num;
	vector<int> adj;

	node(){
		ind = l = d = -1;
	}
} nodes[maxn + 2];

int n;
ll ans;

int sz[maxn];
vector<int> here[maxn + 2], cur[maxn + 2];

void DFS(int x, int p){
	sz[x] = nodes[x].num;
	for(int v : nodes[x].adj){
		if(v == p)
			continue;

		DFS(v, x);
		sz[x] += sz[v]; 
	}

	for(int v : nodes[x].adj){
		if(v == p)
			continue;

		ans = (ans + 1LL * sz[v] * (n - sz[v])) % MOD; 
	}
}

bool intersect(int x, int y){
	int zac = max(nodes[x].l, nodes[y].l);
	int kon = min(nodes[x].d, nodes[y].d);
	return (zac <= kon);
}

void solve(vector<pii> &v){
	for(int i = 0; i < maxn; i++){
		nodes[i] = node();
		here[i].clear();
		cur[i].clear();
		sz[i] = 0;
	}

	int cnt = 0;
	sort(v.begin(), v.end());
	for(int i = 0; i < v.size(); i++)
		here[v[i].fi].pb(v[i].se);

	for(int i = 0; i < maxn; i++){
		for(int j = 0; j < here[i].size(); j++){
			int k = j;
			while(k < here[i].size() && (here[i][k] - here[i][j] == k - j))
				k++;

			k--;
			nodes[++cnt].l = here[i][j];
			nodes[cnt].d = here[i][k];
			nodes[cnt].num = k - j + 1;
			cur[i].pb(cnt);

			j = k;
		}
	}

	for(int i = 0; i < maxn; i++){
		int ind = 0;
		for(int j = 0; j < cur[i].size(); j++){
			ind = max(ind, 0);
			while(ind < cur[i + 1].size() && nodes[cur[i + 1][ind]].d < nodes[cur[i][j]].l)
				ind++;

			while(ind < cur[i + 1].size() && intersect(cur[i][j], cur[i + 1][ind])){
				int x = cur[i][j];
				int y = cur[i + 1][ind];
				nodes[x].adj.pb(y);
				nodes[y].adj.pb(x);
				ind++;
			}
			ind -= 2;
		}
//		cout << endl;
	}

	DFS(1, -1);
}

vector<int> mx, my;
vector<pii> v;

int DistanceSum(int N, int *X, int *Y) {
	n = N;
	for(int i = 0; i < n; i++){
		mx.pb(X[i]);
		my.pb(Y[i]);
	}

	sort(mx.begin(), mx.end());
	mx.resize(distance(mx.begin(), unique(mx.begin(), mx.end())));
	sort(my.begin(), my.end());
	my.resize(distance(my.begin(), unique(my.begin(), my.end())));

	for(int i = 0; i < n; i++){
		int x = lower_bound(mx.begin(), mx.end(), X[i]) - mx.begin();
		int y = lower_bound(my.begin(), my.end(), Y[i]) - my.begin();	
		v.pb(mp(x, y));
	}

	ans = 0;
	solve(v);

	for(int i = 0; i < n; i++)
		swap(v[i].fi, v[i].se);

	solve(v);

	return (int) ans;
}

Compilation message

city.cpp: In function 'void solve(std::vector<std::pair<int, int> >&)':
city.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); i++)
                 ~~^~~~~~~~~~
city.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < here[i].size(); j++){
                  ~~^~~~~~~~~~~~~~~~
city.cpp:74:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(k < here[i].size() && (here[i][k] - here[i][j] == k - j))
          ~~^~~~~~~~~~~~~~~~
city.cpp:89:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < cur[i].size(); j++){
                  ~~^~~~~~~~~~~~~~~
city.cpp:91:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(ind < cur[i + 1].size() && nodes[cur[i + 1][ind]].d < nodes[cur[i][j]].l)
          ~~~~^~~~~~~~~~~~~~~~~~~
city.cpp:94:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(ind < cur[i + 1].size() && intersect(cur[i][j], cur[i + 1][ind])){
          ~~~~^~~~~~~~~~~~~~~~~~~
city.cpp:19:8: warning: '<anonymous>.node::num' is used uninitialized in this function [-Wuninitialized]
 struct node{
        ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 9336 KB Output is correct
2 Correct 14 ms 9420 KB Output is correct
3 Correct 13 ms 9420 KB Output is correct
4 Correct 12 ms 9424 KB Output is correct
5 Correct 16 ms 9428 KB Output is correct
6 Correct 19 ms 9428 KB Output is correct
7 Correct 18 ms 9452 KB Output is correct
8 Correct 25 ms 9504 KB Output is correct
9 Correct 16 ms 9504 KB Output is correct
10 Correct 15 ms 9504 KB Output is correct
11 Correct 16 ms 9504 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 9632 KB Output is correct
2 Correct 17 ms 9632 KB Output is correct
3 Correct 13 ms 9660 KB Output is correct
4 Correct 19 ms 9660 KB Output is correct
5 Correct 19 ms 9660 KB Output is correct
6 Correct 20 ms 9660 KB Output is correct
7 Correct 19 ms 9664 KB Output is correct
8 Correct 20 ms 9708 KB Output is correct
9 Correct 22 ms 9708 KB Output is correct
10 Correct 18 ms 9708 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 10412 KB Output is correct
2 Correct 32 ms 10416 KB Output is correct
3 Correct 68 ms 11104 KB Output is correct
4 Correct 57 ms 11492 KB Output is correct
5 Correct 85 ms 12764 KB Output is correct
6 Correct 95 ms 13504 KB Output is correct
7 Correct 97 ms 13504 KB Output is correct
8 Correct 100 ms 13504 KB Output is correct
9 Correct 94 ms 13504 KB Output is correct
10 Correct 116 ms 17548 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 17548 KB Output is correct
2 Correct 32 ms 17548 KB Output is correct
3 Correct 61 ms 17548 KB Output is correct
4 Correct 57 ms 17548 KB Output is correct
5 Correct 116 ms 17548 KB Output is correct
6 Correct 104 ms 17548 KB Output is correct
7 Correct 116 ms 17548 KB Output is correct
8 Correct 121 ms 17548 KB Output is correct
9 Correct 101 ms 17548 KB Output is correct
10 Correct 103 ms 17548 KB Output is correct