oj.uz

Submission #763755

# Submission time Handle Problem Language Result Execution time Memory
763755 2023-06-22T18:51:54 Z raysh07 Digital Circuit (IOI22_circuit) C++17
46 / 100
 3000 ms 8272 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2e5 + 69;
const int mod = 1e9 + 2022;
vector <int> adj[N];
int n, m;
int w1[N], tot[N], ok[N], aa[N];

int power(int x, int y){
    if (y==0) return 1;
    
    int v = power(x, y/2);
    v *= v; v %= mod;
    
    if (y & 1) return v * x % mod;
    else return v;
}

// void dfs(int u){
//     int cnt = 0;
//     for (int v : adj[u]){
//         dfs(v);
//         cnt++;
//     }
    
//     if (u >= n) return;
    
//     int curr = 1;
//     w1[u] = 0;
    
//     for (int v : adj[u]){
//         ok[v] = curr;
//         curr *= tot[v]; 
//         curr %= mod;
//     }
//     tot[u] = curr * cnt % mod;
//     curr = 1;
    
//     for (int i = adj[u].size() - 1; i >= 0; i--){
//         int v = adj[u][i];
//         ok[v] *= curr;
//         ok[v] %= mod;
//         curr *= tot[v];
//         curr %= mod;
//     }
    
//     for (int v : adj[u]){
//         w1[u] += w1[v] * ok[v] % mod;
//         w1[u] %= mod;
//     }
// }

void dfs2(int u){
    int cnt = 0;
    tot[u] = 1;
    for (int v : adj[u]){
        cnt++;
        dfs2(v);
        tot[u] *= tot[v];
        tot[u] %= mod;
    }
    
    if (cnt != 0)
    tot[u] *= cnt;
    tot[u] %= mod;
}

void dfs(int u){
    int curr = 1;
    for (int v : adj[u]){
        ok[v] = curr;
        curr *= tot[v];
        curr %= mod;
    }
    
    // tot[u] = curr;
    // if (cnt != 1) tot[u] *= cnt, tot[u] %= mod;
    
    reverse(adj[u].begin(), adj[u].end());
    curr = 1;
    for (int v : adj[u]){
        ok[v] *= curr; 
        ok[v] %= mod;
        ok[v] *= ok[u];
        ok[v] %= mod;
        curr *= tot[v];
        curr %= mod;
        
        dfs(v);
    }
}

void init(int32_t N, int32_t M, vector<int32_t> p, vector<int32_t> a) {
    n = N;
    m = M;
    for (int i = 1; i < n + m; i++){
        adj[p[i]].push_back(i);
    }
    
    // for (int i = n; i < n + m; i++){
    //     for (int j = n; j < n + m; j++){
    //         tot[j] = 1;
    //         if (j == i) w1[j] = 1;
    //         else w1[j] = 0;
    //     }
        
    //     dfs(0);
    //     aa[i] = w1[0];
    // }
    
    dfs2(0);
    
    // for (int i = 0; i < n + m; i++) cout << tot[i] << " ";
    // cout << "\n";
    ok[0] = 1;
    dfs(0);
    for (int i = n; i < n + m; i++) aa[i] = ok[i];
    
    for (int i = 0; i < m; i++){
        if (a[i] == 1)
        w1[i + n] = 1;
        else w1[i + n] = 0;
    }
}

int32_t count_ways(int32_t l, int32_t r) {
    for (int i = l; i <= r; i++){
        w1[i] ^= 1;
    }
    
    int32_t ans = 0;
    for (int i = n; i < n + m; i++){
        if (w1[i]) ans += aa[i], ans %= mod;
    }
    
    return ans;
}

// int32_t main(){
//     int32_t n, m; cin >> n >> m;
    
//     vector <int32_t> p(n + m), a(m);
//     for (auto &x : p) cin >> x;
//     for (auto &x : a) cin >> x;
//     init(n, m, p, a);
    
//     int q; cin >> q;
//     while(q--){
//         int32_t l, r;
//         cin >> l >> r;
//         cout << count_ways(l, r) << "\n";
//     }
//     return 0;
// }

Subtask #1
2.0 / 2.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 3 ms 5088 KB Output is correct
4 Correct 2 ms 5072 KB Output is correct
5 Correct 2 ms 5120 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5200 KB Output is correct
11 Correct 3 ms 5200 KB Output is correct
12 Correct 2 ms 5072 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3034 ms 8272 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 3034 ms 8272 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 3 ms 5088 KB Output is correct
4 Correct 2 ms 5072 KB Output is correct
5 Correct 2 ms 5120 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 3 ms 5072 KB Output is correct
8 Correct 3 ms 5072 KB Output is correct
9 Correct 3 ms 5072 KB Output is correct
10 Correct 3 ms 5200 KB Output is correct
11 Correct 3 ms 5200 KB Output is correct
12 Correct 2 ms 5072 KB Output is correct
13 Execution timed out 3034 ms 8272 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 2 ms 5072 KB Output is correct
5 Correct 2 ms 5072 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 2 ms 5072 KB Output is correct
8 Correct 2 ms 5072 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 2 ms 4944 KB Output is correct
11 Correct 3 ms 5088 KB Output is correct
12 Correct 2 ms 5072 KB Output is correct
13 Correct 2 ms 5120 KB Output is correct
14 Correct 2 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 2 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 2 ms 5008 KB Output is correct
23 Correct 2 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 3 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 2 ms 5072 KB Output is correct
30 Correct 3 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5020 KB Output is correct
33 Correct 2 ms 5072 KB Output is correct
34 Correct 2 ms 5072 KB Output is correct
35 Correct 2 ms 5072 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 2 ms 5200 KB Output is correct
38 Correct 3 ms 5200 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 2 ms 5072 KB Output is correct
41 Correct 2 ms 5072 KB Output is correct
42 Correct 2 ms 5072 KB Output is correct
43 Correct 1075 ms 5328 KB Output is correct
44 Correct 1468 ms 5328 KB Output is correct
45 Correct 1587 ms 5328 KB Output is correct
46 Correct 1815 ms 5456 KB Output is correct
47 Correct 2382 ms 5456 KB Output is correct
48 Correct 2320 ms 5456 KB Output is correct
49 Correct 2453 ms 5456 KB Output is correct
50 Correct 1817 ms 5516 KB Output is correct
51 Correct 2669 ms 5348 KB Output is correct
52 Correct 2191 ms 5352 KB Output is correct
53 Correct 553 ms 5644 KB Output is correct
54 Correct 2348 ms 5508 KB Output is correct
55 Correct 2511 ms 5456 KB Output is correct
56 Correct 2509 ms 5328 KB Output is correct
57 Correct 2302 ms 5260 KB Output is correct
58 Correct 2446 ms 5832 KB Output is correct
59 Correct 2444 ms 6008 KB Output is correct
60 Correct 2680 ms 6028 KB Output is correct
61 Correct 1275 ms 5416 KB Output is correct
62 Correct 1587 ms 5328 KB Output is correct
63 Correct 1581 ms 5260 KB Output is correct
64 Correct 2464 ms 5200 KB Output is correct
65 Correct 654 ms 5128 KB Output is correct
66 Correct 1943 ms 5388 KB Output is correct
67 Correct 1981 ms 5328 KB Output is correct
68 Correct 2125 ms 5392 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 2 ms 4944 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 2 ms 5072 KB Output is correct
5 Correct 2 ms 5072 KB Output is correct
6 Correct 2 ms 5072 KB Output is correct
7 Correct 2 ms 5072 KB Output is correct
8 Correct 2 ms 5072 KB Output is correct
9 Correct 2 ms 4944 KB Output is correct
10 Correct 2 ms 4944 KB Output is correct
11 Correct 3 ms 5088 KB Output is correct
12 Correct 2 ms 5072 KB Output is correct
13 Correct 2 ms 5120 KB Output is correct
14 Correct 2 ms 5072 KB Output is correct
15 Correct 3 ms 5072 KB Output is correct
16 Correct 3 ms 5072 KB Output is correct
17 Correct 3 ms 5072 KB Output is correct
18 Correct 3 ms 5200 KB Output is correct
19 Correct 3 ms 5200 KB Output is correct
20 Correct 2 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 2 ms 5008 KB Output is correct
23 Correct 2 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 3 ms 5072 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 3 ms 5072 KB Output is correct
28 Correct 3 ms 5072 KB Output is correct
29 Correct 2 ms 5072 KB Output is correct
30 Correct 3 ms 5072 KB Output is correct
31 Correct 3 ms 5072 KB Output is correct
32 Correct 3 ms 5020 KB Output is correct
33 Correct 2 ms 5072 KB Output is correct
34 Correct 2 ms 5072 KB Output is correct
35 Correct 2 ms 5072 KB Output is correct
36 Correct 3 ms 5200 KB Output is correct
37 Correct 2 ms 5200 KB Output is correct
38 Correct 3 ms 5200 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 2 ms 5072 KB Output is correct
41 Correct 2 ms 5072 KB Output is correct
42 Correct 2 ms 5072 KB Output is correct
43 Execution timed out 3034 ms 8272 KB Time limit exceeded
44 Halted 0 ms 0 KB -