oj.uz

Submission #61423

# Submission time Handle Problem Language Result Execution time Memory
61423 2018-07-25T22:57:12 Z Benq Bitaro’s Party (JOI18_bitaro) C++11
100 / 100
 1972 ms 411048 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

const int BLOCK = 300;

int N,M,Q, BES[MX];
vpi bes[MX];
bitset<MX> bad;
vi in[MX];

vpi merge(const vpi& a, const vpi& b) {
    vpi c;
    int i0 = 0, i1 = 0;
    while (sz(c) < BLOCK) {
        if (i0 < sz(a)) {
            if (i1 < sz(b)) {
                if (a[i0] > b[i1]) {
                    if (!bad[a[i0].s]) bad[a[i0].s] = 1, c.pb(a[i0]);
                    i0 ++;
                } else {
                    if (!bad[b[i1].s]) bad[b[i1].s] = 1, c.pb(b[i1]);
                    i1 ++;
                }
            } else {
                if (!bad[a[i0].s]) bad[a[i0].s] = 1, c.pb(a[i0]);
                i0 ++;
            }
        } else {
            if (i1 < sz(b)) {
                if (!bad[b[i1].s]) bad[b[i1].s] = 1, c.pb(b[i1]);
                i1 ++;
            } else {
                break;
            }
            
        }
    }
    for (auto x: c) bad[x.s] = 0;
    return c;
}

void gen(int x) {
    bes[x].pb({0,x});
    for (int i: in[x]) {
        vpi v = bes[i]; for (auto& a: v) a.f ++;
        bes[x] = merge(bes[x],v);
    }
}

void input() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> Q;
    F0R(i,M) {
        int S,E; cin >> S >> E;
        in[E].pb(S);
    }
    FOR(i,1,N+1) gen(i);
}

void GEN(int x) {
    if (bad[x]) BES[x] = -MOD;
    else BES[x] = 0;
    for (int i: in[x]) BES[x] = max(BES[x],BES[i]+1);
}

int smart(int T) {
    for (auto a: bes[T]) if (!bad[a.s]) return a.f;
    return -1;
}

int brute(int T) {
    FOR(i,1,T+1) GEN(i);
    return max(BES[T],-1);
}

int main() {
    input();
    F0R(i,Q) {
        int T,Y; cin >> T >> Y;
        vi v(Y); F0R(j,Y) cin >> v[j];
        for (int i: v) bad[i] = 1;
        // cout << brute(T) << "\n";
        if (Y >= BLOCK) cout << brute(T) << "\n";
        else cout << smart(T) << "\n";
        for (int i: v) bad[i] = 0;
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5084 KB Output is correct
2 Correct 7 ms 5244 KB Output is correct
3 Correct 7 ms 5244 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 11 ms 5660 KB Output is correct
6 Correct 11 ms 5664 KB Output is correct
7 Correct 11 ms 5664 KB Output is correct
8 Correct 20 ms 8632 KB Output is correct
9 Correct 24 ms 8784 KB Output is correct
10 Correct 21 ms 8784 KB Output is correct
11 Correct 21 ms 8784 KB Output is correct
12 Correct 15 ms 8784 KB Output is correct
13 Correct 20 ms 8784 KB Output is correct
14 Correct 18 ms 8784 KB Output is correct
15 Correct 14 ms 8784 KB Output is correct
16 Correct 15 ms 8784 KB Output is correct
17 Correct 17 ms 8784 KB Output is correct
18 Correct 15 ms 8784 KB Output is correct
19 Correct 19 ms 8784 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5084 KB Output is correct
2 Correct 7 ms 5244 KB Output is correct
3 Correct 7 ms 5244 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 11 ms 5660 KB Output is correct
6 Correct 11 ms 5664 KB Output is correct
7 Correct 11 ms 5664 KB Output is correct
8 Correct 20 ms 8632 KB Output is correct
9 Correct 24 ms 8784 KB Output is correct
10 Correct 21 ms 8784 KB Output is correct
11 Correct 21 ms 8784 KB Output is correct
12 Correct 15 ms 8784 KB Output is correct
13 Correct 20 ms 8784 KB Output is correct
14 Correct 18 ms 8784 KB Output is correct
15 Correct 14 ms 8784 KB Output is correct
16 Correct 15 ms 8784 KB Output is correct
17 Correct 17 ms 8784 KB Output is correct
18 Correct 15 ms 8784 KB Output is correct
19 Correct 19 ms 8784 KB Output is correct
20 Correct 995 ms 9716 KB Output is correct
21 Correct 943 ms 9792 KB Output is correct
22 Correct 1029 ms 9792 KB Output is correct
23 Correct 1040 ms 10012 KB Output is correct
24 Correct 1448 ms 252956 KB Output is correct
25 Correct 1478 ms 264364 KB Output is correct
26 Correct 1616 ms 264364 KB Output is correct
27 Correct 1576 ms 410988 KB Output is correct
28 Correct 1604 ms 410988 KB Output is correct
29 Correct 1600 ms 411048 KB Output is correct
30 Correct 1528 ms 411048 KB Output is correct
31 Correct 1595 ms 411048 KB Output is correct
32 Correct 1386 ms 411048 KB Output is correct
33 Correct 1119 ms 411048 KB Output is correct
34 Correct 926 ms 411048 KB Output is correct
35 Correct 1174 ms 411048 KB Output is correct
36 Correct 1395 ms 411048 KB Output is correct
37 Correct 1325 ms 411048 KB Output is correct
38 Correct 1331 ms 411048 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5084 KB Output is correct
2 Correct 7 ms 5244 KB Output is correct
3 Correct 7 ms 5244 KB Output is correct
4 Correct 6 ms 5244 KB Output is correct
5 Correct 11 ms 5660 KB Output is correct
6 Correct 11 ms 5664 KB Output is correct
7 Correct 11 ms 5664 KB Output is correct
8 Correct 20 ms 8632 KB Output is correct
9 Correct 24 ms 8784 KB Output is correct
10 Correct 21 ms 8784 KB Output is correct
11 Correct 21 ms 8784 KB Output is correct
12 Correct 15 ms 8784 KB Output is correct
13 Correct 20 ms 8784 KB Output is correct
14 Correct 18 ms 8784 KB Output is correct
15 Correct 14 ms 8784 KB Output is correct
16 Correct 15 ms 8784 KB Output is correct
17 Correct 17 ms 8784 KB Output is correct
18 Correct 15 ms 8784 KB Output is correct
19 Correct 19 ms 8784 KB Output is correct
20 Correct 995 ms 9716 KB Output is correct
21 Correct 943 ms 9792 KB Output is correct
22 Correct 1029 ms 9792 KB Output is correct
23 Correct 1040 ms 10012 KB Output is correct
24 Correct 1448 ms 252956 KB Output is correct
25 Correct 1478 ms 264364 KB Output is correct
26 Correct 1616 ms 264364 KB Output is correct
27 Correct 1576 ms 410988 KB Output is correct
28 Correct 1604 ms 410988 KB Output is correct
29 Correct 1600 ms 411048 KB Output is correct
30 Correct 1528 ms 411048 KB Output is correct
31 Correct 1595 ms 411048 KB Output is correct
32 Correct 1386 ms 411048 KB Output is correct
33 Correct 1119 ms 411048 KB Output is correct
34 Correct 926 ms 411048 KB Output is correct
35 Correct 1174 ms 411048 KB Output is correct
36 Correct 1395 ms 411048 KB Output is correct
37 Correct 1325 ms 411048 KB Output is correct
38 Correct 1331 ms 411048 KB Output is correct
39 Correct 1728 ms 411048 KB Output is correct
40 Correct 1639 ms 411048 KB Output is correct
41 Correct 1671 ms 411048 KB Output is correct
42 Correct 1743 ms 411048 KB Output is correct
43 Correct 1681 ms 411048 KB Output is correct
44 Correct 1035 ms 411048 KB Output is correct
45 Correct 1004 ms 411048 KB Output is correct
46 Correct 1010 ms 411048 KB Output is correct
47 Correct 1002 ms 411048 KB Output is correct
48 Correct 993 ms 411048 KB Output is correct
49 Correct 1772 ms 411048 KB Output is correct
50 Correct 1826 ms 411048 KB Output is correct
51 Correct 988 ms 411048 KB Output is correct
52 Correct 944 ms 411048 KB Output is correct
53 Correct 1656 ms 411048 KB Output is correct
54 Correct 1606 ms 411048 KB Output is correct
55 Correct 1596 ms 411048 KB Output is correct
56 Correct 1643 ms 411048 KB Output is correct
57 Correct 1062 ms 411048 KB Output is correct
58 Correct 1087 ms 411048 KB Output is correct
59 Correct 980 ms 411048 KB Output is correct
60 Correct 1033 ms 411048 KB Output is correct
61 Correct 1817 ms 411048 KB Output is correct
62 Correct 1724 ms 411048 KB Output is correct
63 Correct 1582 ms 411048 KB Output is correct
64 Correct 1972 ms 411048 KB Output is correct
65 Correct 1752 ms 411048 KB Output is correct
66 Correct 1726 ms 411048 KB Output is correct
67 Correct 1693 ms 411048 KB Output is correct
68 Correct 1494 ms 411048 KB Output is correct
69 Correct 1492 ms 411048 KB Output is correct
70 Correct 1713 ms 411048 KB Output is correct
71 Correct 1547 ms 411048 KB Output is correct
72 Correct 1482 ms 411048 KB Output is correct
73 Correct 1774 ms 411048 KB Output is correct
74 Correct 1543 ms 411048 KB Output is correct
75 Correct 1477 ms 411048 KB Output is correct
76 Correct 1800 ms 411048 KB Output is correct
77 Correct 1715 ms 411048 KB Output is correct
78 Correct 1703 ms 411048 KB Output is correct
79 Correct 951 ms 411048 KB Output is correct
80 Correct 923 ms 411048 KB Output is correct
81 Correct 924 ms 411048 KB Output is correct
82 Correct 1806 ms 411048 KB Output is correct
83 Correct 1847 ms 411048 KB Output is correct
84 Correct 1776 ms 411048 KB Output is correct
85 Correct 1749 ms 411048 KB Output is correct
86 Correct 1672 ms 411048 KB Output is correct
87 Correct 1767 ms 411048 KB Output is correct
88 Correct 1047 ms 411048 KB Output is correct
89 Correct 1039 ms 411048 KB Output is correct
90 Correct 1004 ms 411048 KB Output is correct
91 Correct 1034 ms 411048 KB Output is correct
92 Correct 1018 ms 411048 KB Output is correct
93 Correct 1034 ms 411048 KB Output is correct
94 Correct 1395 ms 411048 KB Output is correct
95 Correct 1311 ms 411048 KB Output is correct
96 Correct 1277 ms 411048 KB Output is correct
97 Correct 1166 ms 411048 KB Output is correct
98 Correct 1314 ms 411048 KB Output is correct
99 Correct 1175 ms 411048 KB Output is correct
100 Correct 1111 ms 411048 KB Output is correct
101 Correct 1065 ms 411048 KB Output is correct
102 Correct 1057 ms 411048 KB Output is correct
103 Correct 1068 ms 411048 KB Output is correct
104 Correct 1056 ms 411048 KB Output is correct
105 Correct 1030 ms 411048 KB Output is correct
106 Correct 1609 ms 411048 KB Output is correct
107 Correct 1618 ms 411048 KB Output is correct
108 Correct 1528 ms 411048 KB Output is correct
109 Correct 1478 ms 411048 KB Output is correct
110 Correct 1563 ms 411048 KB Output is correct
111 Correct 1475 ms 411048 KB Output is correct
112 Correct 1056 ms 411048 KB Output is correct
113 Correct 1036 ms 411048 KB Output is correct
114 Correct 1070 ms 411048 KB Output is correct
115 Correct 1016 ms 411048 KB Output is correct
116 Correct 972 ms 411048 KB Output is correct
117 Correct 999 ms 411048 KB Output is correct
118 Correct 1659 ms 411048 KB Output is correct
119 Correct 1511 ms 411048 KB Output is correct
120 Correct 1440 ms 411048 KB Output is correct
121 Correct 1717 ms 411048 KB Output is correct
122 Correct 1590 ms 411048 KB Output is correct
123 Correct 1502 ms 411048 KB Output is correct
124 Correct 1732 ms 411048 KB Output is correct
125 Correct 1592 ms 411048 KB Output is correct
126 Correct 1559 ms 411048 KB Output is correct