oj.uz

Submission #628013

# Submission time Handle Problem Language Result Execution time Memory
628013 2022-08-13T03:13:12 Z Hanksburger Digital Circuit (IOI22_circuit) C++17
62 / 100
 1118 ms 19572 KB 
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
const long long mod=1e9+2022, sq=3e2;
long long seg[400005], sum[400005], lazy[400005], state[200005], dp[200005], a[200005], n, m;
vector<long long> adj[200005];
void dfs(long long u)
{
    if (u>=n)
    {
        dp[u]=1;
        return;
    }
    dp[u]=adj[u].size();
    for (long long v:adj[u])
    {
        dfs(v);
        dp[u]=(dp[u]*dp[v])%mod;
    }
}
void dfs2(long long u, long long x)
{
    if (u>=n)
    {
        a[u]=x;
        return;
    }
    vector<long long> vec;
    for (long long i=0; i<adj[u].size(); i++)
    {
        long long v=adj[u][i];
        if (i%sq==0)
            vec.push_back(dp[v]);
        else
            vec[vec.size()-1]=(vec[vec.size()-1]*dp[v])%mod;
    }
//    cout << "vec: ";
//    for (long long i=0; i<vec.size(); i++)
//        cout << vec[i] << ' ';
//    cout << '\n';
    for (long long i=0; i<adj[u].size(); i++)
    {
        long long v=adj[u][i], y=x;
        for (long long j=0; j<i/sq; j++)
            y=(y*vec[j])%mod;
        for (long long j=i/sq+1; j<vec.size(); j++)
            y=(y*vec[j])%mod;
        for (long long j=i/sq*sq; j<i; j++)
            y=(y*dp[adj[u][j]])%mod;
        for (long long j=i+1; j<min((long long)adj[u].size(), (i/sq+1)*sq); j++)
            y=(y*dp[adj[u][j]])%mod;
        dfs2(v, y);
    }
}
void push(long long i, long long l, long long r)
{
    if (lazy[i])
    {
        seg[i]=(sum[i]-seg[i]+mod)%mod;
        lazy[i]=0;
        lazy[i*2]^=1;
        lazy[i*2+1]^=1;
    }
}
void build(long long i, long long l, long long r)
{
    if (l==r)
    {
        sum[i]=a[l];
        seg[i]=a[l]*state[l];
//        cout << "l r seg " << l << ' ' << r << ' ' << seg[i] << '\n';
        return;
    }
    long long mid=(l+r)/2;
    build(i*2, l, mid);
    build(i*2+1, mid+1, r);
    sum[i]=(sum[i*2]+sum[i*2+1])%mod;
    seg[i]=(seg[i*2]+seg[i*2+1])%mod;
//    cout << "l r seg " << l << ' ' << r << ' ' << seg[i] << '\n';
}
void update(long long i, long long l, long long r, long long ql, long long qr)
{
    push(i, l, r);
    if (ql<=l && r<=qr)
    {
        lazy[i]=1;
        push(i, l, r);
//        cout << "l r seg " << l << ' ' << r << ' ' << seg[i] << '\n';
        return;
    }
    long long mid=(l+r)/2;
    push(i*2, l, mid);
    push(i*2+1, mid+1, r);
    if (l<=qr && ql<=mid)
        update(i*2, l, mid, ql, qr);
    if (mid+1<=qr && ql<=r)
        update(i*2+1, mid+1, r, ql, qr);
    seg[i]=(seg[i*2]+seg[i*2+1])%mod;
//    cout << "l r seg " << l << ' ' << r << ' ' << seg[i] << '\n';
}
void init(int N, int M, vector<int> P, vector<int> A)
{
    n=N;
    m=M;
    for (long long i=1; i<n+m; i++)
        adj[P[i]].push_back(i);
    dfs(0);
    dfs2(0, 1);
//    cout << "a: ";
//    for (long long i=0; i<m; i++)
//        cout << a[i+n] << ' ';
//    cout << '\n';
    for (long long i=0; i<m; i++)
        state[i+n]=A[i];
    build(1, n, n+m-1);
}
int count_ways(int L, int R)
{
    update(1, n, n+m-1, L, R);
    return seg[1];
}

Compilation message

circuit.cpp: In function 'void dfs2(long long int, long long int)':
circuit.cpp:29:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (long long i=0; i<adj[u].size(); i++)
      |                         ~^~~~~~~~~~~~~~
circuit.cpp:41:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for (long long i=0; i<adj[u].size(); i++)
      |                         ~^~~~~~~~~~~~~~
circuit.cpp:46:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (long long j=i/sq+1; j<vec.size(); j++)
      |                                  ~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 9272 KB Output is correct
2 Correct 1026 ms 13516 KB Output is correct
3 Correct 989 ms 13532 KB Output is correct
4 Correct 861 ms 13516 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 755 ms 9272 KB Output is correct
2 Correct 1026 ms 13516 KB Output is correct
3 Correct 989 ms 13532 KB Output is correct
4 Correct 861 ms 13516 KB Output is correct
5 Correct 665 ms 9536 KB Output is correct
6 Correct 864 ms 14028 KB Output is correct
7 Correct 971 ms 14024 KB Output is correct
8 Correct 908 ms 12676 KB Output is correct
9 Correct 489 ms 5308 KB Output is correct
10 Correct 914 ms 5548 KB Output is correct
11 Correct 840 ms 5548 KB Output is correct
12 Correct 904 ms 5456 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 3 ms 5072 KB Output is correct
4 Correct 3 ms 5072 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 5 ms 5072 KB Output is correct
9 Correct 3 ms 5180 KB Output is correct
10 Correct 4 ms 5200 KB Output is correct
11 Correct 4 ms 5200 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 755 ms 9272 KB Output is correct
14 Correct 1026 ms 13516 KB Output is correct
15 Correct 989 ms 13532 KB Output is correct
16 Correct 861 ms 13516 KB Output is correct
17 Correct 665 ms 9536 KB Output is correct
18 Correct 864 ms 14028 KB Output is correct
19 Correct 971 ms 14024 KB Output is correct
20 Correct 908 ms 12676 KB Output is correct
21 Correct 489 ms 5308 KB Output is correct
22 Correct 914 ms 5548 KB Output is correct
23 Correct 840 ms 5548 KB Output is correct
24 Correct 904 ms 5456 KB Output is correct
25 Incorrect 1118 ms 19572 KB 101st lines differ - on the 1st token, expected: '74137646', found: '74137647'
26 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 4 ms 5140 KB Output is correct
5 Correct 4 ms 5144 KB Output is correct
6 Correct 5 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 4 ms 5136 KB Output is correct
9 Correct 4 ms 4944 KB Output is correct
10 Correct 4 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 5 ms 5072 KB Output is correct
17 Correct 3 ms 5180 KB Output is correct
18 Correct 4 ms 5200 KB Output is correct
19 Correct 4 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 5 ms 5072 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 3 ms 5180 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 5 ms 5072 KB Output is correct
30 Correct 5 ms 5052 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 5 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 4 ms 5128 KB Output is correct
36 Correct 5 ms 5200 KB Output is correct
37 Correct 5 ms 5200 KB Output is correct
38 Correct 6 ms 5328 KB Output is correct
39 Correct 4 ms 5144 KB Output is correct
40 Correct 3 ms 5160 KB Output is correct
41 Correct 5 ms 5152 KB Output is correct
42 Correct 4 ms 5072 KB Output is correct
43 Correct 531 ms 5456 KB Output is correct
44 Correct 991 ms 5496 KB Output is correct
45 Correct 946 ms 5584 KB Output is correct
46 Correct 809 ms 5896 KB Output is correct
47 Correct 905 ms 5968 KB Output is correct
48 Correct 789 ms 6012 KB Output is correct
49 Correct 1000 ms 5968 KB Output is correct
50 Correct 796 ms 5784 KB Output is correct
51 Correct 944 ms 5616 KB Output is correct
52 Correct 864 ms 5844 KB Output is correct
53 Correct 869 ms 5840 KB Output is correct
54 Correct 898 ms 5968 KB Output is correct
55 Correct 810 ms 5924 KB Output is correct
56 Correct 781 ms 5840 KB Output is correct
57 Correct 848 ms 5712 KB Output is correct
58 Correct 841 ms 6600 KB Output is correct
59 Correct 855 ms 6636 KB Output is correct
60 Correct 892 ms 6400 KB Output is correct
61 Correct 973 ms 5712 KB Output is correct
62 Correct 732 ms 5452 KB Output is correct
63 Correct 685 ms 5456 KB Output is correct
64 Correct 916 ms 5732 KB Output is correct
65 Correct 406 ms 5328 KB Output is correct
66 Correct 766 ms 5584 KB Output is correct
67 Correct 925 ms 5584 KB Output is correct
68 Correct 630 ms 5456 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 4 ms 4944 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 4 ms 5140 KB Output is correct
5 Correct 4 ms 5144 KB Output is correct
6 Correct 5 ms 5072 KB Output is correct
7 Correct 4 ms 5072 KB Output is correct
8 Correct 4 ms 5136 KB Output is correct
9 Correct 4 ms 4944 KB Output is correct
10 Correct 4 ms 5072 KB Output is correct
11 Correct 3 ms 5072 KB Output is correct
12 Correct 3 ms 5072 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5072 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 5 ms 5072 KB Output is correct
17 Correct 3 ms 5180 KB Output is correct
18 Correct 4 ms 5200 KB Output is correct
19 Correct 4 ms 5200 KB Output is correct
20 Correct 3 ms 5072 KB Output is correct
21 Correct 3 ms 5072 KB Output is correct
22 Correct 4 ms 5072 KB Output is correct
23 Correct 3 ms 5072 KB Output is correct
24 Correct 5 ms 5072 KB Output is correct
25 Correct 3 ms 5192 KB Output is correct
26 Correct 4 ms 5072 KB Output is correct
27 Correct 3 ms 5180 KB Output is correct
28 Correct 4 ms 5072 KB Output is correct
29 Correct 5 ms 5072 KB Output is correct
30 Correct 5 ms 5052 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 5 ms 5072 KB Output is correct
33 Correct 3 ms 5072 KB Output is correct
34 Correct 3 ms 5072 KB Output is correct
35 Correct 4 ms 5128 KB Output is correct
36 Correct 5 ms 5200 KB Output is correct
37 Correct 5 ms 5200 KB Output is correct
38 Correct 6 ms 5328 KB Output is correct
39 Correct 4 ms 5144 KB Output is correct
40 Correct 3 ms 5160 KB Output is correct
41 Correct 5 ms 5152 KB Output is correct
42 Correct 4 ms 5072 KB Output is correct
43 Correct 755 ms 9272 KB Output is correct
44 Correct 1026 ms 13516 KB Output is correct
45 Correct 989 ms 13532 KB Output is correct
46 Correct 861 ms 13516 KB Output is correct
47 Correct 665 ms 9536 KB Output is correct
48 Correct 864 ms 14028 KB Output is correct
49 Correct 971 ms 14024 KB Output is correct
50 Correct 908 ms 12676 KB Output is correct
51 Correct 489 ms 5308 KB Output is correct
52 Correct 914 ms 5548 KB Output is correct
53 Correct 840 ms 5548 KB Output is correct
54 Correct 904 ms 5456 KB Output is correct
55 Incorrect 1118 ms 19572 KB 101st lines differ - on the 1st token, expected: '74137646', found: '74137647'
56 Halted 0 ms 0 KB -