답안 #115086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115086	2019-06-05T08:27:45 Z	윤교준(#2865)	Iqea (innopolis2018_final_C)	C++14	17 / 100	2000 ms	111764 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 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];

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;) {
		//printf("upd : p = (%d, %d), idx = %d, i = %d, prt = %d\n", p.first, p.second, idx, i, prt[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);
		//printf("get : p = (%d, %d), i = %d, t = %d, prt = %d\n", p.first, p.second, i, t, prt[i]);
		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

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	76152 KB	Output is correct
2	Correct	67 ms	76152 KB	Output is correct
3	Correct	69 ms	76280 KB	Output is correct
4	Correct	160 ms	77444 KB	Output is correct
5	Correct	169 ms	77436 KB	Output is correct
6	Correct	174 ms	77532 KB	Output is correct
7	Correct	132 ms	78004 KB	Output is correct
8	Correct	130 ms	78048 KB	Output is correct
9	Correct	131 ms	77944 KB	Output is correct
10	Correct	149 ms	77668 KB	Output is correct
11	Correct	145 ms	77884 KB	Output is correct
12	Correct	147 ms	77816 KB	Output is correct
13	Correct	140 ms	77964 KB	Output is correct
14	Correct	394 ms	77944 KB	Output is correct
15	Correct	138 ms	77916 KB	Output is correct
16	Correct	141 ms	77944 KB	Output is correct
17	Correct	137 ms	77944 KB	Output is correct
18	Correct	143 ms	77704 KB	Output is correct
19	Correct	148 ms	77820 KB	Output is correct
20	Correct	139 ms	77816 KB	Output is correct
21	Correct	148 ms	77944 KB	Output is correct
22	Correct	126 ms	78064 KB	Output is correct
23	Correct	123 ms	78172 KB	Output is correct
24	Correct	111 ms	78144 KB	Output is correct
25	Correct	112 ms	78200 KB	Output is correct
26	Correct	118 ms	77988 KB	Output is correct
27	Correct	115 ms	77660 KB	Output is correct
28	Correct	112 ms	78084 KB	Output is correct
29	Correct	118 ms	78116 KB	Output is correct
30	Correct	116 ms	78120 KB	Output is correct
31	Correct	109 ms	78024 KB	Output is correct
32	Correct	136 ms	77992 KB	Output is correct
33	Correct	129 ms	77896 KB	Output is correct
34	Correct	114 ms	78128 KB	Output is correct
35	Correct	130 ms	77904 KB	Output is correct
36	Correct	105 ms	78428 KB	Output is correct
37	Correct	129 ms	77820 KB	Output is correct
38	Correct	134 ms	77816 KB	Output is correct
39	Correct	126 ms	77888 KB	Output is correct
40	Correct	134 ms	77976 KB	Output is correct
41	Correct	117 ms	78108 KB	Output is correct
42	Correct	117 ms	78028 KB	Output is correct
43	Correct	105 ms	78180 KB	Output is correct
44	Correct	139 ms	77776 KB	Output is correct
45	Correct	138 ms	77892 KB	Output is correct
46	Correct	123 ms	77820 KB	Output is correct
47	Correct	148 ms	77776 KB	Output is correct
48	Correct	153 ms	77840 KB	Output is correct
49	Correct	147 ms	77572 KB	Output is correct
50	Correct	175 ms	77624 KB	Output is correct
51	Correct	166 ms	77668 KB	Output is correct
52	Correct	183 ms	77676 KB	Output is correct
53	Correct	130 ms	77816 KB	Output is correct
54	Correct	149 ms	77688 KB	Output is correct
55	Correct	141 ms	77724 KB	Output is correct

Subtask #2
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	76152 KB	Output is correct
2	Correct	67 ms	76152 KB	Output is correct
3	Correct	69 ms	76280 KB	Output is correct
4	Correct	160 ms	77444 KB	Output is correct
5	Correct	169 ms	77436 KB	Output is correct
6	Correct	174 ms	77532 KB	Output is correct
7	Correct	132 ms	78004 KB	Output is correct
8	Correct	130 ms	78048 KB	Output is correct
9	Correct	131 ms	77944 KB	Output is correct
10	Correct	149 ms	77668 KB	Output is correct
11	Correct	145 ms	77884 KB	Output is correct
12	Correct	147 ms	77816 KB	Output is correct
13	Correct	140 ms	77964 KB	Output is correct
14	Correct	394 ms	77944 KB	Output is correct
15	Correct	138 ms	77916 KB	Output is correct
16	Correct	141 ms	77944 KB	Output is correct
17	Correct	137 ms	77944 KB	Output is correct
18	Correct	143 ms	77704 KB	Output is correct
19	Correct	148 ms	77820 KB	Output is correct
20	Correct	139 ms	77816 KB	Output is correct
21	Correct	148 ms	77944 KB	Output is correct
22	Correct	126 ms	78064 KB	Output is correct
23	Correct	123 ms	78172 KB	Output is correct
24	Correct	111 ms	78144 KB	Output is correct
25	Correct	112 ms	78200 KB	Output is correct
26	Correct	118 ms	77988 KB	Output is correct
27	Correct	115 ms	77660 KB	Output is correct
28	Correct	112 ms	78084 KB	Output is correct
29	Correct	118 ms	78116 KB	Output is correct
30	Correct	116 ms	78120 KB	Output is correct
31	Correct	109 ms	78024 KB	Output is correct
32	Correct	136 ms	77992 KB	Output is correct
33	Correct	129 ms	77896 KB	Output is correct
34	Correct	114 ms	78128 KB	Output is correct
35	Correct	130 ms	77904 KB	Output is correct
36	Correct	105 ms	78428 KB	Output is correct
37	Correct	129 ms	77820 KB	Output is correct
38	Correct	134 ms	77816 KB	Output is correct
39	Correct	126 ms	77888 KB	Output is correct
40	Correct	134 ms	77976 KB	Output is correct
41	Correct	117 ms	78108 KB	Output is correct
42	Correct	117 ms	78028 KB	Output is correct
43	Correct	105 ms	78180 KB	Output is correct
44	Correct	139 ms	77776 KB	Output is correct
45	Correct	138 ms	77892 KB	Output is correct
46	Correct	123 ms	77820 KB	Output is correct
47	Correct	148 ms	77776 KB	Output is correct
48	Correct	153 ms	77840 KB	Output is correct
49	Correct	147 ms	77572 KB	Output is correct
50	Correct	175 ms	77624 KB	Output is correct
51	Correct	166 ms	77668 KB	Output is correct
52	Correct	183 ms	77676 KB	Output is correct
53	Correct	130 ms	77816 KB	Output is correct
54	Correct	149 ms	77688 KB	Output is correct
55	Correct	141 ms	77724 KB	Output is correct
56	Execution timed out	2028 ms	78888 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2029 ms	105704 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2024 ms	111764 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	66 ms	76152 KB	Output is correct
2	Correct	67 ms	76152 KB	Output is correct
3	Correct	69 ms	76280 KB	Output is correct
4	Correct	160 ms	77444 KB	Output is correct
5	Correct	169 ms	77436 KB	Output is correct
6	Correct	174 ms	77532 KB	Output is correct
7	Correct	132 ms	78004 KB	Output is correct
8	Correct	130 ms	78048 KB	Output is correct
9	Correct	131 ms	77944 KB	Output is correct
10	Correct	149 ms	77668 KB	Output is correct
11	Correct	145 ms	77884 KB	Output is correct
12	Correct	147 ms	77816 KB	Output is correct
13	Correct	140 ms	77964 KB	Output is correct
14	Correct	394 ms	77944 KB	Output is correct
15	Correct	138 ms	77916 KB	Output is correct
16	Correct	141 ms	77944 KB	Output is correct
17	Correct	137 ms	77944 KB	Output is correct
18	Correct	143 ms	77704 KB	Output is correct
19	Correct	148 ms	77820 KB	Output is correct
20	Correct	139 ms	77816 KB	Output is correct
21	Correct	148 ms	77944 KB	Output is correct
22	Correct	126 ms	78064 KB	Output is correct
23	Correct	123 ms	78172 KB	Output is correct
24	Correct	111 ms	78144 KB	Output is correct
25	Correct	112 ms	78200 KB	Output is correct
26	Correct	118 ms	77988 KB	Output is correct
27	Correct	115 ms	77660 KB	Output is correct
28	Correct	112 ms	78084 KB	Output is correct
29	Correct	118 ms	78116 KB	Output is correct
30	Correct	116 ms	78120 KB	Output is correct
31	Correct	109 ms	78024 KB	Output is correct
32	Correct	136 ms	77992 KB	Output is correct
33	Correct	129 ms	77896 KB	Output is correct
34	Correct	114 ms	78128 KB	Output is correct
35	Correct	130 ms	77904 KB	Output is correct
36	Correct	105 ms	78428 KB	Output is correct
37	Correct	129 ms	77820 KB	Output is correct
38	Correct	134 ms	77816 KB	Output is correct
39	Correct	126 ms	77888 KB	Output is correct
40	Correct	134 ms	77976 KB	Output is correct
41	Correct	117 ms	78108 KB	Output is correct
42	Correct	117 ms	78028 KB	Output is correct
43	Correct	105 ms	78180 KB	Output is correct
44	Correct	139 ms	77776 KB	Output is correct
45	Correct	138 ms	77892 KB	Output is correct
46	Correct	123 ms	77820 KB	Output is correct
47	Correct	148 ms	77776 KB	Output is correct
48	Correct	153 ms	77840 KB	Output is correct
49	Correct	147 ms	77572 KB	Output is correct
50	Correct	175 ms	77624 KB	Output is correct
51	Correct	166 ms	77668 KB	Output is correct
52	Correct	183 ms	77676 KB	Output is correct
53	Correct	130 ms	77816 KB	Output is correct
54	Correct	149 ms	77688 KB	Output is correct
55	Correct	141 ms	77724 KB	Output is correct
56	Execution timed out	2028 ms	78888 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

답안 #115086

Compilation message

Subtask #1 17.0 / 17.0

Subtask #2 0 / 19.0

Subtask #3 0 / 15.0

Subtask #4 0 / 20.0

Subtask #5 0 / 29.0

Subtask #1
17.0 / 17.0

Subtask #2
0 / 19.0

Subtask #3
0 / 15.0

Subtask #4
0 / 20.0

Subtask #5
0 / 29.0