oj.uz

답안 #642960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
642960 2022-09-21T00:22:54 Z Pajaraja 디지털 회로 (IOI22_circuit) C++17
62 / 100
 1043 ms 16176 KB 
#include "circuit.h"
#include <bits/stdc++.h>
#include <vector>
#define MAXN 200007
#define MOD 1000002022
using namespace std;
vector<int> g[MAXN];
long long a[MAXN],t[MAXN],seg[2][MAXN];
int n,m,p[MAXN],st[MAXN],bag[MAXN];
void dfst(int s)
{
    for(int i=0;i<g[s].size();i++) dfst(g[s][i]);
    if(g[s].size()==0) t[s]=1;
    else t[s]=g[s].size();
    for(int i=0;i<g[s].size();i++) t[s]=(t[s]*t[g[s][i]])%MOD;
}
void dfs(int s,long long p)
{
    if(s>=n) {a[s-n]=p%MOD; return;}
    vector<long long> lv(g[s].size()+7),ds(g[s].size()+7);
    ds[0]=1; lv[g[s].size()+1]=1;
    for(int i=0;i<g[s].size();i++) ds[i+1]=(ds[i]*t[g[s][i]])%MOD;
    for(int i=g[s].size()-1;i>=0;i--) lv[i+1]=(lv[i+2]*t[g[s][i]])%MOD;
    for(int i=0;i<g[s].size();i++) dfs(g[s][i],(p*((ds[i]*lv[i+2])%MOD))%MOD);
}
void build(int l,int r,int ind)
{
    if(l==r) {seg[st[l]][ind]=a[l]; return;}
    int s=(l+r)/2;
    build(l,s,2*ind);
    build(s+1,r,2*ind+1);
    for(int k=0;k<2;k++) seg[k][ind]=(seg[k][2*ind]+seg[k][2*ind+1])%MOD;
}
void relax(int ind)
{
    bag[2*ind]^=bag[ind]; bag[2*ind+1]^=bag[ind];
    bag[ind]=0;
    for(int k=0;k<2;k++) seg[k][ind]=(seg[k^bag[2*ind]][2*ind]+seg[k^bag[2*ind+1]][2*ind+1])%MOD;
}
void upd(int lt,int rt,int l,int r,int ind)
{
    if(r<lt || l>rt) return;
    if(l>=lt && r<=rt) {bag[ind]^=1; return;}
    relax(ind);
    int s=(l+r)/2;
    upd(lt,rt,l,s,2*ind);
    upd(lt,rt,s+1,r,2*ind+1);
    for(int k=0;k<2;k++) seg[k][ind]=(seg[k^bag[2*ind]][2*ind]+seg[k^bag[2*ind+1]][2*ind+1])%MOD;
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    n=N; m=M;
    for(int i=1;i<N+M;i++) g[P[i]].push_back(i);
    for(int i=0;i<M;i++) st[i]=A[i];
    dfst(0); dfs(0,1);
    build(0,m-1,1);
}

int count_ways(int L, int R) {
    upd(L-n,R-n,0,m-1,1);
    return seg[1^bag[1]][1];
}

Compilation message

circuit.cpp: In function 'void dfst(int)':
circuit.cpp:12:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i=0;i<g[s].size();i++) dfst(g[s][i]);
      |                 ~^~~~~~~~~~~~
circuit.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=0;i<g[s].size();i++) t[s]=(t[s]*t[g[s][i]])%MOD;
      |                 ~^~~~~~~~~~~~
circuit.cpp: In function 'void dfs(int, long long int)':
circuit.cpp:22:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for(int i=0;i<g[s].size();i++) ds[i+1]=(ds[i]*t[g[s][i]])%MOD;
      |                 ~^~~~~~~~~~~~
circuit.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<g[s].size();i++) dfs(g[s][i],(p*((ds[i]*lv[i+2])%MOD))%MOD);
      |                 ~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 4 ms 5132 KB Output is correct
4 Correct 3 ms 5124 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5132 KB Output is correct
8 Correct 3 ms 5136 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 3 ms 4944 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 5096 KB Output is correct
6 Correct 4 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 4 ms 5328 KB Output is correct
11 Correct 3 ms 5328 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 4 ms 5132 KB Output is correct
4 Correct 3 ms 5124 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5132 KB Output is correct
8 Correct 3 ms 5136 KB Output is correct
9 Correct 4 ms 5024 KB Output is correct
10 Correct 3 ms 4944 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 5096 KB Output is correct
14 Correct 4 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 4 ms 5328 KB Output is correct
19 Correct 3 ms 5328 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5144 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 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 3 ms 5072 KB Output is correct
30 Correct 3 ms 5072 KB Output is correct
31 Correct 3 ms 5328 KB Output is correct
32 Correct 3 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 3 ms 5072 KB Output is correct
36 Correct 3 ms 5440 KB Output is correct
37 Correct 4 ms 5328 KB Output is correct
38 Correct 4 ms 5456 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 707 ms 8740 KB Output is correct
2 Correct 901 ms 12400 KB Output is correct
3 Correct 1043 ms 11944 KB Output is correct
4 Correct 987 ms 11868 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 707 ms 8740 KB Output is correct
2 Correct 901 ms 12400 KB Output is correct
3 Correct 1043 ms 11944 KB Output is correct
4 Correct 987 ms 11868 KB Output is correct
5 Correct 852 ms 8764 KB Output is correct
6 Correct 935 ms 12360 KB Output is correct
7 Correct 767 ms 12416 KB Output is correct
8 Correct 1043 ms 12360 KB Output is correct
9 Correct 465 ms 5200 KB Output is correct
10 Correct 980 ms 5456 KB Output is correct
11 Correct 912 ms 5456 KB Output is correct
12 Correct 916 ms 5456 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5024 KB Output is correct
2 Correct 3 ms 4944 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 5096 KB Output is correct
6 Correct 4 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 4 ms 5328 KB Output is correct
11 Correct 3 ms 5328 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 707 ms 8740 KB Output is correct
14 Correct 901 ms 12400 KB Output is correct
15 Correct 1043 ms 11944 KB Output is correct
16 Correct 987 ms 11868 KB Output is correct
17 Correct 852 ms 8764 KB Output is correct
18 Correct 935 ms 12360 KB Output is correct
19 Correct 767 ms 12416 KB Output is correct
20 Correct 1043 ms 12360 KB Output is correct
21 Correct 465 ms 5200 KB Output is correct
22 Correct 980 ms 5456 KB Output is correct
23 Correct 912 ms 5456 KB Output is correct
24 Correct 916 ms 5456 KB Output is correct
25 Incorrect 996 ms 16176 KB 1st lines differ - on the 1st token, expected: '732332002', found: '764399548'
26 Halted 0 ms 0 KB -

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 4 ms 5132 KB Output is correct
4 Correct 3 ms 5124 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5132 KB Output is correct
8 Correct 3 ms 5136 KB Output is correct
9 Correct 4 ms 5024 KB Output is correct
10 Correct 3 ms 4944 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 5096 KB Output is correct
14 Correct 4 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 4 ms 5328 KB Output is correct
19 Correct 3 ms 5328 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5144 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 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 3 ms 5072 KB Output is correct
30 Correct 3 ms 5072 KB Output is correct
31 Correct 3 ms 5328 KB Output is correct
32 Correct 3 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 3 ms 5072 KB Output is correct
36 Correct 3 ms 5440 KB Output is correct
37 Correct 4 ms 5328 KB Output is correct
38 Correct 4 ms 5456 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Correct 664 ms 5328 KB Output is correct
44 Correct 927 ms 5456 KB Output is correct
45 Correct 670 ms 5444 KB Output is correct
46 Correct 828 ms 5712 KB Output is correct
47 Correct 910 ms 5684 KB Output is correct
48 Correct 916 ms 5712 KB Output is correct
49 Correct 923 ms 5716 KB Output is correct
50 Correct 862 ms 5712 KB Output is correct
51 Correct 963 ms 5604 KB Output is correct
52 Correct 808 ms 5584 KB Output is correct
53 Correct 773 ms 6736 KB Output is correct
54 Correct 832 ms 5712 KB Output is correct
55 Correct 956 ms 5584 KB Output is correct
56 Correct 926 ms 5584 KB Output is correct
57 Correct 950 ms 5532 KB Output is correct
58 Correct 867 ms 7104 KB Output is correct
59 Correct 985 ms 7232 KB Output is correct
60 Correct 971 ms 7236 KB Output is correct
61 Correct 925 ms 5712 KB Output is correct
62 Correct 946 ms 5328 KB Output is correct
63 Correct 922 ms 5384 KB Output is correct
64 Correct 936 ms 5584 KB Output is correct
65 Correct 409 ms 5200 KB Output is correct
66 Correct 730 ms 5456 KB Output is correct
67 Correct 811 ms 5456 KB Output is correct
68 Correct 956 ms 5456 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 3 ms 4944 KB Output is correct
3 Correct 4 ms 5132 KB Output is correct
4 Correct 3 ms 5124 KB Output is correct
5 Correct 3 ms 5072 KB Output is correct
6 Correct 3 ms 5072 KB Output is correct
7 Correct 3 ms 5132 KB Output is correct
8 Correct 3 ms 5136 KB Output is correct
9 Correct 4 ms 5024 KB Output is correct
10 Correct 3 ms 4944 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 5096 KB Output is correct
14 Correct 4 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 4 ms 5328 KB Output is correct
19 Correct 3 ms 5328 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 4 ms 5144 KB Output is correct
22 Correct 3 ms 5072 KB Output is correct
23 Correct 5 ms 5072 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 4 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 3 ms 5072 KB Output is correct
30 Correct 3 ms 5072 KB Output is correct
31 Correct 3 ms 5328 KB Output is correct
32 Correct 3 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 3 ms 5072 KB Output is correct
36 Correct 3 ms 5440 KB Output is correct
37 Correct 4 ms 5328 KB Output is correct
38 Correct 4 ms 5456 KB Output is correct
39 Correct 3 ms 5072 KB Output is correct
40 Correct 3 ms 5072 KB Output is correct
41 Correct 3 ms 5072 KB Output is correct
42 Correct 3 ms 5072 KB Output is correct
43 Correct 707 ms 8740 KB Output is correct
44 Correct 901 ms 12400 KB Output is correct
45 Correct 1043 ms 11944 KB Output is correct
46 Correct 987 ms 11868 KB Output is correct
47 Correct 852 ms 8764 KB Output is correct
48 Correct 935 ms 12360 KB Output is correct
49 Correct 767 ms 12416 KB Output is correct
50 Correct 1043 ms 12360 KB Output is correct
51 Correct 465 ms 5200 KB Output is correct
52 Correct 980 ms 5456 KB Output is correct
53 Correct 912 ms 5456 KB Output is correct
54 Correct 916 ms 5456 KB Output is correct
55 Incorrect 996 ms 16176 KB 1st lines differ - on the 1st token, expected: '732332002', found: '764399548'
56 Halted 0 ms 0 KB -