Submission #115093

# Submission time Handle Problem Language Result Execution time Memory
115093 2019-06-05T08:46:39 Z 윤교준(#2865) Iqea (innopolis2018_final_C) C++14
36 / 100
2000 ms 210980 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) {
		if(sy == ey) return sy;
		int dw = ::getDist(p, pii(x, sy));
		int up = ::getDist(p, pii(x, ey));
		int l = ey-sy;
		int t = (dw+up-l) >> 1;
		return sy + (dw-t);
	}

	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];

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

int N, Q, K, Krt;

int getDist(pii a, pii b) {
	return treX.get(MPX[a], MPX[b]) + treY.get(MPY[a], MPY[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[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(map<pii, int> &MP, TRE &tree, int dx) {
	DJF djf;
	for(int i = 1; i <= N; i++) MP[P[i]] = i;
	for(int i = 1; i <= N; i++) {
		pii p(P[i].first + dx, P[i].second + !dx);
		auto it = MP.find(p);
		if(MP.end() != it) djf.uf(i, it->second);
	}
	for(int i = 1; i <= N; i++) MP[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(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;
}
# Verdict Execution time Memory Grader output
1 Correct 68 ms 76280 KB Output is correct
2 Correct 69 ms 76152 KB Output is correct
3 Correct 69 ms 76284 KB Output is correct
4 Correct 113 ms 77432 KB Output is correct
5 Correct 120 ms 77440 KB Output is correct
6 Correct 114 ms 77560 KB Output is correct
7 Correct 123 ms 77944 KB Output is correct
8 Correct 117 ms 77916 KB Output is correct
9 Correct 125 ms 78044 KB Output is correct
10 Correct 119 ms 77680 KB Output is correct
11 Correct 119 ms 77660 KB Output is correct
12 Correct 119 ms 77860 KB Output is correct
13 Correct 116 ms 77820 KB Output is correct
14 Correct 119 ms 77816 KB Output is correct
15 Correct 124 ms 77916 KB Output is correct
16 Correct 129 ms 77944 KB Output is correct
17 Correct 123 ms 77944 KB Output is correct
18 Correct 119 ms 77816 KB Output is correct
19 Correct 116 ms 77532 KB Output is correct
20 Correct 118 ms 77884 KB Output is correct
21 Correct 119 ms 77800 KB Output is correct
22 Correct 120 ms 78072 KB Output is correct
23 Correct 115 ms 78120 KB Output is correct
24 Correct 110 ms 78072 KB Output is correct
25 Correct 107 ms 78200 KB Output is correct
26 Correct 91 ms 77944 KB Output is correct
27 Correct 86 ms 77688 KB Output is correct
28 Correct 113 ms 77944 KB Output is correct
29 Correct 109 ms 78044 KB Output is correct
30 Correct 107 ms 78108 KB Output is correct
31 Correct 106 ms 78072 KB Output is correct
32 Correct 116 ms 77816 KB Output is correct
33 Correct 116 ms 77816 KB Output is correct
34 Correct 105 ms 77944 KB Output is correct
35 Correct 114 ms 77816 KB Output is correct
36 Correct 99 ms 78444 KB Output is correct
37 Correct 117 ms 77828 KB Output is correct
38 Correct 111 ms 77808 KB Output is correct
39 Correct 113 ms 77844 KB Output is correct
40 Correct 115 ms 77852 KB Output is correct
41 Correct 115 ms 77980 KB Output is correct
42 Correct 111 ms 77944 KB Output is correct
43 Correct 102 ms 78112 KB Output is correct
44 Correct 118 ms 77872 KB Output is correct
45 Correct 118 ms 77816 KB Output is correct
46 Correct 91 ms 77684 KB Output is correct
47 Correct 128 ms 77712 KB Output is correct
48 Correct 116 ms 77648 KB Output is correct
49 Correct 119 ms 77532 KB Output is correct
50 Correct 127 ms 77536 KB Output is correct
51 Correct 122 ms 77432 KB Output is correct
52 Correct 120 ms 77688 KB Output is correct
53 Correct 120 ms 77688 KB Output is correct
54 Correct 123 ms 77636 KB Output is correct
55 Correct 121 ms 77816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 68 ms 76280 KB Output is correct
2 Correct 69 ms 76152 KB Output is correct
3 Correct 69 ms 76284 KB Output is correct
4 Correct 113 ms 77432 KB Output is correct
5 Correct 120 ms 77440 KB Output is correct
6 Correct 114 ms 77560 KB Output is correct
7 Correct 123 ms 77944 KB Output is correct
8 Correct 117 ms 77916 KB Output is correct
9 Correct 125 ms 78044 KB Output is correct
10 Correct 119 ms 77680 KB Output is correct
11 Correct 119 ms 77660 KB Output is correct
12 Correct 119 ms 77860 KB Output is correct
13 Correct 116 ms 77820 KB Output is correct
14 Correct 119 ms 77816 KB Output is correct
15 Correct 124 ms 77916 KB Output is correct
16 Correct 129 ms 77944 KB Output is correct
17 Correct 123 ms 77944 KB Output is correct
18 Correct 119 ms 77816 KB Output is correct
19 Correct 116 ms 77532 KB Output is correct
20 Correct 118 ms 77884 KB Output is correct
21 Correct 119 ms 77800 KB Output is correct
22 Correct 120 ms 78072 KB Output is correct
23 Correct 115 ms 78120 KB Output is correct
24 Correct 110 ms 78072 KB Output is correct
25 Correct 107 ms 78200 KB Output is correct
26 Correct 91 ms 77944 KB Output is correct
27 Correct 86 ms 77688 KB Output is correct
28 Correct 113 ms 77944 KB Output is correct
29 Correct 109 ms 78044 KB Output is correct
30 Correct 107 ms 78108 KB Output is correct
31 Correct 106 ms 78072 KB Output is correct
32 Correct 116 ms 77816 KB Output is correct
33 Correct 116 ms 77816 KB Output is correct
34 Correct 105 ms 77944 KB Output is correct
35 Correct 114 ms 77816 KB Output is correct
36 Correct 99 ms 78444 KB Output is correct
37 Correct 117 ms 77828 KB Output is correct
38 Correct 111 ms 77808 KB Output is correct
39 Correct 113 ms 77844 KB Output is correct
40 Correct 115 ms 77852 KB Output is correct
41 Correct 115 ms 77980 KB Output is correct
42 Correct 111 ms 77944 KB Output is correct
43 Correct 102 ms 78112 KB Output is correct
44 Correct 118 ms 77872 KB Output is correct
45 Correct 118 ms 77816 KB Output is correct
46 Correct 91 ms 77684 KB Output is correct
47 Correct 128 ms 77712 KB Output is correct
48 Correct 116 ms 77648 KB Output is correct
49 Correct 119 ms 77532 KB Output is correct
50 Correct 127 ms 77536 KB Output is correct
51 Correct 122 ms 77432 KB Output is correct
52 Correct 120 ms 77688 KB Output is correct
53 Correct 120 ms 77688 KB Output is correct
54 Correct 123 ms 77636 KB Output is correct
55 Correct 121 ms 77816 KB Output is correct
56 Correct 906 ms 78568 KB Output is correct
57 Correct 905 ms 78456 KB Output is correct
58 Correct 875 ms 78584 KB Output is correct
59 Correct 930 ms 78992 KB Output is correct
60 Correct 999 ms 79044 KB Output is correct
61 Correct 1018 ms 79164 KB Output is correct
62 Correct 972 ms 78968 KB Output is correct
63 Correct 917 ms 78840 KB Output is correct
64 Correct 919 ms 78836 KB Output is correct
65 Correct 867 ms 78936 KB Output is correct
66 Correct 857 ms 78968 KB Output is correct
67 Correct 927 ms 78916 KB Output is correct
68 Correct 995 ms 78968 KB Output is correct
69 Correct 960 ms 78984 KB Output is correct
70 Correct 893 ms 78864 KB Output is correct
71 Correct 855 ms 78684 KB Output is correct
72 Correct 911 ms 78940 KB Output is correct
73 Correct 844 ms 78968 KB Output is correct
74 Correct 575 ms 79356 KB Output is correct
75 Correct 333 ms 79060 KB Output is correct
76 Correct 295 ms 78756 KB Output is correct
77 Correct 754 ms 79224 KB Output is correct
78 Correct 723 ms 79184 KB Output is correct
79 Correct 463 ms 79496 KB Output is correct
80 Correct 903 ms 78848 KB Output is correct
81 Correct 902 ms 78892 KB Output is correct
82 Correct 764 ms 79324 KB Output is correct
83 Correct 828 ms 79072 KB Output is correct
84 Correct 606 ms 79204 KB Output is correct
85 Correct 880 ms 78936 KB Output is correct
86 Correct 913 ms 78856 KB Output is correct
87 Correct 367 ms 78712 KB Output is correct
88 Correct 939 ms 78880 KB Output is correct
89 Correct 943 ms 78688 KB Output is correct
90 Correct 943 ms 78700 KB Output is correct
91 Correct 913 ms 78684 KB Output is correct
92 Correct 851 ms 78592 KB Output is correct
93 Correct 871 ms 78828 KB Output is correct
94 Correct 1043 ms 78964 KB Output is correct
95 Correct 952 ms 78840 KB Output is correct
96 Correct 1016 ms 78944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1283 ms 210980 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 111712 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 68 ms 76280 KB Output is correct
2 Correct 69 ms 76152 KB Output is correct
3 Correct 69 ms 76284 KB Output is correct
4 Correct 113 ms 77432 KB Output is correct
5 Correct 120 ms 77440 KB Output is correct
6 Correct 114 ms 77560 KB Output is correct
7 Correct 123 ms 77944 KB Output is correct
8 Correct 117 ms 77916 KB Output is correct
9 Correct 125 ms 78044 KB Output is correct
10 Correct 119 ms 77680 KB Output is correct
11 Correct 119 ms 77660 KB Output is correct
12 Correct 119 ms 77860 KB Output is correct
13 Correct 116 ms 77820 KB Output is correct
14 Correct 119 ms 77816 KB Output is correct
15 Correct 124 ms 77916 KB Output is correct
16 Correct 129 ms 77944 KB Output is correct
17 Correct 123 ms 77944 KB Output is correct
18 Correct 119 ms 77816 KB Output is correct
19 Correct 116 ms 77532 KB Output is correct
20 Correct 118 ms 77884 KB Output is correct
21 Correct 119 ms 77800 KB Output is correct
22 Correct 120 ms 78072 KB Output is correct
23 Correct 115 ms 78120 KB Output is correct
24 Correct 110 ms 78072 KB Output is correct
25 Correct 107 ms 78200 KB Output is correct
26 Correct 91 ms 77944 KB Output is correct
27 Correct 86 ms 77688 KB Output is correct
28 Correct 113 ms 77944 KB Output is correct
29 Correct 109 ms 78044 KB Output is correct
30 Correct 107 ms 78108 KB Output is correct
31 Correct 106 ms 78072 KB Output is correct
32 Correct 116 ms 77816 KB Output is correct
33 Correct 116 ms 77816 KB Output is correct
34 Correct 105 ms 77944 KB Output is correct
35 Correct 114 ms 77816 KB Output is correct
36 Correct 99 ms 78444 KB Output is correct
37 Correct 117 ms 77828 KB Output is correct
38 Correct 111 ms 77808 KB Output is correct
39 Correct 113 ms 77844 KB Output is correct
40 Correct 115 ms 77852 KB Output is correct
41 Correct 115 ms 77980 KB Output is correct
42 Correct 111 ms 77944 KB Output is correct
43 Correct 102 ms 78112 KB Output is correct
44 Correct 118 ms 77872 KB Output is correct
45 Correct 118 ms 77816 KB Output is correct
46 Correct 91 ms 77684 KB Output is correct
47 Correct 128 ms 77712 KB Output is correct
48 Correct 116 ms 77648 KB Output is correct
49 Correct 119 ms 77532 KB Output is correct
50 Correct 127 ms 77536 KB Output is correct
51 Correct 122 ms 77432 KB Output is correct
52 Correct 120 ms 77688 KB Output is correct
53 Correct 120 ms 77688 KB Output is correct
54 Correct 123 ms 77636 KB Output is correct
55 Correct 121 ms 77816 KB Output is correct
56 Correct 906 ms 78568 KB Output is correct
57 Correct 905 ms 78456 KB Output is correct
58 Correct 875 ms 78584 KB Output is correct
59 Correct 930 ms 78992 KB Output is correct
60 Correct 999 ms 79044 KB Output is correct
61 Correct 1018 ms 79164 KB Output is correct
62 Correct 972 ms 78968 KB Output is correct
63 Correct 917 ms 78840 KB Output is correct
64 Correct 919 ms 78836 KB Output is correct
65 Correct 867 ms 78936 KB Output is correct
66 Correct 857 ms 78968 KB Output is correct
67 Correct 927 ms 78916 KB Output is correct
68 Correct 995 ms 78968 KB Output is correct
69 Correct 960 ms 78984 KB Output is correct
70 Correct 893 ms 78864 KB Output is correct
71 Correct 855 ms 78684 KB Output is correct
72 Correct 911 ms 78940 KB Output is correct
73 Correct 844 ms 78968 KB Output is correct
74 Correct 575 ms 79356 KB Output is correct
75 Correct 333 ms 79060 KB Output is correct
76 Correct 295 ms 78756 KB Output is correct
77 Correct 754 ms 79224 KB Output is correct
78 Correct 723 ms 79184 KB Output is correct
79 Correct 463 ms 79496 KB Output is correct
80 Correct 903 ms 78848 KB Output is correct
81 Correct 902 ms 78892 KB Output is correct
82 Correct 764 ms 79324 KB Output is correct
83 Correct 828 ms 79072 KB Output is correct
84 Correct 606 ms 79204 KB Output is correct
85 Correct 880 ms 78936 KB Output is correct
86 Correct 913 ms 78856 KB Output is correct
87 Correct 367 ms 78712 KB Output is correct
88 Correct 939 ms 78880 KB Output is correct
89 Correct 943 ms 78688 KB Output is correct
90 Correct 943 ms 78700 KB Output is correct
91 Correct 913 ms 78684 KB Output is correct
92 Correct 851 ms 78592 KB Output is correct
93 Correct 871 ms 78828 KB Output is correct
94 Correct 1043 ms 78964 KB Output is correct
95 Correct 952 ms 78840 KB Output is correct
96 Correct 1016 ms 78944 KB Output is correct
97 Runtime error 1283 ms 210980 KB Execution killed with signal 11 (could be triggered by violating memory limits)
98 Halted 0 ms 0 KB -