oj.uz

Submission #112468

# Submission time Handle Problem Language Result Execution time Memory
112468 2019-05-20T06:19:50 Z choikiwon Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 427800 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int MN = 100010;
const int SQ = 300;

int N, M, Q;
vector<int> adj[MN], radj[MN];
int chk[MN], used[MN];

vector<pii> mrg(vector<pii> &a, vector<pii> &b) {
    vector<pii> ret;

    int pos1 = 0, pos2 = 0;
    while(ret.size() < SQ && pos1 < a.size() && pos2 < b.size()) {
        if(used[ a[pos1].second ]) {
            pos1++;
            continue;
        }
        if(used[ b[pos2].second ]) {
            pos2++;
            continue;
        }

        if(a[pos1].first > b[pos2].first + 1) ret.push_back(a[pos1]), used[ a[pos1].second ] = 1, pos1++;
        else ret.push_back(pii(b[pos2].first + 1, b[pos2].second)), used[ b[pos2].second ] = 1, pos2++;
    }
    while(ret.size() < SQ && pos1 < a.size()) {
        if(used[ a[pos1].second ]) {
            pos1++;
            continue;
        }
        ret.push_back(a[pos1]), used[ a[pos1].second ] = 1, pos1++;
    }
    while(ret.size() < SQ && pos2 < b.size()) {
        if(used[ b[pos2].second ]) {
            pos2++;
            continue;
        }
        ret.push_back(pii(b[pos2].first + 1, b[pos2].second)), used[ b[pos2].second ] = 1, pos2++;
    }

    for(int i = 0; i < ret.size(); i++) used[ ret[i].second ] = 0;
    return ret;
}

vector<pii> cc1[MN];
vector<pii> dp1(int u) {
    vector<pii> &ret = cc1[u];
    if(ret.size()) return ret;

    ret.push_back({0, u});

    for(int i = 0; i < radj[u].size(); i++) {
        int v = radj[u][i];
        vector<pii> tmp = dp1(v);
        ret = mrg(ret, tmp);
    }

    return ret;
}

int X;
int cc2[MN];
int dp2(int u) {
    int &ret = cc2[u];
    if(ret != -1) return ret;
    if(u == X) return ret = 0;

    ret = -1e9;
    for(int i = 0; i < adj[u].size(); i++) {
        int v = adj[u][i];
        ret = max(ret, dp2(v) + 1);
    }
    return ret;
}

int main() {
    scanf("%d %d %d", &N, &M, &Q);

    for(int i = 0; i < M; i++) {
        int u, v; scanf("%d %d", &u, &v);
        u--; v--;

        adj[u].push_back(v);
        radj[v].push_back(u);
    }

    for(int i = 0; i < Q; i++) {
        int t, y; scanf("%d %d", &t, &y);
        t--;

        vector<int> c(y);
        for(int j = 0; j < y; j++) {
            scanf("%d", &c[j]);
            chk[ --c[j] ] = 1;
        }

        if(y > SQ) {
            memset(cc2, -1, sizeof(cc2));
            X = t;

            int ans = -1;
            for(int j = 0; j < N; j++) if(!chk[j]) ans = max(ans, dp2(j));
            printf("%d\n", ans);
        }
        else {
            vector<pii> tmp = dp1(t);

            int ans = -1;
            for(int j = 0; j < tmp.size(); j++) if(!chk[ tmp[j].second ]) {
                ans = tmp[j].first;
                break;
            }

            printf("%d\n", ans);
        }

        for(int j = 0; j < y; j++) chk[ c[j] ] = 0;
    }
}

Compilation message

bitaro.cpp: In function 'std::vector<std::pair<int, int> > mrg(std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)':
bitaro.cpp:17:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() < SQ && pos1 < a.size() && pos2 < b.size()) {
                              ~~~~~^~~~~~~~~~
bitaro.cpp:17:54: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() < SQ && pos1 < a.size() && pos2 < b.size()) {
                                                 ~~~~~^~~~~~~~~~
bitaro.cpp:30:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() < SQ && pos1 < a.size()) {
                              ~~~~~^~~~~~~~~~
bitaro.cpp:37:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.size() < SQ && pos2 < b.size()) {
                              ~~~~~^~~~~~~~~~
bitaro.cpp:45:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < ret.size(); i++) used[ ret[i].second ] = 0;
                    ~~^~~~~~~~~~~~
bitaro.cpp: In function 'std::vector<std::pair<int, int> > dp1(int)':
bitaro.cpp:56:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < radj[u].size(); i++) {
                    ~~^~~~~~~~~~~~~~~~
bitaro.cpp: In function 'int dp2(int)':
bitaro.cpp:73:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < adj[u].size(); i++) {
                    ~~^~~~~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:113:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0; j < tmp.size(); j++) if(!chk[ tmp[j].second ]) {
                            ~~^~~~~~~~~~~~
bitaro.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &N, &M, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:84:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int u, v; scanf("%d %d", &u, &v);
                   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:92:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int t, y; scanf("%d %d", &t, &y);
                   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:97:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &c[j]);
             ~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7808 KB Output is correct
6 Correct 9 ms 7808 KB Output is correct
7 Correct 9 ms 7808 KB Output is correct
8 Correct 9 ms 7936 KB Output is correct
9 Correct 9 ms 7936 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 19 ms 7808 KB Output is correct
12 Correct 9 ms 7808 KB Output is correct
13 Correct 9 ms 7808 KB Output is correct
14 Correct 12 ms 7808 KB Output is correct
15 Correct 10 ms 7808 KB Output is correct
16 Correct 10 ms 7808 KB Output is correct
17 Correct 9 ms 7808 KB Output is correct
18 Correct 8 ms 7808 KB Output is correct
19 Correct 9 ms 7808 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7808 KB Output is correct
6 Correct 9 ms 7808 KB Output is correct
7 Correct 9 ms 7808 KB Output is correct
8 Correct 9 ms 7936 KB Output is correct
9 Correct 9 ms 7936 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 19 ms 7808 KB Output is correct
12 Correct 9 ms 7808 KB Output is correct
13 Correct 9 ms 7808 KB Output is correct
14 Correct 12 ms 7808 KB Output is correct
15 Correct 10 ms 7808 KB Output is correct
16 Correct 10 ms 7808 KB Output is correct
17 Correct 9 ms 7808 KB Output is correct
18 Correct 8 ms 7808 KB Output is correct
19 Correct 9 ms 7808 KB Output is correct
20 Correct 54 ms 10108 KB Output is correct
21 Correct 55 ms 10160 KB Output is correct
22 Correct 50 ms 10104 KB Output is correct
23 Correct 51 ms 10232 KB Output is correct
24 Correct 154 ms 13560 KB Output is correct
25 Correct 171 ms 13616 KB Output is correct
26 Correct 167 ms 13372 KB Output is correct
27 Correct 138 ms 17752 KB Output is correct
28 Correct 149 ms 17772 KB Output is correct
29 Correct 128 ms 16248 KB Output is correct
30 Correct 142 ms 14328 KB Output is correct
31 Correct 161 ms 14528 KB Output is correct
32 Correct 135 ms 14200 KB Output is correct
33 Correct 145 ms 14772 KB Output is correct
34 Correct 141 ms 14200 KB Output is correct
35 Correct 137 ms 14712 KB Output is correct
36 Correct 138 ms 14968 KB Output is correct
37 Correct 141 ms 14380 KB Output is correct
38 Correct 121 ms 14516 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7296 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 8 ms 7424 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7808 KB Output is correct
6 Correct 9 ms 7808 KB Output is correct
7 Correct 9 ms 7808 KB Output is correct
8 Correct 9 ms 7936 KB Output is correct
9 Correct 9 ms 7936 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 19 ms 7808 KB Output is correct
12 Correct 9 ms 7808 KB Output is correct
13 Correct 9 ms 7808 KB Output is correct
14 Correct 12 ms 7808 KB Output is correct
15 Correct 10 ms 7808 KB Output is correct
16 Correct 10 ms 7808 KB Output is correct
17 Correct 9 ms 7808 KB Output is correct
18 Correct 8 ms 7808 KB Output is correct
19 Correct 9 ms 7808 KB Output is correct
20 Correct 54 ms 10108 KB Output is correct
21 Correct 55 ms 10160 KB Output is correct
22 Correct 50 ms 10104 KB Output is correct
23 Correct 51 ms 10232 KB Output is correct
24 Correct 154 ms 13560 KB Output is correct
25 Correct 171 ms 13616 KB Output is correct
26 Correct 167 ms 13372 KB Output is correct
27 Correct 138 ms 17752 KB Output is correct
28 Correct 149 ms 17772 KB Output is correct
29 Correct 128 ms 16248 KB Output is correct
30 Correct 142 ms 14328 KB Output is correct
31 Correct 161 ms 14528 KB Output is correct
32 Correct 135 ms 14200 KB Output is correct
33 Correct 145 ms 14772 KB Output is correct
34 Correct 141 ms 14200 KB Output is correct
35 Correct 137 ms 14712 KB Output is correct
36 Correct 138 ms 14968 KB Output is correct
37 Correct 141 ms 14380 KB Output is correct
38 Correct 121 ms 14516 KB Output is correct
39 Correct 1232 ms 220900 KB Output is correct
40 Correct 602 ms 103916 KB Output is correct
41 Correct 322 ms 38024 KB Output is correct
42 Correct 1627 ms 13304 KB Output is correct
43 Correct 317 ms 13400 KB Output is correct
44 Correct 837 ms 13436 KB Output is correct
45 Correct 691 ms 15096 KB Output is correct
46 Correct 680 ms 15080 KB Output is correct
47 Correct 122 ms 11896 KB Output is correct
48 Correct 60 ms 11640 KB Output is correct
49 Correct 1589 ms 427692 KB Output is correct
50 Correct 1372 ms 427800 KB Output is correct
51 Correct 735 ms 15864 KB Output is correct
52 Correct 677 ms 14948 KB Output is correct
53 Correct 1398 ms 339228 KB Output is correct
54 Correct 1370 ms 309004 KB Output is correct
55 Correct 1313 ms 336600 KB Output is correct
56 Correct 1051 ms 257224 KB Output is correct
57 Correct 735 ms 15788 KB Output is correct
58 Correct 763 ms 15692 KB Output is correct
59 Correct 694 ms 14848 KB Output is correct
60 Correct 718 ms 14968 KB Output is correct
61 Correct 1195 ms 20372 KB Output is correct
62 Correct 1664 ms 17144 KB Output is correct
63 Correct 1854 ms 16688 KB Output is correct
64 Execution timed out 2041 ms 355736 KB Time limit exceeded
65 Halted 0 ms 0 KB -