oj.uz

Submission #112470

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

typedef pair<int, int> pii;

const int MN = 100010;
const int SQ = 200;

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 8 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 7 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 8 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 7808 KB Output is correct
9 Correct 9 ms 7808 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 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 9 ms 7808 KB Output is correct
15 Correct 11 ms 7808 KB Output is correct
16 Correct 9 ms 7808 KB Output is correct
17 Correct 9 ms 7852 KB Output is correct
18 Correct 10 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 8 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 7 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 8 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 7808 KB Output is correct
9 Correct 9 ms 7808 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 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 9 ms 7808 KB Output is correct
15 Correct 11 ms 7808 KB Output is correct
16 Correct 9 ms 7808 KB Output is correct
17 Correct 9 ms 7852 KB Output is correct
18 Correct 10 ms 7808 KB Output is correct
19 Correct 9 ms 7808 KB Output is correct
20 Correct 51 ms 10160 KB Output is correct
21 Correct 51 ms 10232 KB Output is correct
22 Correct 54 ms 10104 KB Output is correct
23 Correct 53 ms 10232 KB Output is correct
24 Correct 158 ms 13560 KB Output is correct
25 Correct 147 ms 13560 KB Output is correct
26 Correct 154 ms 13304 KB Output is correct
27 Correct 132 ms 17656 KB Output is correct
28 Correct 134 ms 17660 KB Output is correct
29 Correct 123 ms 16248 KB Output is correct
30 Correct 130 ms 14368 KB Output is correct
31 Correct 155 ms 14236 KB Output is correct
32 Correct 127 ms 14072 KB Output is correct
33 Correct 133 ms 14844 KB Output is correct
34 Correct 141 ms 14288 KB Output is correct
35 Correct 136 ms 14616 KB Output is correct
36 Correct 132 ms 15128 KB Output is correct
37 Correct 137 ms 14456 KB Output is correct
38 Correct 117 ms 14512 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 7 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 8 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 7808 KB Output is correct
9 Correct 9 ms 7808 KB Output is correct
10 Correct 9 ms 7808 KB Output is correct
11 Correct 9 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 9 ms 7808 KB Output is correct
15 Correct 11 ms 7808 KB Output is correct
16 Correct 9 ms 7808 KB Output is correct
17 Correct 9 ms 7852 KB Output is correct
18 Correct 10 ms 7808 KB Output is correct
19 Correct 9 ms 7808 KB Output is correct
20 Correct 51 ms 10160 KB Output is correct
21 Correct 51 ms 10232 KB Output is correct
22 Correct 54 ms 10104 KB Output is correct
23 Correct 53 ms 10232 KB Output is correct
24 Correct 158 ms 13560 KB Output is correct
25 Correct 147 ms 13560 KB Output is correct
26 Correct 154 ms 13304 KB Output is correct
27 Correct 132 ms 17656 KB Output is correct
28 Correct 134 ms 17660 KB Output is correct
29 Correct 123 ms 16248 KB Output is correct
30 Correct 130 ms 14368 KB Output is correct
31 Correct 155 ms 14236 KB Output is correct
32 Correct 127 ms 14072 KB Output is correct
33 Correct 133 ms 14844 KB Output is correct
34 Correct 141 ms 14288 KB Output is correct
35 Correct 136 ms 14616 KB Output is correct
36 Correct 132 ms 15128 KB Output is correct
37 Correct 137 ms 14456 KB Output is correct
38 Correct 117 ms 14512 KB Output is correct
39 Correct 943 ms 135040 KB Output is correct
40 Correct 508 ms 69752 KB Output is correct
41 Correct 269 ms 30456 KB Output is correct
42 Correct 1409 ms 13560 KB Output is correct
43 Correct 285 ms 13432 KB Output is correct
44 Correct 612 ms 12180 KB Output is correct
45 Correct 549 ms 11892 KB Output is correct
46 Correct 509 ms 11772 KB Output is correct
47 Correct 122 ms 10488 KB Output is correct
48 Correct 59 ms 10360 KB Output is correct
49 Correct 1127 ms 224376 KB Output is correct
50 Correct 979 ms 225400 KB Output is correct
51 Correct 573 ms 12152 KB Output is correct
52 Correct 528 ms 11640 KB Output is correct
53 Correct 1037 ms 177272 KB Output is correct
54 Correct 1020 ms 165368 KB Output is correct
55 Correct 915 ms 175864 KB Output is correct
56 Correct 794 ms 139256 KB Output is correct
57 Correct 596 ms 12200 KB Output is correct
58 Correct 580 ms 12068 KB Output is correct
59 Correct 525 ms 11768 KB Output is correct
60 Correct 522 ms 11736 KB Output is correct
61 Correct 894 ms 17616 KB Output is correct
62 Correct 1387 ms 14548 KB Output is correct
63 Correct 1871 ms 13944 KB Output is correct
64 Execution timed out 2041 ms 17656 KB Time limit exceeded
65 Halted 0 ms 0 KB -