oj.uz

답안 #334323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334323 2020-12-09T03:02:58 Z maitandat03 Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 96 ms 10988 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pli = pair< long long, int >;
using pii = pair< int, int >;

struct query {
    int t, y, i;
    vector< int > c;
};

const int N = 1e5 + 7;
int n, m, Q, res;
vector< int > g[N];
query q[N];
int d[N];
bool notvisit[N];


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

//    freopen("BITARO.inp", "r", stdin);
//    freopen("BITARO.out", "w", stdout);

    cin >> n >> m >> Q;
    for (int i = 1; i <= m; ++i) {
        int u, v;
        cin >> u >> v;
        g[v].push_back(u);
    }
    for (int i = 1; i <= Q; ++i) {
        int tmp;
        cin >> q[i].t >> q[i].y;
        for (int j = 1; j <= q[i].y; ++j) {
            cin >> tmp;
//            if (tmp <= q[i].t)
//                q[i].c.push_back(tmp);
            notvisit[tmp] = true;
        }
        q[i].i = i;
    }

    d[ q[1].t ] = 1;
    for (int u = q[1].t; u; --u) {
        if (!d[u]) continue;
        for (int v : g[u])
            d[v] = max(d[v], d[u] + 1);
        if (!notvisit[u])
            res = max(res, d[u]);
    }
    --res;
    if (!res && notvisit[ q[1].t ])
        res = -1;
    cout << res;



    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6636 KB Output is correct
2 Correct 5 ms 6636 KB Output is correct
3 Correct 5 ms 6636 KB Output is correct
4 Correct 5 ms 6636 KB Output is correct
5 Correct 5 ms 6636 KB Output is correct
6 Correct 5 ms 6636 KB Output is correct
7 Correct 5 ms 6636 KB Output is correct
8 Correct 6 ms 6636 KB Output is correct
9 Correct 5 ms 6636 KB Output is correct
10 Correct 6 ms 6636 KB Output is correct
11 Correct 7 ms 6636 KB Output is correct
12 Correct 5 ms 6636 KB Output is correct
13 Correct 5 ms 6636 KB Output is correct
14 Correct 5 ms 6636 KB Output is correct
15 Correct 5 ms 6636 KB Output is correct
16 Correct 5 ms 6564 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 5 ms 6656 KB Output is correct
19 Correct 5 ms 6636 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6636 KB Output is correct
2 Correct 5 ms 6636 KB Output is correct
3 Correct 5 ms 6636 KB Output is correct
4 Correct 5 ms 6636 KB Output is correct
5 Correct 5 ms 6636 KB Output is correct
6 Correct 5 ms 6636 KB Output is correct
7 Correct 5 ms 6636 KB Output is correct
8 Correct 6 ms 6636 KB Output is correct
9 Correct 5 ms 6636 KB Output is correct
10 Correct 6 ms 6636 KB Output is correct
11 Correct 7 ms 6636 KB Output is correct
12 Correct 5 ms 6636 KB Output is correct
13 Correct 5 ms 6636 KB Output is correct
14 Correct 5 ms 6636 KB Output is correct
15 Correct 5 ms 6636 KB Output is correct
16 Correct 5 ms 6564 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 5 ms 6656 KB Output is correct
19 Correct 5 ms 6636 KB Output is correct
20 Correct 39 ms 9324 KB Output is correct
21 Correct 38 ms 8556 KB Output is correct
22 Correct 39 ms 8600 KB Output is correct
23 Correct 38 ms 8556 KB Output is correct
24 Correct 73 ms 10220 KB Output is correct
25 Correct 77 ms 10220 KB Output is correct
26 Correct 80 ms 10220 KB Output is correct
27 Correct 75 ms 10844 KB Output is correct
28 Correct 70 ms 10860 KB Output is correct
29 Correct 69 ms 10988 KB Output is correct
30 Correct 70 ms 10732 KB Output is correct
31 Correct 71 ms 10988 KB Output is correct
32 Correct 89 ms 10732 KB Output is correct
33 Correct 65 ms 10148 KB Output is correct
34 Correct 65 ms 10300 KB Output is correct
35 Correct 64 ms 10220 KB Output is correct
36 Correct 69 ms 10348 KB Output is correct
37 Correct 72 ms 10604 KB Output is correct
38 Correct 73 ms 10604 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 6636 KB Output is correct
2 Correct 5 ms 6636 KB Output is correct
3 Correct 5 ms 6636 KB Output is correct
4 Correct 5 ms 6636 KB Output is correct
5 Correct 5 ms 6636 KB Output is correct
6 Correct 5 ms 6636 KB Output is correct
7 Correct 5 ms 6636 KB Output is correct
8 Correct 6 ms 6636 KB Output is correct
9 Correct 5 ms 6636 KB Output is correct
10 Correct 6 ms 6636 KB Output is correct
11 Correct 7 ms 6636 KB Output is correct
12 Correct 5 ms 6636 KB Output is correct
13 Correct 5 ms 6636 KB Output is correct
14 Correct 5 ms 6636 KB Output is correct
15 Correct 5 ms 6636 KB Output is correct
16 Correct 5 ms 6564 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 5 ms 6656 KB Output is correct
19 Correct 5 ms 6636 KB Output is correct
20 Correct 39 ms 9324 KB Output is correct
21 Correct 38 ms 8556 KB Output is correct
22 Correct 39 ms 8600 KB Output is correct
23 Correct 38 ms 8556 KB Output is correct
24 Correct 73 ms 10220 KB Output is correct
25 Correct 77 ms 10220 KB Output is correct
26 Correct 80 ms 10220 KB Output is correct
27 Correct 75 ms 10844 KB Output is correct
28 Correct 70 ms 10860 KB Output is correct
29 Correct 69 ms 10988 KB Output is correct
30 Correct 70 ms 10732 KB Output is correct
31 Correct 71 ms 10988 KB Output is correct
32 Correct 89 ms 10732 KB Output is correct
33 Correct 65 ms 10148 KB Output is correct
34 Correct 65 ms 10300 KB Output is correct
35 Correct 64 ms 10220 KB Output is correct
36 Correct 69 ms 10348 KB Output is correct
37 Correct 72 ms 10604 KB Output is correct
38 Correct 73 ms 10604 KB Output is correct
39 Incorrect 96 ms 10604 KB Output isn't correct
40 Halted 0 ms 0 KB -