oj.uz

Submission #936579

# Submission time Handle Problem Language Result Execution time Memory
936579 2024-03-02T09:04:53 Z GrindMachine Digital Circuit (IOI22_circuit) C++17
46 / 100
 3000 ms 5720 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1000002022;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "circuit.h"

vector<ll> adj[N];
vector<ll> sub_ways(N);

void dfs1(ll u){
    sub_ways[u] = max((ll)sz(adj[u]),1ll);
    trav(v,adj[u]){
        dfs1(v);
        sub_ways[u] = sub_ways[u]*sub_ways[v]%MOD;
    }
}

ll n,m;
vector<int> a;
vector<ll> contrib;

void dfs2(ll u, ll val){
    auto children = adj[u];
    if(children.empty()){
        contrib[u-n] = val;
        return;
    }

    ll siz = sz(children);
    children.insert(children.begin(),0);
    vector<ll> pref(siz+5), suff(siz+5);
    pref[0] = 1, suff[siz+1] = 1;
    rep1(i,siz){
        ll v = children[i];
        pref[i] = pref[i-1]*sub_ways[v]%MOD;
    }
    rev(i,siz,1){
        ll v = children[i];
        suff[i] = suff[i+1]*sub_ways[v]%MOD;
    }

    rep1(i,siz){
        ll v = children[i];
        ll new_val = val*pref[i-1]%MOD*suff[i+1]%MOD;
        dfs2(v,new_val);
    }
}

void init(int n_, int m_, std::vector<int> P, std::vector<int> A) {
    n = n_, m = m_;
    a = A;
    contrib = vector<ll>(m);

    rep(i,n+m){
        if(P[i] != -1){
            adj[P[i]].pb(i);
        }
    }

    dfs1(0);
    dfs2(0,1);
}

int count_ways(int l, int r) {
    l -= n, r -= n;
    for(int i = l; i <= r; ++i){
        a[i] ^= 1;
    }

    ll ans = 0;
    rep(i,m){
        if(a[i]){
            ans += contrib[i];
            ans %= MOD;
        }
    }

    return ans;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3668 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3572 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3416 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3664 KB Output is correct
5 Correct 1 ms 3416 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 2 ms 3416 KB Output is correct
10 Correct 2 ms 3928 KB Output is correct
11 Correct 2 ms 3928 KB Output is correct
12 Correct 1 ms 3416 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3668 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3572 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 3416 KB Output is correct
11 Correct 1 ms 3416 KB Output is correct
12 Correct 1 ms 3664 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 1 ms 3416 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 1 ms 3416 KB Output is correct
17 Correct 2 ms 3416 KB Output is correct
18 Correct 2 ms 3928 KB Output is correct
19 Correct 2 ms 3928 KB Output is correct
20 Correct 1 ms 3416 KB Output is correct
21 Correct 1 ms 3416 KB Output is correct
22 Correct 1 ms 3416 KB Output is correct
23 Correct 2 ms 3416 KB Output is correct
24 Correct 2 ms 3416 KB Output is correct
25 Correct 2 ms 3416 KB Output is correct
26 Correct 1 ms 3416 KB Output is correct
27 Correct 1 ms 3416 KB Output is correct
28 Correct 2 ms 3416 KB Output is correct
29 Correct 2 ms 3416 KB Output is correct
30 Correct 2 ms 3416 KB Output is correct
31 Correct 2 ms 3928 KB Output is correct
32 Correct 1 ms 3416 KB Output is correct
33 Correct 2 ms 3416 KB Output is correct
34 Correct 1 ms 3416 KB Output is correct
35 Correct 1 ms 3416 KB Output is correct
36 Correct 2 ms 3928 KB Output is correct
37 Correct 2 ms 3928 KB Output is correct
38 Correct 2 ms 3928 KB Output is correct
39 Correct 1 ms 3672 KB Output is correct
40 Correct 1 ms 3416 KB Output is correct
41 Correct 1 ms 3416 KB Output is correct
42 Correct 1 ms 3416 KB Output is correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3030 ms 5720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3030 ms 5720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3416 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3664 KB Output is correct
5 Correct 1 ms 3416 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 2 ms 3416 KB Output is correct
10 Correct 2 ms 3928 KB Output is correct
11 Correct 2 ms 3928 KB Output is correct
12 Correct 1 ms 3416 KB Output is correct
13 Execution timed out 3030 ms 5720 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3668 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3572 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 3416 KB Output is correct
11 Correct 1 ms 3416 KB Output is correct
12 Correct 1 ms 3664 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 1 ms 3416 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 1 ms 3416 KB Output is correct
17 Correct 2 ms 3416 KB Output is correct
18 Correct 2 ms 3928 KB Output is correct
19 Correct 2 ms 3928 KB Output is correct
20 Correct 1 ms 3416 KB Output is correct
21 Correct 1 ms 3416 KB Output is correct
22 Correct 1 ms 3416 KB Output is correct
23 Correct 2 ms 3416 KB Output is correct
24 Correct 2 ms 3416 KB Output is correct
25 Correct 2 ms 3416 KB Output is correct
26 Correct 1 ms 3416 KB Output is correct
27 Correct 1 ms 3416 KB Output is correct
28 Correct 2 ms 3416 KB Output is correct
29 Correct 2 ms 3416 KB Output is correct
30 Correct 2 ms 3416 KB Output is correct
31 Correct 2 ms 3928 KB Output is correct
32 Correct 1 ms 3416 KB Output is correct
33 Correct 2 ms 3416 KB Output is correct
34 Correct 1 ms 3416 KB Output is correct
35 Correct 1 ms 3416 KB Output is correct
36 Correct 2 ms 3928 KB Output is correct
37 Correct 2 ms 3928 KB Output is correct
38 Correct 2 ms 3928 KB Output is correct
39 Correct 1 ms 3672 KB Output is correct
40 Correct 1 ms 3416 KB Output is correct
41 Correct 1 ms 3416 KB Output is correct
42 Correct 1 ms 3416 KB Output is correct
43 Correct 896 ms 3672 KB Output is correct
44 Correct 1175 ms 3672 KB Output is correct
45 Correct 1222 ms 3808 KB Output is correct
46 Correct 1489 ms 3928 KB Output is correct
47 Correct 2040 ms 3928 KB Output is correct
48 Correct 2106 ms 3928 KB Output is correct
49 Correct 2025 ms 3928 KB Output is correct
50 Correct 1546 ms 3928 KB Output is correct
51 Correct 2352 ms 3672 KB Output is correct
52 Correct 2035 ms 3672 KB Output is correct
53 Correct 500 ms 5208 KB Output is correct
54 Correct 2050 ms 3672 KB Output is correct
55 Correct 2045 ms 3672 KB Output is correct
56 Correct 2063 ms 3672 KB Output is correct
57 Correct 1999 ms 3672 KB Output is correct
58 Correct 2086 ms 5464 KB Output is correct
59 Correct 2066 ms 5720 KB Output is correct
60 Correct 2244 ms 5720 KB Output is correct
61 Correct 1071 ms 4184 KB Output is correct
62 Correct 1504 ms 3668 KB Output is correct
63 Correct 1535 ms 3672 KB Output is correct
64 Correct 2001 ms 3672 KB Output is correct
65 Correct 503 ms 3668 KB Output is correct
66 Correct 1672 ms 3672 KB Output is correct
67 Correct 1665 ms 3672 KB Output is correct
68 Correct 1669 ms 3672 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3416 KB Output is correct
2 Correct 1 ms 3668 KB Output is correct
3 Correct 1 ms 3416 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3572 KB Output is correct
6 Correct 1 ms 3416 KB Output is correct
7 Correct 1 ms 3416 KB Output is correct
8 Correct 1 ms 3416 KB Output is correct
9 Correct 1 ms 3416 KB Output is correct
10 Correct 1 ms 3416 KB Output is correct
11 Correct 1 ms 3416 KB Output is correct
12 Correct 1 ms 3664 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 1 ms 3416 KB Output is correct
15 Correct 1 ms 3416 KB Output is correct
16 Correct 1 ms 3416 KB Output is correct
17 Correct 2 ms 3416 KB Output is correct
18 Correct 2 ms 3928 KB Output is correct
19 Correct 2 ms 3928 KB Output is correct
20 Correct 1 ms 3416 KB Output is correct
21 Correct 1 ms 3416 KB Output is correct
22 Correct 1 ms 3416 KB Output is correct
23 Correct 2 ms 3416 KB Output is correct
24 Correct 2 ms 3416 KB Output is correct
25 Correct 2 ms 3416 KB Output is correct
26 Correct 1 ms 3416 KB Output is correct
27 Correct 1 ms 3416 KB Output is correct
28 Correct 2 ms 3416 KB Output is correct
29 Correct 2 ms 3416 KB Output is correct
30 Correct 2 ms 3416 KB Output is correct
31 Correct 2 ms 3928 KB Output is correct
32 Correct 1 ms 3416 KB Output is correct
33 Correct 2 ms 3416 KB Output is correct
34 Correct 1 ms 3416 KB Output is correct
35 Correct 1 ms 3416 KB Output is correct
36 Correct 2 ms 3928 KB Output is correct
37 Correct 2 ms 3928 KB Output is correct
38 Correct 2 ms 3928 KB Output is correct
39 Correct 1 ms 3672 KB Output is correct
40 Correct 1 ms 3416 KB Output is correct
41 Correct 1 ms 3416 KB Output is correct
42 Correct 1 ms 3416 KB Output is correct
43 Execution timed out 3030 ms 5720 KB Time limit exceeded
44 Halted 0 ms 0 KB -