답안 #67998 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
67998	2018-08-15T17:41:04 Z	KieranHorgan	경주 (Race) (IOI11_race)	C++17	21 / 100	3000 ms	69700 KB

race

#pragma GCC optimize("Ofast")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int, int>> AdjList[200000];
bitset<200000> visited1[100];
bitset<200000> visited2[100];
int prv[100][200000];

int best_path(int N, int K, int H[][2], int L[]) {
	for(int i = 0; i+1 < N; i++) {
		AdjList[H[i][0]].push_back({L[i], H[i][1]});
		AdjList[H[i][1]].push_back({L[i], H[i][0]});
	}

	queue<pair<pair<int, int>, pair<pair<int, int>, int>>> q;
	for(int i = 0; i < N; i++)
		q.push({{i, -1}, {{0, 0}, -1}});
	int u, p, d, s, to;
	while(!q.empty()) {
		u = q.front().first.first;
		p = q.front().first.second;
		d = q.front().second.first.first;
		s = q.front().second.first.second;
		to = q.front().second.second;
		q.pop();
		for(auto v: AdjList[u]) {
			if(v.second != p && (to == -1 || to == v.second)) {
				if(d+v.first == K)
					return s+1;
				if(d+v.first > K) continue;
				if(K <= 100) {
					if(!visited1[d+v.first][v.second]) {
						visited1[d+v.first][v.second]=1;
						q.push({{v.second, u}, {{d+v.first, s+1}, -1}});
						prv[d+v.first][v.second] = u;
					} else if(!visited2[d+v.first][v.second] && prv[d+v.first][v.second] != u) {
						visited2[d+v.first][v.second]=1;
						q.push({{v.second, u}, {{d+v.first, s+1}, prv[d+v.first][v.second]}});
					}
				} else {
					q.push({{v.second, u}, {{d+v.first, s+1}, -1}});
				}
			}
		}
	}

	return -1;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5752 KB	Output is correct
2	Correct	8 ms	5868 KB	Output is correct
3	Correct	8 ms	5868 KB	Output is correct
4	Correct	7 ms	5868 KB	Output is correct
5	Correct	8 ms	5868 KB	Output is correct
6	Correct	8 ms	5924 KB	Output is correct
7	Correct	10 ms	6052 KB	Output is correct
8	Correct	8 ms	6076 KB	Output is correct
9	Correct	9 ms	6508 KB	Output is correct
10	Correct	10 ms	6508 KB	Output is correct
11	Correct	8 ms	6508 KB	Output is correct
12	Correct	10 ms	6508 KB	Output is correct
13	Correct	10 ms	6652 KB	Output is correct
14	Correct	9 ms	6652 KB	Output is correct
15	Correct	10 ms	6652 KB	Output is correct
16	Correct	11 ms	6652 KB	Output is correct
17	Correct	10 ms	6652 KB	Output is correct
18	Correct	10 ms	6652 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5752 KB	Output is correct
2	Correct	8 ms	5868 KB	Output is correct
3	Correct	8 ms	5868 KB	Output is correct
4	Correct	7 ms	5868 KB	Output is correct
5	Correct	8 ms	5868 KB	Output is correct
6	Correct	8 ms	5924 KB	Output is correct
7	Correct	10 ms	6052 KB	Output is correct
8	Correct	8 ms	6076 KB	Output is correct
9	Correct	9 ms	6508 KB	Output is correct
10	Correct	10 ms	6508 KB	Output is correct
11	Correct	8 ms	6508 KB	Output is correct
12	Correct	10 ms	6508 KB	Output is correct
13	Correct	10 ms	6652 KB	Output is correct
14	Correct	9 ms	6652 KB	Output is correct
15	Correct	10 ms	6652 KB	Output is correct
16	Correct	11 ms	6652 KB	Output is correct
17	Correct	10 ms	6652 KB	Output is correct
18	Correct	10 ms	6652 KB	Output is correct
19	Correct	7 ms	6652 KB	Output is correct
20	Correct	6 ms	6652 KB	Output is correct
21	Correct	55 ms	8060 KB	Output is correct
22	Correct	8 ms	8060 KB	Output is correct
23	Correct	8 ms	8060 KB	Output is correct
24	Correct	9 ms	8060 KB	Output is correct
25	Correct	44 ms	8060 KB	Output is correct
26	Correct	7 ms	8060 KB	Output is correct
27	Correct	8 ms	8060 KB	Output is correct
28	Correct	10 ms	8060 KB	Output is correct
29	Correct	19 ms	8060 KB	Output is correct
30	Correct	13 ms	8060 KB	Output is correct
31	Correct	33 ms	8060 KB	Output is correct
32	Correct	31 ms	8060 KB	Output is correct
33	Correct	29 ms	8060 KB	Output is correct
34	Correct	9 ms	8060 KB	Output is correct
35	Correct	9 ms	8060 KB	Output is correct
36	Correct	10 ms	8060 KB	Output is correct
37	Correct	28 ms	8060 KB	Output is correct
38	Correct	34 ms	8060 KB	Output is correct

Subtask #3
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5752 KB	Output is correct
2	Correct	8 ms	5868 KB	Output is correct
3	Correct	8 ms	5868 KB	Output is correct
4	Correct	7 ms	5868 KB	Output is correct
5	Correct	8 ms	5868 KB	Output is correct
6	Correct	8 ms	5924 KB	Output is correct
7	Correct	10 ms	6052 KB	Output is correct
8	Correct	8 ms	6076 KB	Output is correct
9	Correct	9 ms	6508 KB	Output is correct
10	Correct	10 ms	6508 KB	Output is correct
11	Correct	8 ms	6508 KB	Output is correct
12	Correct	10 ms	6508 KB	Output is correct
13	Correct	10 ms	6652 KB	Output is correct
14	Correct	9 ms	6652 KB	Output is correct
15	Correct	10 ms	6652 KB	Output is correct
16	Correct	11 ms	6652 KB	Output is correct
17	Correct	10 ms	6652 KB	Output is correct
18	Correct	10 ms	6652 KB	Output is correct
19	Correct	1144 ms	61072 KB	Output is correct
20	Correct	1223 ms	62792 KB	Output is correct
21	Correct	1294 ms	62900 KB	Output is correct
22	Correct	1093 ms	69700 KB	Output is correct
23	Correct	69 ms	69700 KB	Output is correct
24	Correct	148 ms	69700 KB	Output is correct
25	Execution timed out	3074 ms	69700 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #4
0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5752 KB	Output is correct
2	Correct	8 ms	5868 KB	Output is correct
3	Correct	8 ms	5868 KB	Output is correct
4	Correct	7 ms	5868 KB	Output is correct
5	Correct	8 ms	5868 KB	Output is correct
6	Correct	8 ms	5924 KB	Output is correct
7	Correct	10 ms	6052 KB	Output is correct
8	Correct	8 ms	6076 KB	Output is correct
9	Correct	9 ms	6508 KB	Output is correct
10	Correct	10 ms	6508 KB	Output is correct
11	Correct	8 ms	6508 KB	Output is correct
12	Correct	10 ms	6508 KB	Output is correct
13	Correct	10 ms	6652 KB	Output is correct
14	Correct	9 ms	6652 KB	Output is correct
15	Correct	10 ms	6652 KB	Output is correct
16	Correct	11 ms	6652 KB	Output is correct
17	Correct	10 ms	6652 KB	Output is correct
18	Correct	10 ms	6652 KB	Output is correct
19	Correct	7 ms	6652 KB	Output is correct
20	Correct	6 ms	6652 KB	Output is correct
21	Correct	55 ms	8060 KB	Output is correct
22	Correct	8 ms	8060 KB	Output is correct
23	Correct	8 ms	8060 KB	Output is correct
24	Correct	9 ms	8060 KB	Output is correct
25	Correct	44 ms	8060 KB	Output is correct
26	Correct	7 ms	8060 KB	Output is correct
27	Correct	8 ms	8060 KB	Output is correct
28	Correct	10 ms	8060 KB	Output is correct
29	Correct	19 ms	8060 KB	Output is correct
30	Correct	13 ms	8060 KB	Output is correct
31	Correct	33 ms	8060 KB	Output is correct
32	Correct	31 ms	8060 KB	Output is correct
33	Correct	29 ms	8060 KB	Output is correct
34	Correct	9 ms	8060 KB	Output is correct
35	Correct	9 ms	8060 KB	Output is correct
36	Correct	10 ms	8060 KB	Output is correct
37	Correct	28 ms	8060 KB	Output is correct
38	Correct	34 ms	8060 KB	Output is correct
39	Correct	1144 ms	61072 KB	Output is correct
40	Correct	1223 ms	62792 KB	Output is correct
41	Correct	1294 ms	62900 KB	Output is correct
42	Correct	1093 ms	69700 KB	Output is correct
43	Correct	69 ms	69700 KB	Output is correct
44	Correct	148 ms	69700 KB	Output is correct
45	Execution timed out	3074 ms	69700 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

답안 #67998

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 22.0

Subtask #4
0 / 57.0