# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
983775 | 2024-05-16T05:36:07 Z | Amaarsaa | Bitaro’s Party (JOI18_bitaro) | C++14 | 2000 ms | 10368 KB |
#include<bits/stdc++.h> using namespace std; using ll = long long ; vector < ll > adj[100004]; int main() { // freopen("moocast.in", "r", stdin); // freopen("moocast.out", "w", stdout); ios::sync_with_stdio(false); cin.tie(NULL); ll t, n, m, ans, s, sum, x, y, r, p, i, j, Q; cin >> n >> m >> Q; for ( i = 1; i <= m; i ++) { cin >> x >> y; adj[y].push_back(x); } ll d[100004]; for (i = 1; i <= n; i ++) d[i] = 0; queue < ll > q; cin >> x; ll xx = x; q.push(x); d[x] = 0; while(!q.empty()) { x = q.front(); q.pop(); for ( ll X : adj[x]) { if ( d[X] < d[x] + 1) { d[X]= d[x] + 1; q.push(X); } } } cin >> m; for (i = 1; i <= m; i ++) { cin >> x; d[x]= -1; } ans = -1; for (i = 1; i <= n; i ++) { if ( d[i] == 0 && xx != i) d[i] = -1; ans = max(ans, d[i]); } cout << ans << endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3416 KB | Output is correct |
2 | Correct | 1 ms | 3416 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Correct | 2 ms | 3420 KB | Output is correct |
6 | Correct | 2 ms | 3420 KB | Output is correct |
7 | Correct | 1 ms | 3420 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 3 ms | 3420 KB | Output is correct |
10 | Correct | 2 ms | 3420 KB | Output is correct |
11 | Correct | 2 ms | 3416 KB | Output is correct |
12 | Correct | 1 ms | 3420 KB | Output is correct |
13 | Correct | 1 ms | 3420 KB | Output is correct |
14 | Correct | 2 ms | 3420 KB | Output is correct |
15 | Correct | 2 ms | 3416 KB | Output is correct |
16 | Correct | 2 ms | 3420 KB | Output is correct |
17 | Correct | 2 ms | 3420 KB | Output is correct |
18 | Correct | 2 ms | 3420 KB | Output is correct |
19 | Correct | 2 ms | 3420 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3416 KB | Output is correct |
2 | Correct | 1 ms | 3416 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Correct | 2 ms | 3420 KB | Output is correct |
6 | Correct | 2 ms | 3420 KB | Output is correct |
7 | Correct | 1 ms | 3420 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 3 ms | 3420 KB | Output is correct |
10 | Correct | 2 ms | 3420 KB | Output is correct |
11 | Correct | 2 ms | 3416 KB | Output is correct |
12 | Correct | 1 ms | 3420 KB | Output is correct |
13 | Correct | 1 ms | 3420 KB | Output is correct |
14 | Correct | 2 ms | 3420 KB | Output is correct |
15 | Correct | 2 ms | 3416 KB | Output is correct |
16 | Correct | 2 ms | 3420 KB | Output is correct |
17 | Correct | 2 ms | 3420 KB | Output is correct |
18 | Correct | 2 ms | 3420 KB | Output is correct |
19 | Correct | 2 ms | 3420 KB | Output is correct |
20 | Correct | 33 ms | 7596 KB | Output is correct |
21 | Correct | 28 ms | 7512 KB | Output is correct |
22 | Correct | 52 ms | 7772 KB | Output is correct |
23 | Correct | 25 ms | 7340 KB | Output is correct |
24 | Correct | 40 ms | 9536 KB | Output is correct |
25 | Correct | 50 ms | 9472 KB | Output is correct |
26 | Correct | 39 ms | 9556 KB | Output is correct |
27 | Execution timed out | 2092 ms | 10368 KB | Time limit exceeded |
28 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 3416 KB | Output is correct |
2 | Correct | 1 ms | 3416 KB | Output is correct |
3 | Correct | 1 ms | 3420 KB | Output is correct |
4 | Correct | 1 ms | 3420 KB | Output is correct |
5 | Correct | 2 ms | 3420 KB | Output is correct |
6 | Correct | 2 ms | 3420 KB | Output is correct |
7 | Correct | 1 ms | 3420 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 3 ms | 3420 KB | Output is correct |
10 | Correct | 2 ms | 3420 KB | Output is correct |
11 | Correct | 2 ms | 3416 KB | Output is correct |
12 | Correct | 1 ms | 3420 KB | Output is correct |
13 | Correct | 1 ms | 3420 KB | Output is correct |
14 | Correct | 2 ms | 3420 KB | Output is correct |
15 | Correct | 2 ms | 3416 KB | Output is correct |
16 | Correct | 2 ms | 3420 KB | Output is correct |
17 | Correct | 2 ms | 3420 KB | Output is correct |
18 | Correct | 2 ms | 3420 KB | Output is correct |
19 | Correct | 2 ms | 3420 KB | Output is correct |
20 | Correct | 33 ms | 7596 KB | Output is correct |
21 | Correct | 28 ms | 7512 KB | Output is correct |
22 | Correct | 52 ms | 7772 KB | Output is correct |
23 | Correct | 25 ms | 7340 KB | Output is correct |
24 | Correct | 40 ms | 9536 KB | Output is correct |
25 | Correct | 50 ms | 9472 KB | Output is correct |
26 | Correct | 39 ms | 9556 KB | Output is correct |
27 | Execution timed out | 2092 ms | 10368 KB | Time limit exceeded |
28 | Halted | 0 ms | 0 KB | - |