oj.uz

답안 #855579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855579 2023-10-01T13:20:55 Z 12345678 디지털 회로 (IOI22_circuit) C++17
52 / 100
 689 ms 21332 KB 
#include "circuit.h"
 
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
 
const int nx=2e5+5, mod=1e9+2022;
 
int n, m, p[2*nx], sz[2*nx], v[nx];
vector<int> d[nx];
 
void dfs(int u)
{
    for (auto v:d[u]) sz[v]=sz[u]+1, dfs(v);
}
 
struct segtree
{
    int d1[4*nx], d2[4*nx];
    bool lz[4*nx];
    void build(int l, int r, int i, vector<int> &t)
    {
        if (l==r) return t[l]?d1[i]=v[l]:d2[i]=v[l], void();
        int md=(l+r)/2;
        build(l, md, 2*i, t);
        build(md+1, r, 2*i+1, t);
        d1[i]=(d1[2*i]+d1[2*i+1])%mod;
        d2[i]=(d2[2*i]+d2[2*i+1])%mod;
    }
    void pushlz(int l, int r, int i)
    {
        if (!lz[i]) return;
        lz[i]=0; swap(d1[i], d2[i]);
        if (l==r) return;
        lz[2*i]=!lz[2*i];
        lz[2*i+1]=!lz[2*i+1];
    }
    void update(int l, int r, int i, int ql, int qr)
    {
        pushlz(l, r, i);
        if (r<ql||qr<l) return;
        if (ql<=l&&r<=qr) return lz[i]=1, pushlz(l, r, i), void();
        int md=(l+r)/2;
        update(l, md, 2*i, ql, qr);
        update(md+1, r, 2*i+1, ql, qr);
        d1[i]=(d1[2*i]+d1[2*i+1])%mod;
        d2[i]=(d2[2*i]+d2[2*i+1])%mod;
    }
} s;
 
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    p[0]=1; n=N; m=M;
    for (int i=1; i<N+M; i++) p[i]=(p[i-1]*2)%mod;
    for (int i=1; i<N+M; i++) d[P[i]].push_back(i);
    dfs(0);
    for (int i=N; i<N+M; i++) v[i-N]=p[N-sz[i]];
    s.build(0, M-1, 1, A);
}
 
int count_ways(int L, int R) {;
    s.update(0, m-1, 1, L-n, R-n);
    return s.d1[1];
}

/*

2 3
-1 0 1 1 0
0 1 1
2 2
2 3
3 4
*/

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10976 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 10836 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10680 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 10584 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10584 KB Output is correct
10 Correct 3 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10976 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 10836 KB Output is correct
9 Correct 2 ms 10584 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 10680 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10584 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Incorrect 2 ms 10584 KB 1st lines differ - on the 1st token, expected: '759476520', found: '833967706'
22 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 432 ms 12636 KB Output is correct
2 Correct 559 ms 16596 KB Output is correct
3 Correct 639 ms 14804 KB Output is correct
4 Correct 568 ms 14552 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 432 ms 12636 KB Output is correct
2 Correct 559 ms 16596 KB Output is correct
3 Correct 639 ms 14804 KB Output is correct
4 Correct 568 ms 14552 KB Output is correct
5 Correct 491 ms 14680 KB Output is correct
6 Correct 642 ms 16752 KB Output is correct
7 Correct 586 ms 16752 KB Output is correct
8 Correct 603 ms 14804 KB Output is correct
9 Correct 281 ms 8792 KB Output is correct
10 Correct 527 ms 10840 KB Output is correct
11 Correct 563 ms 10840 KB Output is correct
12 Correct 546 ms 9044 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10680 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 10584 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10584 KB Output is correct
10 Correct 3 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 8536 KB Output is correct
13 Correct 432 ms 12636 KB Output is correct
14 Correct 559 ms 16596 KB Output is correct
15 Correct 639 ms 14804 KB Output is correct
16 Correct 568 ms 14552 KB Output is correct
17 Correct 491 ms 14680 KB Output is correct
18 Correct 642 ms 16752 KB Output is correct
19 Correct 586 ms 16752 KB Output is correct
20 Correct 603 ms 14804 KB Output is correct
21 Correct 281 ms 8792 KB Output is correct
22 Correct 527 ms 10840 KB Output is correct
23 Correct 563 ms 10840 KB Output is correct
24 Correct 546 ms 9044 KB Output is correct
25 Correct 619 ms 17276 KB Output is correct
26 Correct 689 ms 17652 KB Output is correct
27 Correct 664 ms 18536 KB Output is correct
28 Correct 508 ms 18512 KB Output is correct
29 Correct 679 ms 20072 KB Output is correct
30 Correct 629 ms 21332 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10976 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 10836 KB Output is correct
9 Correct 2 ms 10584 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 10680 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10584 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Incorrect 2 ms 10584 KB 1st lines differ - on the 1st token, expected: '759476520', found: '833967706'
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10584 KB Output is correct
4 Correct 2 ms 10976 KB Output is correct
5 Correct 2 ms 8536 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 10836 KB Output is correct
9 Correct 2 ms 10584 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 2 ms 10680 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10584 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 2 ms 8536 KB Output is correct
21 Incorrect 2 ms 10584 KB 1st lines differ - on the 1st token, expected: '759476520', found: '833967706'
22 Halted 0 ms 0 KB -