oj.uz

Submission #62553

# Submission time Handle Problem Language Result Execution time Memory
62553 2018-07-29T05:34:42 Z qkxwsm Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 410956 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 6 ms 4984 KB Output is correct
2 Correct 6 ms 5108 KB Output is correct
3 Correct 7 ms 5312 KB Output is correct
4 Correct 7 ms 5352 KB Output is correct
5 Correct 10 ms 5688 KB Output is correct
6 Correct 10 ms 5692 KB Output is correct
7 Correct 10 ms 5708 KB Output is correct
8 Correct 20 ms 8668 KB Output is correct
9 Correct 22 ms 8756 KB Output is correct
10 Correct 21 ms 8756 KB Output is correct
11 Correct 22 ms 8756 KB Output is correct
12 Correct 16 ms 8756 KB Output is correct
13 Correct 21 ms 8756 KB Output is correct
14 Correct 20 ms 8756 KB Output is correct
15 Correct 14 ms 8756 KB Output is correct
16 Correct 18 ms 8756 KB Output is correct
17 Correct 19 ms 8756 KB Output is correct
18 Correct 14 ms 8756 KB Output is correct
19 Correct 19 ms 8756 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5108 KB Output is correct
3 Correct 7 ms 5312 KB Output is correct
4 Correct 7 ms 5352 KB Output is correct
5 Correct 10 ms 5688 KB Output is correct
6 Correct 10 ms 5692 KB Output is correct
7 Correct 10 ms 5708 KB Output is correct
8 Correct 20 ms 8668 KB Output is correct
9 Correct 22 ms 8756 KB Output is correct
10 Correct 21 ms 8756 KB Output is correct
11 Correct 22 ms 8756 KB Output is correct
12 Correct 16 ms 8756 KB Output is correct
13 Correct 21 ms 8756 KB Output is correct
14 Correct 20 ms 8756 KB Output is correct
15 Correct 14 ms 8756 KB Output is correct
16 Correct 18 ms 8756 KB Output is correct
17 Correct 19 ms 8756 KB Output is correct
18 Correct 14 ms 8756 KB Output is correct
19 Correct 19 ms 8756 KB Output is correct
20 Correct 984 ms 9816 KB Output is correct
21 Correct 920 ms 9820 KB Output is correct
22 Correct 958 ms 9844 KB Output is correct
23 Correct 986 ms 9880 KB Output is correct
24 Correct 1345 ms 252800 KB Output is correct
25 Correct 1500 ms 264440 KB Output is correct
26 Correct 1557 ms 264440 KB Output is correct
27 Correct 1486 ms 410780 KB Output is correct
28 Correct 1455 ms 410856 KB Output is correct
29 Correct 1472 ms 410868 KB Output is correct
30 Correct 1447 ms 410868 KB Output is correct
31 Correct 1429 ms 410868 KB Output is correct
32 Correct 1448 ms 410868 KB Output is correct
33 Correct 1002 ms 410868 KB Output is correct
34 Correct 1029 ms 410868 KB Output is correct
35 Correct 1079 ms 410868 KB Output is correct
36 Correct 1291 ms 410868 KB Output is correct
37 Correct 1268 ms 410868 KB Output is correct
38 Correct 1255 ms 410868 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5108 KB Output is correct
3 Correct 7 ms 5312 KB Output is correct
4 Correct 7 ms 5352 KB Output is correct
5 Correct 10 ms 5688 KB Output is correct
6 Correct 10 ms 5692 KB Output is correct
7 Correct 10 ms 5708 KB Output is correct
8 Correct 20 ms 8668 KB Output is correct
9 Correct 22 ms 8756 KB Output is correct
10 Correct 21 ms 8756 KB Output is correct
11 Correct 22 ms 8756 KB Output is correct
12 Correct 16 ms 8756 KB Output is correct
13 Correct 21 ms 8756 KB Output is correct
14 Correct 20 ms 8756 KB Output is correct
15 Correct 14 ms 8756 KB Output is correct
16 Correct 18 ms 8756 KB Output is correct
17 Correct 19 ms 8756 KB Output is correct
18 Correct 14 ms 8756 KB Output is correct
19 Correct 19 ms 8756 KB Output is correct
20 Correct 984 ms 9816 KB Output is correct
21 Correct 920 ms 9820 KB Output is correct
22 Correct 958 ms 9844 KB Output is correct
23 Correct 986 ms 9880 KB Output is correct
24 Correct 1345 ms 252800 KB Output is correct
25 Correct 1500 ms 264440 KB Output is correct
26 Correct 1557 ms 264440 KB Output is correct
27 Correct 1486 ms 410780 KB Output is correct
28 Correct 1455 ms 410856 KB Output is correct
29 Correct 1472 ms 410868 KB Output is correct
30 Correct 1447 ms 410868 KB Output is correct
31 Correct 1429 ms 410868 KB Output is correct
32 Correct 1448 ms 410868 KB Output is correct
33 Correct 1002 ms 410868 KB Output is correct
34 Correct 1029 ms 410868 KB Output is correct
35 Correct 1079 ms 410868 KB Output is correct
36 Correct 1291 ms 410868 KB Output is correct
37 Correct 1268 ms 410868 KB Output is correct
38 Correct 1255 ms 410868 KB Output is correct
39 Correct 1855 ms 410868 KB Output is correct
40 Correct 1676 ms 410868 KB Output is correct
41 Correct 1675 ms 410868 KB Output is correct
42 Correct 1734 ms 410868 KB Output is correct
43 Correct 1735 ms 410868 KB Output is correct
44 Correct 1087 ms 410868 KB Output is correct
45 Correct 996 ms 410868 KB Output is correct
46 Correct 1024 ms 410868 KB Output is correct
47 Correct 1008 ms 410868 KB Output is correct
48 Correct 1014 ms 410868 KB Output is correct
49 Correct 1908 ms 410956 KB Output is correct
50 Correct 1808 ms 410956 KB Output is correct
51 Correct 933 ms 410956 KB Output is correct
52 Correct 919 ms 410956 KB Output is correct
53 Correct 1541 ms 410956 KB Output is correct
54 Correct 1505 ms 410956 KB Output is correct
55 Correct 1488 ms 410956 KB Output is correct
56 Correct 1464 ms 410956 KB Output is correct
57 Correct 994 ms 410956 KB Output is correct
58 Correct 1034 ms 410956 KB Output is correct
59 Correct 973 ms 410956 KB Output is correct
60 Correct 958 ms 410956 KB Output is correct
61 Correct 1912 ms 410956 KB Output is correct
62 Correct 1661 ms 410956 KB Output is correct
63 Correct 1732 ms 410956 KB Output is correct
64 Execution timed out 2095 ms 410956 KB Time limit exceeded
65 Halted 0 ms 0 KB -