oj.uz

Submission #95916

# Submission time Handle Problem Language Result Execution time Memory
95916 2019-02-03T15:02:15 Z toonewbie Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1959 ms 309752 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define _CRT_SECURE_NO_WARNINGS
/****Author: Barish Namazov****/
#include <bits/stdc++.h>

using namespace std;

/***TEMPLATE***/
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

#define F first
#define S second
#define pb push_back

#define endl '\n'

const int max4 = 10004;
const int maxx = 200005;
const int max6 = 1000006;
const int lg5 = 17;

const int INF = 2 * 1000000007;
const long long INFLL = 4LL * 1000000000 * 1000000000;

/***************/

int powmod (int a, int b, int mod) {
    int res = 1; a %= mod;
    for (; b; b >>= 1) {
        if (b & 1) {
            res = 1LL * res * a % mod;
        }
        a = 1LL * a * a % mod;
    }
    return res;
}

int gcd (int a, int b) {
    while (b > 0) {
        int t = a % b;
        a = b, b = t;
    }
    return a;
}

int lcm (int a, int b) {
    return (a / gcd (a, b)) * b;
}

int is_prime (int n) {
    if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))
        return 0;
    for (int i = 5, t = 2; i * i <= n; i += t, t = 6 - t)
        if (n % i == 0)
            return 0;
    return 1;
}

/******Don't forget to use long long when needed!!******/

const int Block = 220;

int n, m, q;
vector <int> g[maxx];

vector <pair <int, int>> dp[maxx]; int res[maxx];
inline void update(int u, int v) {
    for (auto i : dp[u]) {
        res[i.S] = i.F;
    }
    for (auto i : dp[v]) {
        res[i.S] = max(res[i.S], i.F + 1);
    }
    for (auto &i : dp[u]) {
        i.F = max(i.F, res[i.S]); res[i.S] = 0;
    }
    for (auto i : dp[v]) {
        if (res[i.S] > 0) {
            dp[u].pb({i.F + 1, i.S}); res[i.S] = 0;
        }
    } sort(rall(dp[u]));
    /*
    vector <pair <int, int>> A, B;
    for (auto i : dp[u]) B.pb(i);
    for (auto i : dp[v]) {
        if (res[i.S] > 0) {
            A.pb({i.F + 1, i.S}); res[i.S] = 0;
        }
    } //sort(rall(A)); sort(rall(B));
    while (!dp[u].empty()) dp[u].pop_back();
    int ptr1 = 0, ptr2 = 0;
    while (ptr1 < A.size() && ptr2 < B.size()) {
        if (A[ptr1] > B[ptr2]) {
            dp[u].pb(A[ptr1++]);
        } else {
            dp[u].pb(B[ptr2++]);
        }
    }
    while (ptr1 < A.size()) dp[u].pb(A[ptr1++]);
    while (ptr2 < B.size()) dp[u].pb(B[ptr2++]);*/

    while (dp[u].size() > Block) {
        dp[u].pop_back();
    }
}

int has[maxx], lpath[maxx];
int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base :: sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m >> q;
    int a, b;
    for (int i = 1; i <= m; i++) {
        cin >> a >> b;
        g[b].pb(a);
    }
    for (int i = 1; i <= n; i++) {
        for (int j : g[i]) {
            update(i, j);
        }
        if (dp[i].size() < Block) {
            dp[i].pb({0, i});
        }
    }
    vector <int> bad; int tmp;
    int t, y;
    while (q --) {
        cin >> t >> y;
        for (int i = 0; i < y; i++) {
            cin >> tmp;
            bad.pb(tmp); has[tmp] = 1;
        }
        if (y < Block) {
            int res = -1;
            for (auto i : dp[t]) {
                if (has[i.S] == 0) {
                    res = i.F; break;
                }
            }
            cout << res << endl;
        } else {
            for (int i = 1; i <= t; i++) {
                lpath[i] = -has[i];
                for (int j : g[i]) {
                    if (lpath[j] != -1) {
                        lpath[i] = max(lpath[i], lpath[j] + 1);
                    }
                }
            }
            cout << lpath[t] << endl;
        }
        for (int i = 0; i < y; i++) {
            has[bad[i]] = 0;
        }
        bad.clear();
    }
    return 0;
}

Compilation message

bitaro.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
bitaro.cpp: In function 'int is_prime(int)':
bitaro.cpp:55:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))
                   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 13 ms 10232 KB Output is correct
8 Correct 20 ms 11640 KB Output is correct
9 Correct 20 ms 11640 KB Output is correct
10 Correct 19 ms 11640 KB Output is correct
11 Correct 20 ms 11512 KB Output is correct
12 Correct 19 ms 10872 KB Output is correct
13 Correct 20 ms 11512 KB Output is correct
14 Correct 19 ms 10872 KB Output is correct
15 Correct 18 ms 10616 KB Output is correct
16 Correct 19 ms 10872 KB Output is correct
17 Correct 20 ms 11000 KB Output is correct
18 Correct 19 ms 10744 KB Output is correct
19 Correct 20 ms 11128 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 13 ms 10232 KB Output is correct
8 Correct 20 ms 11640 KB Output is correct
9 Correct 20 ms 11640 KB Output is correct
10 Correct 19 ms 11640 KB Output is correct
11 Correct 20 ms 11512 KB Output is correct
12 Correct 19 ms 10872 KB Output is correct
13 Correct 20 ms 11512 KB Output is correct
14 Correct 19 ms 10872 KB Output is correct
15 Correct 18 ms 10616 KB Output is correct
16 Correct 19 ms 10872 KB Output is correct
17 Correct 20 ms 11000 KB Output is correct
18 Correct 19 ms 10744 KB Output is correct
19 Correct 20 ms 11128 KB Output is correct
20 Correct 533 ms 12792 KB Output is correct
21 Correct 508 ms 12792 KB Output is correct
22 Correct 621 ms 12804 KB Output is correct
23 Correct 555 ms 12792 KB Output is correct
24 Correct 1674 ms 211324 KB Output is correct
25 Correct 1716 ms 218028 KB Output is correct
26 Correct 1679 ms 218380 KB Output is correct
27 Correct 987 ms 215664 KB Output is correct
28 Correct 984 ms 215804 KB Output is correct
29 Correct 988 ms 215652 KB Output is correct
30 Correct 1035 ms 215544 KB Output is correct
31 Correct 1642 ms 274712 KB Output is correct
32 Correct 1104 ms 215164 KB Output is correct
33 Correct 1004 ms 140308 KB Output is correct
34 Correct 1381 ms 167036 KB Output is correct
35 Correct 1012 ms 139612 KB Output is correct
36 Correct 1077 ms 177464 KB Output is correct
37 Correct 1753 ms 231752 KB Output is correct
38 Correct 1112 ms 177504 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 10 ms 9720 KB Output is correct
3 Correct 10 ms 9720 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 13 ms 10232 KB Output is correct
8 Correct 20 ms 11640 KB Output is correct
9 Correct 20 ms 11640 KB Output is correct
10 Correct 19 ms 11640 KB Output is correct
11 Correct 20 ms 11512 KB Output is correct
12 Correct 19 ms 10872 KB Output is correct
13 Correct 20 ms 11512 KB Output is correct
14 Correct 19 ms 10872 KB Output is correct
15 Correct 18 ms 10616 KB Output is correct
16 Correct 19 ms 10872 KB Output is correct
17 Correct 20 ms 11000 KB Output is correct
18 Correct 19 ms 10744 KB Output is correct
19 Correct 20 ms 11128 KB Output is correct
20 Correct 533 ms 12792 KB Output is correct
21 Correct 508 ms 12792 KB Output is correct
22 Correct 621 ms 12804 KB Output is correct
23 Correct 555 ms 12792 KB Output is correct
24 Correct 1674 ms 211324 KB Output is correct
25 Correct 1716 ms 218028 KB Output is correct
26 Correct 1679 ms 218380 KB Output is correct
27 Correct 987 ms 215664 KB Output is correct
28 Correct 984 ms 215804 KB Output is correct
29 Correct 988 ms 215652 KB Output is correct
30 Correct 1035 ms 215544 KB Output is correct
31 Correct 1642 ms 274712 KB Output is correct
32 Correct 1104 ms 215164 KB Output is correct
33 Correct 1004 ms 140308 KB Output is correct
34 Correct 1381 ms 167036 KB Output is correct
35 Correct 1012 ms 139612 KB Output is correct
36 Correct 1077 ms 177464 KB Output is correct
37 Correct 1753 ms 231752 KB Output is correct
38 Correct 1112 ms 177504 KB Output is correct
39 Correct 1943 ms 214020 KB Output is correct
40 Correct 1783 ms 216548 KB Output is correct
41 Correct 1799 ms 217976 KB Output is correct
42 Correct 1840 ms 218496 KB Output is correct
43 Correct 1870 ms 217852 KB Output is correct
44 Correct 557 ms 15472 KB Output is correct
45 Correct 584 ms 14700 KB Output is correct
46 Correct 516 ms 14600 KB Output is correct
47 Correct 563 ms 14408 KB Output is correct
48 Correct 533 ms 14276 KB Output is correct
49 Correct 1152 ms 218540 KB Output is correct
50 Correct 1133 ms 217320 KB Output is correct
51 Correct 552 ms 15388 KB Output is correct
52 Correct 521 ms 14480 KB Output is correct
53 Correct 1210 ms 179440 KB Output is correct
54 Correct 1794 ms 234384 KB Output is correct
55 Correct 1153 ms 178284 KB Output is correct
56 Correct 1740 ms 236548 KB Output is correct
57 Correct 545 ms 15340 KB Output is correct
58 Correct 551 ms 15360 KB Output is correct
59 Correct 527 ms 14456 KB Output is correct
60 Correct 532 ms 14688 KB Output is correct
61 Correct 1204 ms 217724 KB Output is correct
62 Correct 1221 ms 179536 KB Output is correct
63 Correct 1820 ms 230392 KB Output is correct
64 Correct 1346 ms 217692 KB Output is correct
65 Correct 1351 ms 179068 KB Output is correct
66 Correct 1959 ms 240216 KB Output is correct
67 Correct 1075 ms 217700 KB Output is correct
68 Correct 1133 ms 179492 KB Output is correct
69 Correct 1818 ms 228280 KB Output is correct
70 Correct 1048 ms 218104 KB Output is correct
71 Correct 1133 ms 179452 KB Output is correct
72 Correct 1722 ms 232960 KB Output is correct
73 Correct 1061 ms 217928 KB Output is correct
74 Correct 1107 ms 179444 KB Output is correct
75 Correct 1619 ms 229668 KB Output is correct
76 Correct 1156 ms 219256 KB Output is correct
77 Correct 1120 ms 218256 KB Output is correct
78 Correct 1069 ms 218616 KB Output is correct
79 Correct 539 ms 15652 KB Output is correct
80 Correct 521 ms 14560 KB Output is correct
81 Correct 515 ms 14200 KB Output is correct
82 Correct 1138 ms 219152 KB Output is correct
83 Correct 1595 ms 281592 KB Output is correct
84 Correct 1090 ms 218076 KB Output is correct
85 Correct 1625 ms 309752 KB Output is correct
86 Correct 1109 ms 218460 KB Output is correct
87 Correct 1688 ms 294592 KB Output is correct
88 Correct 552 ms 15656 KB Output is correct
89 Correct 561 ms 15608 KB Output is correct
90 Correct 522 ms 14596 KB Output is correct
91 Correct 554 ms 14712 KB Output is correct
92 Correct 519 ms 14300 KB Output is correct
93 Correct 512 ms 14200 KB Output is correct
94 Correct 1099 ms 144300 KB Output is correct
95 Correct 1587 ms 174404 KB Output is correct
96 Correct 1043 ms 142840 KB Output is correct
97 Correct 1520 ms 176756 KB Output is correct
98 Correct 996 ms 143736 KB Output is correct
99 Correct 1365 ms 174328 KB Output is correct
100 Correct 579 ms 15560 KB Output is correct
101 Correct 581 ms 15684 KB Output is correct
102 Correct 563 ms 14712 KB Output is correct
103 Correct 585 ms 14636 KB Output is correct
104 Correct 572 ms 14412 KB Output is correct
105 Correct 563 ms 14288 KB Output is correct
106 Correct 1204 ms 180104 KB Output is correct
107 Correct 1832 ms 239408 KB Output is correct
108 Correct 1181 ms 180180 KB Output is correct
109 Correct 1666 ms 222008 KB Output is correct
110 Correct 1215 ms 180892 KB Output is correct
111 Correct 1734 ms 237688 KB Output is correct
112 Correct 568 ms 15608 KB Output is correct
113 Correct 540 ms 15608 KB Output is correct
114 Correct 525 ms 14584 KB Output is correct
115 Correct 523 ms 14528 KB Output is correct
116 Correct 511 ms 14176 KB Output is correct
117 Correct 517 ms 14328 KB Output is correct
118 Correct 1055 ms 217484 KB Output is correct
119 Correct 1323 ms 179332 KB Output is correct
120 Correct 1806 ms 232984 KB Output is correct
121 Correct 1106 ms 217340 KB Output is correct
122 Correct 1104 ms 178476 KB Output is correct
123 Correct 1670 ms 231080 KB Output is correct
124 Correct 1082 ms 217316 KB Output is correct
125 Correct 1120 ms 179616 KB Output is correct
126 Correct 1680 ms 228684 KB Output is correct