oj.uz

Submission #62554

# Submission time Handle Problem Language Result Execution time Memory
62554 2018-07-29T05:38:19 Z qkxwsm Bitaro’s Party (JOI18_bitaro) C++11
14 / 100
 2000 ms 411052 KB 
//lol i passed on official server but not here so just submitting something that passes here
#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 4984 KB Output is correct
2 Correct 8 ms 5132 KB Output is correct
3 Correct 7 ms 5132 KB Output is correct
4 Correct 7 ms 5236 KB Output is correct
5 Correct 13 ms 5924 KB Output is correct
6 Correct 11 ms 5924 KB Output is correct
7 Correct 11 ms 5924 KB Output is correct
8 Correct 14 ms 8644 KB Output is correct
9 Correct 23 ms 8772 KB Output is correct
10 Correct 21 ms 8772 KB Output is correct
11 Correct 19 ms 8772 KB Output is correct
12 Correct 14 ms 8772 KB Output is correct
13 Correct 20 ms 8772 KB Output is correct
14 Correct 20 ms 8772 KB Output is correct
15 Correct 15 ms 8772 KB Output is correct
16 Correct 19 ms 8772 KB Output is correct
17 Correct 20 ms 8772 KB Output is correct
18 Correct 14 ms 8772 KB Output is correct
19 Correct 16 ms 8772 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5132 KB Output is correct
3 Correct 7 ms 5132 KB Output is correct
4 Correct 7 ms 5236 KB Output is correct
5 Correct 13 ms 5924 KB Output is correct
6 Correct 11 ms 5924 KB Output is correct
7 Correct 11 ms 5924 KB Output is correct
8 Correct 14 ms 8644 KB Output is correct
9 Correct 23 ms 8772 KB Output is correct
10 Correct 21 ms 8772 KB Output is correct
11 Correct 19 ms 8772 KB Output is correct
12 Correct 14 ms 8772 KB Output is correct
13 Correct 20 ms 8772 KB Output is correct
14 Correct 20 ms 8772 KB Output is correct
15 Correct 15 ms 8772 KB Output is correct
16 Correct 19 ms 8772 KB Output is correct
17 Correct 20 ms 8772 KB Output is correct
18 Correct 14 ms 8772 KB Output is correct
19 Correct 16 ms 8772 KB Output is correct
20 Correct 1030 ms 10040 KB Output is correct
21 Correct 954 ms 10040 KB Output is correct
22 Correct 1046 ms 10040 KB Output is correct
23 Correct 1018 ms 10040 KB Output is correct
24 Correct 1499 ms 252832 KB Output is correct
25 Correct 1576 ms 264296 KB Output is correct
26 Correct 1496 ms 264296 KB Output is correct
27 Correct 1400 ms 410808 KB Output is correct
28 Correct 1478 ms 410808 KB Output is correct
29 Correct 1560 ms 410964 KB Output is correct
30 Correct 1466 ms 410964 KB Output is correct
31 Correct 1517 ms 410964 KB Output is correct
32 Correct 1415 ms 410964 KB Output is correct
33 Correct 1072 ms 410964 KB Output is correct
34 Correct 1067 ms 410964 KB Output is correct
35 Correct 1141 ms 410964 KB Output is correct
36 Correct 1299 ms 410964 KB Output is correct
37 Correct 1336 ms 410964 KB Output is correct
38 Correct 1292 ms 410964 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 8 ms 5132 KB Output is correct
3 Correct 7 ms 5132 KB Output is correct
4 Correct 7 ms 5236 KB Output is correct
5 Correct 13 ms 5924 KB Output is correct
6 Correct 11 ms 5924 KB Output is correct
7 Correct 11 ms 5924 KB Output is correct
8 Correct 14 ms 8644 KB Output is correct
9 Correct 23 ms 8772 KB Output is correct
10 Correct 21 ms 8772 KB Output is correct
11 Correct 19 ms 8772 KB Output is correct
12 Correct 14 ms 8772 KB Output is correct
13 Correct 20 ms 8772 KB Output is correct
14 Correct 20 ms 8772 KB Output is correct
15 Correct 15 ms 8772 KB Output is correct
16 Correct 19 ms 8772 KB Output is correct
17 Correct 20 ms 8772 KB Output is correct
18 Correct 14 ms 8772 KB Output is correct
19 Correct 16 ms 8772 KB Output is correct
20 Correct 1030 ms 10040 KB Output is correct
21 Correct 954 ms 10040 KB Output is correct
22 Correct 1046 ms 10040 KB Output is correct
23 Correct 1018 ms 10040 KB Output is correct
24 Correct 1499 ms 252832 KB Output is correct
25 Correct 1576 ms 264296 KB Output is correct
26 Correct 1496 ms 264296 KB Output is correct
27 Correct 1400 ms 410808 KB Output is correct
28 Correct 1478 ms 410808 KB Output is correct
29 Correct 1560 ms 410964 KB Output is correct
30 Correct 1466 ms 410964 KB Output is correct
31 Correct 1517 ms 410964 KB Output is correct
32 Correct 1415 ms 410964 KB Output is correct
33 Correct 1072 ms 410964 KB Output is correct
34 Correct 1067 ms 410964 KB Output is correct
35 Correct 1141 ms 410964 KB Output is correct
36 Correct 1299 ms 410964 KB Output is correct
37 Correct 1336 ms 410964 KB Output is correct
38 Correct 1292 ms 410964 KB Output is correct
39 Correct 1699 ms 410964 KB Output is correct
40 Correct 1653 ms 410964 KB Output is correct
41 Correct 1834 ms 410964 KB Output is correct
42 Correct 1962 ms 410964 KB Output is correct
43 Correct 1750 ms 410964 KB Output is correct
44 Correct 971 ms 410964 KB Output is correct
45 Correct 1058 ms 410964 KB Output is correct
46 Correct 1086 ms 410964 KB Output is correct
47 Correct 1054 ms 410964 KB Output is correct
48 Correct 1063 ms 410964 KB Output is correct
49 Correct 1937 ms 411052 KB Output is correct
50 Correct 1793 ms 411052 KB Output is correct
51 Correct 978 ms 411052 KB Output is correct
52 Correct 912 ms 411052 KB Output is correct
53 Correct 1709 ms 411052 KB Output is correct
54 Correct 1671 ms 411052 KB Output is correct
55 Correct 1524 ms 411052 KB Output is correct
56 Correct 1523 ms 411052 KB Output is correct
57 Correct 996 ms 411052 KB Output is correct
58 Correct 1065 ms 411052 KB Output is correct
59 Correct 982 ms 411052 KB Output is correct
60 Correct 1018 ms 411052 KB Output is correct
61 Execution timed out 2007 ms 411052 KB Time limit exceeded
62 Halted 0 ms 0 KB -