oj.uz

답안 #54689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54689 2018-07-04T15:45:01 Z ksun48 Long Mansion (JOI17_long_mansion) C++14
10 / 100
 3000 ms 27440 KB 
#include <bits/stdc++.h>
using namespace std;


//  0|   1|   2|   3|   4|   6|
//    23    1    1    3    4
vector<int> solve(int n, vector<int> walls, vector<vector<int> > keys){
	// keys range from 0 to n
	// rooms 0 ... n+1
	// rooms
	// 0    1    2    ...      n    n+1
	//   0|   1|   2|     n-1|   n|  
	// walls

	// for rooms 1 ... n, returns leftmost reachable room
	vector<vector<int> > keylocations(n+1);
	for(int i = 0; i <= n+1; i++){
		for(int a : keys[i]){
			keylocations[a].push_back(i);
		}
	}
	vector<int> prevkey(n+1);
	vector<int> nextkey(n+1);
	for(int i = 0; i <= n; i++){
		int type = walls[i];
		auto it = lower_bound(keylocations[type].begin(), keylocations[type].end(), i+1);
		nextkey[i] = *it;
		prevkey[i] = *(it-1);
	}

	// for each wall, find farthest one so that there's a conflict
	// then for a starting room, find dist to closest so that there is a conflict that extends past it
	vector<int> conflict(n+1, -1);
	for(int j = 0; j <= n; j++){
		for(int k = n; k >= 0; k--){
			if(prevkey[k] <= j && nextkey[j] >= k+1){
				conflict[j] = k;
				break;
			}
		}
	}

	vector<int> ans(n+2, -1);
	for(int j = 1; j <= n; j++){
		for(int k = j-1; k >= 0; k--){
			if(conflict[k] >= j){
				ans[j] = j-1-k;
				break;
			}
		}
	}
	return ans;
}

int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	vector<int> walls; // what key need
	walls.push_back(0);
	for(int i = 1; i < n; i++){
		int c;
		cin >> c;
		walls.push_back(c);
	}
	walls.push_back(0);
	vector<vector<int> > keys(n+2);
	for(int i = 0; i <= n; i++){
		keys[0].push_back(i);
		keys[n+1].push_back(i);
	}
	for(int i = 1; i <= n; i++){
		int b;
		cin >> b;
		keys[i].resize(b);
		for(int j = 0; j < b; j++){
			cin >> keys[i][j];
		}
	}
	int q;
	cin >> q;
	vector<int> x(q);
	vector<int> y(q);
	for(int i = 0; i < q; i++){
		cin >> x[i] >> y[i];
	}

	vector<int> leftans = solve(n, walls, keys);
	reverse(walls.begin(), walls.end());
	reverse(keys.begin(), keys.end());
	vector<int> rightans = solve(n, walls, keys);
	reverse(rightans.begin(), rightans.end());
	for(int i = 0; i < q; i++){
		if(y[i]-x[i] <= rightans[x[i]] && y[i]-x[i] >= -leftans[x[i]]){
			cout << "YES" << '\n';
		} else {
			cout << "NO" << '\n';
		}
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 760 KB Output is correct
2 Correct 17 ms 1128 KB Output is correct
3 Correct 37 ms 1600 KB Output is correct
4 Correct 10 ms 1600 KB Output is correct
5 Correct 13 ms 1600 KB Output is correct
6 Correct 10 ms 1600 KB Output is correct
7 Correct 8 ms 1600 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 760 KB Output is correct
2 Correct 17 ms 1128 KB Output is correct
3 Correct 37 ms 1600 KB Output is correct
4 Correct 10 ms 1600 KB Output is correct
5 Correct 13 ms 1600 KB Output is correct
6 Correct 10 ms 1600 KB Output is correct
7 Correct 8 ms 1600 KB Output is correct
8 Correct 135 ms 6548 KB Output is correct
9 Correct 144 ms 6548 KB Output is correct
10 Correct 230 ms 6828 KB Output is correct
11 Correct 179 ms 7396 KB Output is correct
12 Correct 170 ms 7396 KB Output is correct
13 Correct 135 ms 7396 KB Output is correct
14 Correct 134 ms 7396 KB Output is correct
15 Correct 154 ms 7396 KB Output is correct
16 Correct 174 ms 7396 KB Output is correct
17 Correct 131 ms 7396 KB Output is correct
18 Correct 154 ms 7396 KB Output is correct
19 Correct 136 ms 7396 KB Output is correct
20 Correct 143 ms 7396 KB Output is correct
21 Correct 155 ms 7396 KB Output is correct
22 Correct 130 ms 7396 KB Output is correct
23 Correct 142 ms 7396 KB Output is correct
24 Correct 129 ms 7396 KB Output is correct
25 Correct 128 ms 7396 KB Output is correct
26 Correct 175 ms 7396 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 760 KB Output is correct
2 Correct 17 ms 1128 KB Output is correct
3 Correct 37 ms 1600 KB Output is correct
4 Correct 10 ms 1600 KB Output is correct
5 Correct 13 ms 1600 KB Output is correct
6 Correct 10 ms 1600 KB Output is correct
7 Correct 8 ms 1600 KB Output is correct
8 Correct 135 ms 6548 KB Output is correct
9 Correct 144 ms 6548 KB Output is correct
10 Correct 230 ms 6828 KB Output is correct
11 Correct 179 ms 7396 KB Output is correct
12 Correct 170 ms 7396 KB Output is correct
13 Correct 135 ms 7396 KB Output is correct
14 Correct 134 ms 7396 KB Output is correct
15 Correct 154 ms 7396 KB Output is correct
16 Correct 174 ms 7396 KB Output is correct
17 Correct 131 ms 7396 KB Output is correct
18 Correct 154 ms 7396 KB Output is correct
19 Correct 136 ms 7396 KB Output is correct
20 Correct 143 ms 7396 KB Output is correct
21 Correct 155 ms 7396 KB Output is correct
22 Correct 130 ms 7396 KB Output is correct
23 Correct 142 ms 7396 KB Output is correct
24 Correct 129 ms 7396 KB Output is correct
25 Correct 128 ms 7396 KB Output is correct
26 Correct 175 ms 7396 KB Output is correct
27 Execution timed out 3045 ms 27440 KB Time limit exceeded
28 Halted 0 ms 0 KB -