oj.uz

Submission #115092

# Submission time Handle Problem Language Result Execution time Memory
115092 2019-06-05T08:37:24 Z 윤교준(#2865) Iqea (innopolis2018_final_C) C++14
36 / 100
 2000 ms 198344 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 100055;
const int MAXQ = 100055;
const int MAXK = MAXN;

int getDist(pii, pii);
int getDist(pii, int);

struct DJF {
	DJF() { init(); }
	int ud[MAXN];

	void init() { iota(ud, ud+MAXN, 0); }
	int uf(int i) { return i == ud[i] ? i : (ud[i] = uf(ud[i])); }
	void uf(int a, int b) { ud[uf(b)] = uf(a); }
};

struct BIT {
	pii *d;
	int n;

	void init(int _n) {
		n = _n+5;
		d = new pii[n];
		fill(d, d+n, pii(INF, -1));
	}
	void upd(int x, pii r) {
		for(x += 2; x < n; x += rb(x))
			if(r < d[x]) d[x] = r;
	}
	pii get(int x) {
		pii r(INF, -1);
		for(x += 2; x; x -= rb(x))
			if(d[x] < r) r = d[x];
		return r;
	}
};

struct RMQ {
	pii d[18][MAXN*2];
	pii A[MAXN*2];
	int B[MAXN*2];
	int L;

	void cal() {
		for(int i = 0, s, e;; i++) {
			s = 1 << i; e = s << 1;
			if(L < s) break;
			for(int j = s; j < e; j++)
				B[j] = i;
		}

		for(int i = 1; i <= L; i++) d[0][i] = A[i];
		for(int j = 1; j < 18; j++) for(int i = 1, e; i <= L; i++) {
			e = i + (1 << (j-1));
			d[j][i] = e <= L ? min(d[j-1][i], d[j-1][e]) : d[j-1][i];
		}
	}

	pii get(int s, int e) {
		int k = B[e-s+1];
		return min(d[k][s], d[k][e-(1<<k)+1]);
	}
};

struct TRE {
	RMQ rmq;

	vector<int> G[MAXN];
	int dep[MAXN], AS[MAXN], AE[MAXN];
	int A[MAXN*2], An;

	void add(int a, int b) {
		G[a].eb(b);
		G[b].eb(a);
	}
	void dfs(int i) {
		A[++An] = i;
		AS[i] = An;
		for(int v : G[i]) if(!dep[v]) {
			dep[v] = dep[i] + 1;
			dfs(v);
			A[++An] = i;
		}
		AE[i] = An;
	}
	void cal() {
		for(int i = 1; i < MAXN; i++) if(!dep[i]) {
			dep[i] = 1;
			dfs(i);
		}

		rmq.L = An;
		for(int i = 1, j; i <= An; i++) {
			j = A[i];
			rmq.A[i] = pii(dep[j], j);
		}
		rmq.cal();
	}
	int lca(int a, int b) {
		pii r = rmq.get(min(AS[a], AS[b]), max(AE[a], AE[b]));
		return r.second;
	}
	int get(int a, int b) {
		return dep[a] + dep[b] - (dep[lca(a, b)] << 1);
	}
} treX, treY;

struct NOD {
	NOD() : sy(INF), ey(-INF) {}
	BIT bitu, bitd;
	int x, sy, ey;

	void init() {
		int l = ey-sy+1;
		bitu.init(l);
		bitd.init(l);
	}

	void addCell(pii p) {
		x = p.first;
		if(p.second < sy) sy = p.second;
		if(ey < p.second) ey = p.second;
	}

	int getY(pii p) {
		int s = sy, e = ey; for(int m, l, r; s < e;) {
			m = (s+e) >> 1;
			l = ::getDist(p, pii(x, m));
			r = ::getDist(p, pii(x, m+1));
			if(l < r) e = m;
			else s = m+1;
		}
		return s;
	}

	void addHubo(pii p, int idx) {
		int s = getY(p), d = ::getDist(p, pii(x, s));
		bitu.upd(s-sy, pii(d-s, idx));
		bitd.upd(ey-s, pii(d+s, idx));
	}
	int get(pii p) {
		int r = INF, y = getY(p);
		pii up = bitu.get(y-sy), dp = bitd.get(ey-y);
		if(0 < up.second) {
			int t = ::getDist(p, up.second);
			if(t < r) r = t;
		}
		if(0 < dp.second) {
			int t = ::getDist(p, dp.second);
			if(t < r) r = t;
		}
		return r;
	}
} nod[MAXK];
vector<int> G[MAXK];
int prt[MAXK], cnt[MAXK];

unordered_map<ll, int> MPX, MPY;
map<pii, int> MPK;
pii P[MAXN], QP[MAXQ];

int N, Q, K, Krt;

inline ll hsh(const pii &p) { return ll(p.first) << 30 | p.second; }
int getDist(pii a, pii b) {
	return treX.get(MPX[hsh(a)], MPX[hsh(b)]) + treY.get(MPY[hsh(a)], MPY[hsh(b)]);
}
int getDist(pii p, int idx) { return getDist(p, QP[idx]); }

void predfs(int i) {
	cnt[i] = 1;
	for(int v : G[i]) if(!cnt[v]) {
		predfs(v);
		cnt[i] += cnt[v];
	}
}
void cent(int &rt) {
	int N = cnt[rt];
	for(int hi, hc;;) {
		hi = hc = -1;
		for(int v : G[rt]) {
			if(N <= cnt[v] || cnt[v] <= hc) continue;
			hc = cnt[v];
			hi = v;
		}
		if(hc*2 <= N) break;
		cnt[rt] = N - hc;
		cnt[hi] = N;
		rt = hi;
	}
}
int centdfs(int i) {
	cent(i);
	for(int v : G[i]) if(cnt[v] < cnt[i]) {
		v = centdfs(v);
		prt[v] = i;
	}
	return i;
}

void initK() {
	{
		vector<int> V;
		for(auto &v : MPX) V.eb(v.second);
		sorv(V); univ(V);
		K = sz(V);
		for(int i = 1; i <= N; i++)
			MPK[P[i]] = int(lower_bound(allv(V), MPX[hsh(P[i])]) - V.begin()) + 1;
	}

	for(int i = 1, idx; i <= N; i++) {
		idx = MPK[P[i]];
		nod[idx].addCell(P[i]);

		pii p(P[i].first + 1, P[i].second);
		auto it = MPK.find(p);
		if(MPK.end() != it) {
			G[idx].eb(it->second);
			G[it->second].eb(idx);
		}
	}

	for(int i = 1; i <= K; i++) {
		sorv(G[i]);
		univ(G[i]);
		nod[i].init();
	}

	predfs(1);
	Krt = centdfs(1);
}

void initTree(unordered_map<ll, int> &MP, TRE &tree, int dx) {
	DJF djf;
	for(int i = 1; i <= N; i++) MP[hsh(P[i])] = i;
	for(int i = 1; i <= N; i++) {
		pii p(P[i].first + dx, P[i].second + !dx);
		auto it = MP.find(hsh(p));
		if(MP.end() != it) djf.uf(i, it->second);
	}
	for(int i = 1; i <= N; i++) MP[hsh(P[i])] = djf.uf(i);
	for(int i = 1; i <= N; i++) {
		pii p(P[i].first + !dx, P[i].second + dx);
		auto it = MP.find(hsh(p));
		if(MP.end() != it) tree.add(djf.uf(i), it->second);
	}
	tree.cal();
}

void upd(pii p, int idx) {
	for(int i = MPK[p]; i;) {
		nod[i].addHubo(p, idx);
		i = prt[i];
	}
}
int get(pii p) {
	int r = INF;
	for(int i = MPK[p], t; i;) {
		t = nod[i].get(p);
		if(t < r) r = t;
		i = prt[i];
	}
	return r;
}

int main() {
	ios::sync_with_stdio(false);

	cin >> N;
	for(int i = 1; i <= N; i++)
		cin >> P[i].first >> P[i].second;

	initTree(MPX, treX, 0);
	initTree(MPY, treY, 1);
	initK();

	cin >> Q;
	for(int qi = 1, t, x, y; qi <= Q; qi++) {
		cin >> t >> x >> y;
		if(1 == t) {
			QP[qi] = pii(x, y);
			upd(pii(x, y), qi);
		} else {
			t = get(pii(x, y));
			printf("%d\n", INF <= t ? -1 : t);
		}
	}
	return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 76152 KB Output is correct
2 Correct 66 ms 76152 KB Output is correct
3 Correct 67 ms 76252 KB Output is correct
4 Correct 117 ms 77176 KB Output is correct
5 Correct 117 ms 77304 KB Output is correct
6 Correct 122 ms 77304 KB Output is correct
7 Correct 105 ms 77688 KB Output is correct
8 Correct 107 ms 77736 KB Output is correct
9 Correct 107 ms 77688 KB Output is correct
10 Correct 116 ms 77432 KB Output is correct
11 Correct 113 ms 77432 KB Output is correct
12 Correct 109 ms 77660 KB Output is correct
13 Correct 105 ms 77660 KB Output is correct
14 Correct 113 ms 77660 KB Output is correct
15 Correct 112 ms 77688 KB Output is correct
16 Correct 127 ms 77688 KB Output is correct
17 Correct 114 ms 77724 KB Output is correct
18 Correct 111 ms 77464 KB Output is correct
19 Correct 120 ms 77448 KB Output is correct
20 Correct 112 ms 77688 KB Output is correct
21 Correct 117 ms 77688 KB Output is correct
22 Correct 101 ms 77816 KB Output is correct
23 Correct 108 ms 77816 KB Output is correct
24 Correct 97 ms 77816 KB Output is correct
25 Correct 95 ms 78068 KB Output is correct
26 Correct 125 ms 77712 KB Output is correct
27 Correct 87 ms 77432 KB Output is correct
28 Correct 93 ms 77896 KB Output is correct
29 Correct 95 ms 77944 KB Output is correct
30 Correct 94 ms 77820 KB Output is correct
31 Correct 96 ms 77816 KB Output is correct
32 Correct 104 ms 77560 KB Output is correct
33 Correct 107 ms 77536 KB Output is correct
34 Correct 98 ms 77804 KB Output is correct
35 Correct 105 ms 77700 KB Output is correct
36 Correct 89 ms 78200 KB Output is correct
37 Correct 108 ms 77560 KB Output is correct
38 Correct 99 ms 77560 KB Output is correct
39 Correct 99 ms 77592 KB Output is correct
40 Correct 103 ms 77784 KB Output is correct
41 Correct 98 ms 77728 KB Output is correct
42 Correct 97 ms 77688 KB Output is correct
43 Correct 91 ms 77944 KB Output is correct
44 Correct 105 ms 77528 KB Output is correct
45 Correct 104 ms 77512 KB Output is correct
46 Correct 90 ms 77484 KB Output is correct
47 Correct 114 ms 77560 KB Output is correct
48 Correct 109 ms 77560 KB Output is correct
49 Correct 112 ms 77304 KB Output is correct
50 Correct 116 ms 77328 KB Output is correct
51 Correct 119 ms 77244 KB Output is correct
52 Correct 125 ms 77380 KB Output is correct
53 Correct 104 ms 77568 KB Output is correct
54 Correct 128 ms 77432 KB Output is correct
55 Correct 111 ms 77432 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 76152 KB Output is correct
2 Correct 66 ms 76152 KB Output is correct
3 Correct 67 ms 76252 KB Output is correct
4 Correct 117 ms 77176 KB Output is correct
5 Correct 117 ms 77304 KB Output is correct
6 Correct 122 ms 77304 KB Output is correct
7 Correct 105 ms 77688 KB Output is correct
8 Correct 107 ms 77736 KB Output is correct
9 Correct 107 ms 77688 KB Output is correct
10 Correct 116 ms 77432 KB Output is correct
11 Correct 113 ms 77432 KB Output is correct
12 Correct 109 ms 77660 KB Output is correct
13 Correct 105 ms 77660 KB Output is correct
14 Correct 113 ms 77660 KB Output is correct
15 Correct 112 ms 77688 KB Output is correct
16 Correct 127 ms 77688 KB Output is correct
17 Correct 114 ms 77724 KB Output is correct
18 Correct 111 ms 77464 KB Output is correct
19 Correct 120 ms 77448 KB Output is correct
20 Correct 112 ms 77688 KB Output is correct
21 Correct 117 ms 77688 KB Output is correct
22 Correct 101 ms 77816 KB Output is correct
23 Correct 108 ms 77816 KB Output is correct
24 Correct 97 ms 77816 KB Output is correct
25 Correct 95 ms 78068 KB Output is correct
26 Correct 125 ms 77712 KB Output is correct
27 Correct 87 ms 77432 KB Output is correct
28 Correct 93 ms 77896 KB Output is correct
29 Correct 95 ms 77944 KB Output is correct
30 Correct 94 ms 77820 KB Output is correct
31 Correct 96 ms 77816 KB Output is correct
32 Correct 104 ms 77560 KB Output is correct
33 Correct 107 ms 77536 KB Output is correct
34 Correct 98 ms 77804 KB Output is correct
35 Correct 105 ms 77700 KB Output is correct
36 Correct 89 ms 78200 KB Output is correct
37 Correct 108 ms 77560 KB Output is correct
38 Correct 99 ms 77560 KB Output is correct
39 Correct 99 ms 77592 KB Output is correct
40 Correct 103 ms 77784 KB Output is correct
41 Correct 98 ms 77728 KB Output is correct
42 Correct 97 ms 77688 KB Output is correct
43 Correct 91 ms 77944 KB Output is correct
44 Correct 105 ms 77528 KB Output is correct
45 Correct 104 ms 77512 KB Output is correct
46 Correct 90 ms 77484 KB Output is correct
47 Correct 114 ms 77560 KB Output is correct
48 Correct 109 ms 77560 KB Output is correct
49 Correct 112 ms 77304 KB Output is correct
50 Correct 116 ms 77328 KB Output is correct
51 Correct 119 ms 77244 KB Output is correct
52 Correct 125 ms 77380 KB Output is correct
53 Correct 104 ms 77568 KB Output is correct
54 Correct 128 ms 77432 KB Output is correct
55 Correct 111 ms 77432 KB Output is correct
56 Correct 1183 ms 78344 KB Output is correct
57 Correct 1267 ms 78368 KB Output is correct
58 Correct 1018 ms 78328 KB Output is correct
59 Correct 735 ms 78940 KB Output is correct
60 Correct 734 ms 78768 KB Output is correct
61 Correct 723 ms 78736 KB Output is correct
62 Correct 809 ms 78684 KB Output is correct
63 Correct 845 ms 78584 KB Output is correct
64 Correct 796 ms 78696 KB Output is correct
65 Correct 769 ms 78840 KB Output is correct
66 Correct 677 ms 78844 KB Output is correct
67 Correct 741 ms 78840 KB Output is correct
68 Correct 691 ms 78712 KB Output is correct
69 Correct 736 ms 78712 KB Output is correct
70 Correct 870 ms 78584 KB Output is correct
71 Correct 929 ms 78356 KB Output is correct
72 Correct 829 ms 78712 KB Output is correct
73 Correct 845 ms 78860 KB Output is correct
74 Correct 345 ms 79228 KB Output is correct
75 Correct 470 ms 78712 KB Output is correct
76 Correct 430 ms 78584 KB Output is correct
77 Correct 493 ms 78968 KB Output is correct
78 Correct 446 ms 78984 KB Output is correct
79 Correct 280 ms 79352 KB Output is correct
80 Correct 661 ms 78712 KB Output is correct
81 Correct 709 ms 78908 KB Output is correct
82 Correct 534 ms 78992 KB Output is correct
83 Correct 540 ms 78968 KB Output is correct
84 Correct 331 ms 79064 KB Output is correct
85 Correct 690 ms 78712 KB Output is correct
86 Correct 720 ms 78736 KB Output is correct
87 Correct 436 ms 78456 KB Output is correct
88 Correct 771 ms 78712 KB Output is correct
89 Correct 825 ms 78712 KB Output is correct
90 Correct 920 ms 78484 KB Output is correct
91 Correct 886 ms 78496 KB Output is correct
92 Correct 983 ms 78516 KB Output is correct
93 Correct 937 ms 78588 KB Output is correct
94 Correct 737 ms 78736 KB Output is correct
95 Correct 849 ms 78536 KB Output is correct
96 Correct 907 ms 78640 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2060 ms 107560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 76152 KB Output is correct
2 Correct 66 ms 76152 KB Output is correct
3 Correct 67 ms 76252 KB Output is correct
4 Correct 117 ms 77176 KB Output is correct
5 Correct 117 ms 77304 KB Output is correct
6 Correct 122 ms 77304 KB Output is correct
7 Correct 105 ms 77688 KB Output is correct
8 Correct 107 ms 77736 KB Output is correct
9 Correct 107 ms 77688 KB Output is correct
10 Correct 116 ms 77432 KB Output is correct
11 Correct 113 ms 77432 KB Output is correct
12 Correct 109 ms 77660 KB Output is correct
13 Correct 105 ms 77660 KB Output is correct
14 Correct 113 ms 77660 KB Output is correct
15 Correct 112 ms 77688 KB Output is correct
16 Correct 127 ms 77688 KB Output is correct
17 Correct 114 ms 77724 KB Output is correct
18 Correct 111 ms 77464 KB Output is correct
19 Correct 120 ms 77448 KB Output is correct
20 Correct 112 ms 77688 KB Output is correct
21 Correct 117 ms 77688 KB Output is correct
22 Correct 101 ms 77816 KB Output is correct
23 Correct 108 ms 77816 KB Output is correct
24 Correct 97 ms 77816 KB Output is correct
25 Correct 95 ms 78068 KB Output is correct
26 Correct 125 ms 77712 KB Output is correct
27 Correct 87 ms 77432 KB Output is correct
28 Correct 93 ms 77896 KB Output is correct
29 Correct 95 ms 77944 KB Output is correct
30 Correct 94 ms 77820 KB Output is correct
31 Correct 96 ms 77816 KB Output is correct
32 Correct 104 ms 77560 KB Output is correct
33 Correct 107 ms 77536 KB Output is correct
34 Correct 98 ms 77804 KB Output is correct
35 Correct 105 ms 77700 KB Output is correct
36 Correct 89 ms 78200 KB Output is correct
37 Correct 108 ms 77560 KB Output is correct
38 Correct 99 ms 77560 KB Output is correct
39 Correct 99 ms 77592 KB Output is correct
40 Correct 103 ms 77784 KB Output is correct
41 Correct 98 ms 77728 KB Output is correct
42 Correct 97 ms 77688 KB Output is correct
43 Correct 91 ms 77944 KB Output is correct
44 Correct 105 ms 77528 KB Output is correct
45 Correct 104 ms 77512 KB Output is correct
46 Correct 90 ms 77484 KB Output is correct
47 Correct 114 ms 77560 KB Output is correct
48 Correct 109 ms 77560 KB Output is correct
49 Correct 112 ms 77304 KB Output is correct
50 Correct 116 ms 77328 KB Output is correct
51 Correct 119 ms 77244 KB Output is correct
52 Correct 125 ms 77380 KB Output is correct
53 Correct 104 ms 77568 KB Output is correct
54 Correct 128 ms 77432 KB Output is correct
55 Correct 111 ms 77432 KB Output is correct
56 Correct 1183 ms 78344 KB Output is correct
57 Correct 1267 ms 78368 KB Output is correct
58 Correct 1018 ms 78328 KB Output is correct
59 Correct 735 ms 78940 KB Output is correct
60 Correct 734 ms 78768 KB Output is correct
61 Correct 723 ms 78736 KB Output is correct
62 Correct 809 ms 78684 KB Output is correct
63 Correct 845 ms 78584 KB Output is correct
64 Correct 796 ms 78696 KB Output is correct
65 Correct 769 ms 78840 KB Output is correct
66 Correct 677 ms 78844 KB Output is correct
67 Correct 741 ms 78840 KB Output is correct
68 Correct 691 ms 78712 KB Output is correct
69 Correct 736 ms 78712 KB Output is correct
70 Correct 870 ms 78584 KB Output is correct
71 Correct 929 ms 78356 KB Output is correct
72 Correct 829 ms 78712 KB Output is correct
73 Correct 845 ms 78860 KB Output is correct
74 Correct 345 ms 79228 KB Output is correct
75 Correct 470 ms 78712 KB Output is correct
76 Correct 430 ms 78584 KB Output is correct
77 Correct 493 ms 78968 KB Output is correct
78 Correct 446 ms 78984 KB Output is correct
79 Correct 280 ms 79352 KB Output is correct
80 Correct 661 ms 78712 KB Output is correct
81 Correct 709 ms 78908 KB Output is correct
82 Correct 534 ms 78992 KB Output is correct
83 Correct 540 ms 78968 KB Output is correct
84 Correct 331 ms 79064 KB Output is correct
85 Correct 690 ms 78712 KB Output is correct
86 Correct 720 ms 78736 KB Output is correct
87 Correct 436 ms 78456 KB Output is correct
88 Correct 771 ms 78712 KB Output is correct
89 Correct 825 ms 78712 KB Output is correct
90 Correct 920 ms 78484 KB Output is correct
91 Correct 886 ms 78496 KB Output is correct
92 Correct 983 ms 78516 KB Output is correct
93 Correct 937 ms 78588 KB Output is correct
94 Correct 737 ms 78736 KB Output is correct
95 Correct 849 ms 78536 KB Output is correct
96 Correct 907 ms 78640 KB Output is correct
97 Runtime error 1469 ms 198344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
98 Halted 0 ms 0 KB -