oj.uz

Submission #114047

# Submission time Handle Problem Language Result Execution time Memory
114047 2019-05-29T17:41:24 Z sebinkim Iqea (innopolis2018_final_C) C++14
0 / 100
 2000 ms 28412 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

struct point{
	int x, y, i;
	point() {}
	point(int x, int y, int i) : x(x), y(y), i(i) {}
};

const int sz = 1;

vector <point> P;
vector <pii> K;
queue <pii> Q;
vector <int> T[202020], V[101010];
int U[20][202020], W[202020];
int X[101010], Y[101010], D[101010];
bool chk[101010];
int n, k;

void dfs(int p, int r)
{
	U[0][p] = r; W[p] = W[r] + 1;
	
	for(int &t: T[p]){
		if(t != r) dfs(t, p);
	}
}

int dist(int p, int q)
{
	int i, ret;
	
	ret = 0;
	
	if(W[p] < W[q]) swap(p, q);
	
	for(i=0; i<18; i++){
		if(W[p] - W[q] & (1 << i)){
			p = U[i][p];
			ret += 1 << i;
		}
	}
	
	if(p == q) return ret;
	
	for(i--; i>=0; i--){
		if(U[i][p] != U[i][q]){
			p = U[i][p]; q = U[i][q];
			ret += 2 << i;
		}
	}
	
	return ret + 2;
}

void bfs()
{
	int i, p, d;
	
	for(i=0; i<n; i++){
		chk[i] = 0;
	}
	
	for(pii &t: K){
		chk[t.first] = 1;
		Q.push(pii(t.first, 0));
	}
	
	K.clear();
	
	for(; !Q.empty(); ){
		tie(p, d) = Q.front(); Q.pop();
		D[p] = min(D[p], d);
		for(int &t: V[p]){
			if(!chk[t]){
				Q.push(pii(t, d + 1));
				chk[t] = 1;
			}
		}
	}
}

int query(int p)
{
	int ret;
	
	ret = D[p];
	
	for(pii &t: K){
		ret = min(ret, dist(X[p], X[t.first]) + dist(Y[p], Y[t.first]));
	}
	
	return ret < 1e9? ret : -1;
}

int main()
{
	int q, i, j, x, y, t;
	
	scanf("%d", &n);
	
	for(i=0; i<n; i++){
		scanf("%d%d", &x, &y);
		P.emplace_back(x, y, i);
		D[i] = 1e9;
	}
	
	sort(P.begin(), P.end(), [&](point &pa, point &pb){
		if(pa.x != pb.x) return pa.x < pb.x;
		else return pa.y < pb.y;
	});
	
	for(i=0; i<n; i=j){
		k ++;
		for(j=i; j<n && P[i].x == P[j].x && P[i].y == P[j].y - j + i; j++){
			X[P[j].i] = k;
		}
	}
	
	sort(P.begin(), P.end(), [&](point &pa, point &pb){
		if(pa.y != pb.y) return pa.y < pb.y;
		else return pa.x < pb.x;
	});
	
	for(i=0; i<n; i=j){
		k ++;
		for(j=i; j<n && P[i].y == P[j].y && P[i].x == P[j].x - j + i; j++){
			Y[P[j].i] = k;
		}
	}
	
	for(i=1; i<n; i++){
		if(P[i - 1].y == P[i].y && P[i - 1].x + 1 == P[i].x){
			T[X[P[i].i]].push_back(X[P[i - 1].i]);
			T[X[P[i - 1].i]].push_back(X[P[i].i]);
			V[P[i].i].push_back(P[i - 1].i);
			V[P[i - 1].i].push_back(P[i].i);
		}
	}
	
	sort(P.begin(), P.end(), [&](point &pa, point &pb){
		if(pa.x != pb.x) return pa.x < pb.x;
		else return pa.y < pb.y;
	});
	
	
	for(i=1; i<n; i++){
		if(P[i - 1].x == P[i].x && P[i - 1].y + 1 == P[i].y){
			T[Y[P[i].i]].push_back(Y[P[i - 1].i]);
			T[Y[P[i - 1].i]].push_back(Y[P[i].i]);
			V[P[i].i].push_back(P[i - 1].i);
			V[P[i - 1].i].push_back(P[i].i);
		}
	}
	
	for(i=1; i<=k; i++){
		sort(T[i].begin(), T[i].end());
		T[i].erase(unique(T[i].begin(), T[i].end()), T[i].end());
	}
	
	dfs(1, 0); dfs(k, 0);
	
	for(i=1; i<18; i++){
		for(j=1; j<=k; j++){
			U[i][j] = U[i - 1][U[i - 1][j]];
		}
	}
	
	scanf("%d", &q);
	
	for(; q--; ){
		scanf("%d%d%d", &t, &x, &y);
		i = lower_bound(P.begin(), P.end(), point(x, y, -1), [&](point pa, point pb){
			if(pa.x != pb.x) return pa.x < pb.x;
			else return pa.y < pb.y;
		}) - P.begin();
		
		if(t == 1) K.push_back(pii(i, 0));
		else printf("%d\n", query(i));
		
		if(q % sz == 0) bfs();
	}
	
	return 0;
}

Compilation message

C.cpp: In function 'int dist(int, int)':
C.cpp:42:11: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   if(W[p] - W[q] & (1 << i)){
      ~~~~~^~~~~~
C.cpp: In function 'int main()':
C.cpp:104:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
C.cpp:107:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:173:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
C.cpp:176:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &t, &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 7552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 7552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 7552 KB Output isn't correct
2 Halted 0 ms 0 KB -