oj.uz

답안 #283630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283630 2020-08-26T03:55:27 Z arnold518 Iqea (innopolis2018_final_C) C++14
36 / 100
 1725 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int INF = 5e7;

int N;
pii A[MAXN+10];
vector<int> X[MAXN+10], Y[MAXN+10];

struct Line
{
	int l, r, p;
	Line(int l, int r, int p) : l(l), r(r), p(p) {}
	bool operator < (const Line &q) const { return r<q.r; }
};
int Q;
vector<Line> LX[MAXN+10], LY[MAXN+10];
vector<int> adjX[MAXN+10], adjY[MAXN+10];

pii get(int y, int x)
{
	int nx=lower_bound(LX[y].begin(), LX[y].end(), Line(0, x, 0))->p;
	int ny=lower_bound(LY[x].begin(), LY[x].end(), Line(0, y, 0))->p;
	return {nx, ny};
}

pii P[MAXN+10];

struct Tree
{
	int M;
	vector<vector<int>> adj, cdist;
	vector<int> sz, del, cpar, cdep;
	//int sz[MAXN+10], del[MAXN+10], cpar[MAXN+10], cdist[MAXN+10][30], cdep[MAXN+10];

	Tree()
	{
		M=0;
		sz=del=cpar=cdep=vector<int>(MAXN+10);
		cdist.resize(MAXN+10);
		for(auto &it : cdist) it.resize(30);
		adj.resize(MAXN+10);
	}

	void getsz(int now, int bef)
	{
		sz[now]=1;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			getsz(nxt, now);
			sz[now]+=sz[nxt];
		}
	}

	int getcen(int now, int bef, int S)
	{
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			if(sz[nxt]>S/2) return getcen(nxt, now, S);
		}
		return now;
	}

	void dfs(int now, int bef, int t, int dist)
	{
		cdist[now][t]=dist;
		for(int nxt : adj[now])
		{
			if(nxt==bef) continue;
			if(del[nxt]) continue;
			dfs(nxt, now, t, dist+1);
		}
	}

	void decomp(int now, int bef, int cendep)
	{
		getsz(now, now);
		now=getcen(now, now, sz[now]/2);
		cpar[now]=bef;
		cdep[now]=cendep;

		dfs(now, now, cendep, 0);
		del[now]=true;

		for(auto nxt : adj[now])
		{
			if(del[nxt]) continue;
			decomp(nxt, now, cendep+1);
		}
	}

	void init()
	{
		decomp(1, 0, 1);
		for(int i=1; i<=M; i++) assert(del[i]);
	}

	vector<int> getpar(int now)
	{
		vector<int> ans;
		while(now)
		{
			ans.push_back(now);
			now=cpar[now];
		}
		return ans;
	}
}TX, TY;

vector<pii> TP1;
vector<int> TP2;

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++)
	{
		int y, x;
		scanf("%d%d", &y, &x);
		A[i]={y, x};
		X[y].push_back(x);
		Y[x].push_back(y);
	}

	for(int i=1; i<=MAXN; i++)
	{
		if(X[i].empty()) continue;
		sort(X[i].begin(), X[i].end());

		int bef=X[i][0];
		for(int j=0; j+1<X[i].size(); j++)
		{
			if(X[i][j]+1!=X[i][j+1])
			{
				LX[i].push_back({bef, X[i][j], ++TX.M});
				//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
				bef=X[i][j+1];
			}
		}
		LX[i].push_back({bef, X[i].back(), ++TX.M});
		//printf("LX %d %d %d %d\n", i, LX[i].back().l, LX[i].back().r, LX[i].back().p);
	}

	int cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		int p=0;
		for(auto it : LX[i])
		{
			for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
			for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
			{
				int u=LX[i-1][p].p, v=it.p;
				TX.adj[u].push_back(v);
				TX.adj[v].push_back(u);
				cnt++;
				//printf("adjX %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	assert(cnt==TX.M-1);

	for(int i=1; i<=MAXN; i++)
	{
		if(Y[i].empty()) continue;
		sort(Y[i].begin(), Y[i].end());

		int bef=Y[i][0];
		for(int j=0; j+1<Y[i].size(); j++)
		{
			if(Y[i][j]+1!=Y[i][j+1])
			{
				LY[i].push_back({bef, Y[i][j], ++TY.M});
				//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
				bef=Y[i][j+1];
			}
		}
		LY[i].push_back({bef, Y[i].back(), ++TY.M});
		//printf("LY %d %d %d %d\n", i, LY[i].back().l, LY[i].back().r, LY[i].back().p);
	}

	cnt=0;
	for(int i=2; i<=MAXN; i++)
	{
		int p=0;
		for(auto it : LY[i])
		{
			for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
			for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
			{
				int u=LY[i-1][p].p, v=it.p;
				TY.adj[u].push_back(v);
				TY.adj[v].push_back(u);
				cnt++;
				//printf("adjY %d %d\n", u, v);
			}
			if(p) p--;
		}
	}
	assert(cnt==TY.M-1);

	TX.init(); TY.init();

	for(int i=1; i<=N; i++)
	{
		P[i]=get(A[i].first, A[i].second);
		vector<int> V1=TX.getpar(P[i].first);
		vector<int> V2=TY.getpar(P[i].second);
		for(auto it : V1) for(auto jt : V2) TP1.push_back({it, jt});
	}
	sort(TP1.begin(), TP1.end());
	TP1.erase(unique(TP1.begin(), TP1.end()), TP1.end());
	TP2=vector<int>(TP1.size(), INF);

	scanf("%d", &Q);
	bool flag=false;
	while(Q--)
	{
		int tt, y, x;
		scanf("%d%d%d", &tt, &y, &x);

		pii t=get(y, x);

		vector<int> V1=TX.getpar(t.first);
		vector<int> V2=TY.getpar(t.second);

		if(tt==1)
		{
			for(auto it : V1) for(auto jt : V2)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				TP2[pt]=min(TP2[pt], TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]);
			}
			flag=true;
		}
		else
		{
			if(!flag) { printf("-1\n"); continue; }
			int ans=INF;
			for(auto it : V1) for(auto jt : V2)
			{
				int pt=lower_bound(TP1.begin(), TP1.end(), pii(it, jt))-TP1.begin();
				ans=min(ans, TX.cdist[t.first][TX.cdep[it]]+TY.cdist[t.second][TY.cdep[jt]]+TP2[pt]);
			}
			if(ans==INF) ans=-1;
			//if(ans!=-1) assert(flag);
			printf("%d\n", ans);
		}
	}
}

Compilation message

C.cpp: In function 'int main()':
C.cpp:140:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |   for(int j=0; j+1<X[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:159:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |    for(; p<LX[i-1].size() && LX[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:160:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |    for(; p<LX[i-1].size() && LX[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:179:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |   for(int j=0; j+1<Y[i].size(); j++)
      |                ~~~^~~~~~~~~~~~
C.cpp:198:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  198 |    for(; p<LY[i-1].size() && LY[i-1][p].r<it.l; p++);
      |          ~^~~~~~~~~~~~~~~
C.cpp:199:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |    for(; p<LY[i-1].size() && LY[i-1][p].l<=it.r; p++)
      |          ~^~~~~~~~~~~~~~~
C.cpp:124:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  124 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
C.cpp:128:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  128 |   scanf("%d%d", &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:225:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  225 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
C.cpp:230:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  230 |   scanf("%d%d%d", &tt, &y, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 51968 KB Output is correct
2 Correct 45 ms 51968 KB Output is correct
3 Correct 47 ms 52096 KB Output is correct
4 Correct 104 ms 56424 KB Output is correct
5 Correct 100 ms 56408 KB Output is correct
6 Correct 106 ms 56436 KB Output is correct
7 Correct 145 ms 56556 KB Output is correct
8 Correct 157 ms 56684 KB Output is correct
9 Correct 162 ms 56680 KB Output is correct
10 Correct 148 ms 56556 KB Output is correct
11 Correct 142 ms 56556 KB Output is correct
12 Correct 146 ms 56684 KB Output is correct
13 Correct 142 ms 56704 KB Output is correct
14 Correct 144 ms 56684 KB Output is correct
15 Correct 137 ms 56684 KB Output is correct
16 Correct 158 ms 60776 KB Output is correct
17 Correct 143 ms 56552 KB Output is correct
18 Correct 146 ms 56556 KB Output is correct
19 Correct 128 ms 56552 KB Output is correct
20 Correct 161 ms 56684 KB Output is correct
21 Correct 145 ms 56684 KB Output is correct
22 Correct 174 ms 60904 KB Output is correct
23 Correct 172 ms 60900 KB Output is correct
24 Correct 183 ms 61028 KB Output is correct
25 Correct 73 ms 54000 KB Output is correct
26 Correct 78 ms 54768 KB Output is correct
27 Correct 64 ms 54128 KB Output is correct
28 Correct 180 ms 61032 KB Output is correct
29 Correct 180 ms 61160 KB Output is correct
30 Correct 190 ms 61156 KB Output is correct
31 Correct 201 ms 61156 KB Output is correct
32 Correct 186 ms 61064 KB Output is correct
33 Correct 201 ms 60900 KB Output is correct
34 Correct 181 ms 61028 KB Output is correct
35 Correct 188 ms 61016 KB Output is correct
36 Correct 68 ms 54128 KB Output is correct
37 Correct 192 ms 61156 KB Output is correct
38 Correct 182 ms 61032 KB Output is correct
39 Correct 192 ms 61156 KB Output is correct
40 Correct 187 ms 61156 KB Output is correct
41 Correct 181 ms 61028 KB Output is correct
42 Correct 172 ms 61028 KB Output is correct
43 Correct 70 ms 54132 KB Output is correct
44 Correct 183 ms 61028 KB Output is correct
45 Correct 182 ms 61028 KB Output is correct
46 Correct 68 ms 53940 KB Output is correct
47 Correct 136 ms 56552 KB Output is correct
48 Correct 131 ms 56428 KB Output is correct
49 Correct 135 ms 56428 KB Output is correct
50 Correct 126 ms 56556 KB Output is correct
51 Correct 119 ms 56424 KB Output is correct
52 Correct 137 ms 56684 KB Output is correct
53 Correct 161 ms 56680 KB Output is correct
54 Correct 150 ms 60772 KB Output is correct
55 Correct 149 ms 60776 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 51968 KB Output is correct
2 Correct 45 ms 51968 KB Output is correct
3 Correct 47 ms 52096 KB Output is correct
4 Correct 104 ms 56424 KB Output is correct
5 Correct 100 ms 56408 KB Output is correct
6 Correct 106 ms 56436 KB Output is correct
7 Correct 145 ms 56556 KB Output is correct
8 Correct 157 ms 56684 KB Output is correct
9 Correct 162 ms 56680 KB Output is correct
10 Correct 148 ms 56556 KB Output is correct
11 Correct 142 ms 56556 KB Output is correct
12 Correct 146 ms 56684 KB Output is correct
13 Correct 142 ms 56704 KB Output is correct
14 Correct 144 ms 56684 KB Output is correct
15 Correct 137 ms 56684 KB Output is correct
16 Correct 158 ms 60776 KB Output is correct
17 Correct 143 ms 56552 KB Output is correct
18 Correct 146 ms 56556 KB Output is correct
19 Correct 128 ms 56552 KB Output is correct
20 Correct 161 ms 56684 KB Output is correct
21 Correct 145 ms 56684 KB Output is correct
22 Correct 174 ms 60904 KB Output is correct
23 Correct 172 ms 60900 KB Output is correct
24 Correct 183 ms 61028 KB Output is correct
25 Correct 73 ms 54000 KB Output is correct
26 Correct 78 ms 54768 KB Output is correct
27 Correct 64 ms 54128 KB Output is correct
28 Correct 180 ms 61032 KB Output is correct
29 Correct 180 ms 61160 KB Output is correct
30 Correct 190 ms 61156 KB Output is correct
31 Correct 201 ms 61156 KB Output is correct
32 Correct 186 ms 61064 KB Output is correct
33 Correct 201 ms 60900 KB Output is correct
34 Correct 181 ms 61028 KB Output is correct
35 Correct 188 ms 61016 KB Output is correct
36 Correct 68 ms 54128 KB Output is correct
37 Correct 192 ms 61156 KB Output is correct
38 Correct 182 ms 61032 KB Output is correct
39 Correct 192 ms 61156 KB Output is correct
40 Correct 187 ms 61156 KB Output is correct
41 Correct 181 ms 61028 KB Output is correct
42 Correct 172 ms 61028 KB Output is correct
43 Correct 70 ms 54132 KB Output is correct
44 Correct 183 ms 61028 KB Output is correct
45 Correct 182 ms 61028 KB Output is correct
46 Correct 68 ms 53940 KB Output is correct
47 Correct 136 ms 56552 KB Output is correct
48 Correct 131 ms 56428 KB Output is correct
49 Correct 135 ms 56428 KB Output is correct
50 Correct 126 ms 56556 KB Output is correct
51 Correct 119 ms 56424 KB Output is correct
52 Correct 137 ms 56684 KB Output is correct
53 Correct 161 ms 56680 KB Output is correct
54 Correct 150 ms 60772 KB Output is correct
55 Correct 149 ms 60776 KB Output is correct
56 Correct 717 ms 56424 KB Output is correct
57 Correct 686 ms 56424 KB Output is correct
58 Correct 676 ms 56424 KB Output is correct
59 Correct 1132 ms 56556 KB Output is correct
60 Correct 1159 ms 56840 KB Output is correct
61 Correct 1189 ms 56724 KB Output is correct
62 Correct 1161 ms 56676 KB Output is correct
63 Correct 1136 ms 56684 KB Output is correct
64 Correct 1234 ms 57028 KB Output is correct
65 Correct 1056 ms 56684 KB Output is correct
66 Correct 1225 ms 56804 KB Output is correct
67 Correct 1118 ms 56684 KB Output is correct
68 Correct 1177 ms 56736 KB Output is correct
69 Correct 1139 ms 56704 KB Output is correct
70 Correct 1220 ms 56680 KB Output is correct
71 Correct 1216 ms 56552 KB Output is correct
72 Correct 1287 ms 57096 KB Output is correct
73 Correct 1183 ms 56896 KB Output is correct
74 Correct 307 ms 54004 KB Output is correct
75 Correct 403 ms 54760 KB Output is correct
76 Correct 245 ms 54128 KB Output is correct
77 Correct 1646 ms 61032 KB Output is correct
78 Correct 1613 ms 61160 KB Output is correct
79 Correct 233 ms 54128 KB Output is correct
80 Correct 1725 ms 61032 KB Output is correct
81 Correct 1697 ms 61032 KB Output is correct
82 Correct 1579 ms 61028 KB Output is correct
83 Correct 1545 ms 61028 KB Output is correct
84 Correct 293 ms 54004 KB Output is correct
85 Correct 1561 ms 61028 KB Output is correct
86 Correct 1586 ms 61028 KB Output is correct
87 Correct 291 ms 54128 KB Output is correct
88 Correct 1082 ms 56652 KB Output is correct
89 Correct 1086 ms 56628 KB Output is correct
90 Correct 922 ms 56424 KB Output is correct
91 Correct 892 ms 56428 KB Output is correct
92 Correct 736 ms 56424 KB Output is correct
93 Correct 1108 ms 56680 KB Output is correct
94 Correct 1026 ms 56816 KB Output is correct
95 Correct 1252 ms 60772 KB Output is correct
96 Correct 1236 ms 60772 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 789 ms 142164 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 586 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 51968 KB Output is correct
2 Correct 45 ms 51968 KB Output is correct
3 Correct 47 ms 52096 KB Output is correct
4 Correct 104 ms 56424 KB Output is correct
5 Correct 100 ms 56408 KB Output is correct
6 Correct 106 ms 56436 KB Output is correct
7 Correct 145 ms 56556 KB Output is correct
8 Correct 157 ms 56684 KB Output is correct
9 Correct 162 ms 56680 KB Output is correct
10 Correct 148 ms 56556 KB Output is correct
11 Correct 142 ms 56556 KB Output is correct
12 Correct 146 ms 56684 KB Output is correct
13 Correct 142 ms 56704 KB Output is correct
14 Correct 144 ms 56684 KB Output is correct
15 Correct 137 ms 56684 KB Output is correct
16 Correct 158 ms 60776 KB Output is correct
17 Correct 143 ms 56552 KB Output is correct
18 Correct 146 ms 56556 KB Output is correct
19 Correct 128 ms 56552 KB Output is correct
20 Correct 161 ms 56684 KB Output is correct
21 Correct 145 ms 56684 KB Output is correct
22 Correct 174 ms 60904 KB Output is correct
23 Correct 172 ms 60900 KB Output is correct
24 Correct 183 ms 61028 KB Output is correct
25 Correct 73 ms 54000 KB Output is correct
26 Correct 78 ms 54768 KB Output is correct
27 Correct 64 ms 54128 KB Output is correct
28 Correct 180 ms 61032 KB Output is correct
29 Correct 180 ms 61160 KB Output is correct
30 Correct 190 ms 61156 KB Output is correct
31 Correct 201 ms 61156 KB Output is correct
32 Correct 186 ms 61064 KB Output is correct
33 Correct 201 ms 60900 KB Output is correct
34 Correct 181 ms 61028 KB Output is correct
35 Correct 188 ms 61016 KB Output is correct
36 Correct 68 ms 54128 KB Output is correct
37 Correct 192 ms 61156 KB Output is correct
38 Correct 182 ms 61032 KB Output is correct
39 Correct 192 ms 61156 KB Output is correct
40 Correct 187 ms 61156 KB Output is correct
41 Correct 181 ms 61028 KB Output is correct
42 Correct 172 ms 61028 KB Output is correct
43 Correct 70 ms 54132 KB Output is correct
44 Correct 183 ms 61028 KB Output is correct
45 Correct 182 ms 61028 KB Output is correct
46 Correct 68 ms 53940 KB Output is correct
47 Correct 136 ms 56552 KB Output is correct
48 Correct 131 ms 56428 KB Output is correct
49 Correct 135 ms 56428 KB Output is correct
50 Correct 126 ms 56556 KB Output is correct
51 Correct 119 ms 56424 KB Output is correct
52 Correct 137 ms 56684 KB Output is correct
53 Correct 161 ms 56680 KB Output is correct
54 Correct 150 ms 60772 KB Output is correct
55 Correct 149 ms 60776 KB Output is correct
56 Correct 717 ms 56424 KB Output is correct
57 Correct 686 ms 56424 KB Output is correct
58 Correct 676 ms 56424 KB Output is correct
59 Correct 1132 ms 56556 KB Output is correct
60 Correct 1159 ms 56840 KB Output is correct
61 Correct 1189 ms 56724 KB Output is correct
62 Correct 1161 ms 56676 KB Output is correct
63 Correct 1136 ms 56684 KB Output is correct
64 Correct 1234 ms 57028 KB Output is correct
65 Correct 1056 ms 56684 KB Output is correct
66 Correct 1225 ms 56804 KB Output is correct
67 Correct 1118 ms 56684 KB Output is correct
68 Correct 1177 ms 56736 KB Output is correct
69 Correct 1139 ms 56704 KB Output is correct
70 Correct 1220 ms 56680 KB Output is correct
71 Correct 1216 ms 56552 KB Output is correct
72 Correct 1287 ms 57096 KB Output is correct
73 Correct 1183 ms 56896 KB Output is correct
74 Correct 307 ms 54004 KB Output is correct
75 Correct 403 ms 54760 KB Output is correct
76 Correct 245 ms 54128 KB Output is correct
77 Correct 1646 ms 61032 KB Output is correct
78 Correct 1613 ms 61160 KB Output is correct
79 Correct 233 ms 54128 KB Output is correct
80 Correct 1725 ms 61032 KB Output is correct
81 Correct 1697 ms 61032 KB Output is correct
82 Correct 1579 ms 61028 KB Output is correct
83 Correct 1545 ms 61028 KB Output is correct
84 Correct 293 ms 54004 KB Output is correct
85 Correct 1561 ms 61028 KB Output is correct
86 Correct 1586 ms 61028 KB Output is correct
87 Correct 291 ms 54128 KB Output is correct
88 Correct 1082 ms 56652 KB Output is correct
89 Correct 1086 ms 56628 KB Output is correct
90 Correct 922 ms 56424 KB Output is correct
91 Correct 892 ms 56428 KB Output is correct
92 Correct 736 ms 56424 KB Output is correct
93 Correct 1108 ms 56680 KB Output is correct
94 Correct 1026 ms 56816 KB Output is correct
95 Correct 1252 ms 60772 KB Output is correct
96 Correct 1236 ms 60772 KB Output is correct
97 Runtime error 789 ms 142164 KB Execution killed with signal 11
98 Halted 0 ms 0 KB -