Submission #628925

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
628925	2022-08-13 20:33:02	imeimi2000	Digital Circuit (IOI22_circuit)	C++17	100 / 100	1112 ms	29588 KiB

circuit

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000002022;
int n, m;
vector<int> E[200005];
int S[200005], C[200005];
void dfs1(int x) {
    S[x] = max(1, int(E[x].size()));
    for (int i : E[x]) {
        dfs1(i);
        S[x] = 1ll * S[x] * S[i] % mod;
    }
}
void dfs2(int x) {
    // printf("S[%d] = %d, C[%d] = %d\n", x, S[x], x, C[x]);
    vector<int> R(E[x].size());
    R.push_back(1);
    for (int i = E[x].size(); i--; ) {
        R[i] = 1ll * R[i + 1] * S[E[x][i]] % mod;
    }
    int L = 1;
    for (int i = 0; i < int(E[x].size()); ++i) {
        C[E[x][i]] = 1ll * L * R[i + 1] % mod * C[x] % mod;
        dfs2(E[x][i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 4 / 4
• Subtask 5: 12 / 12
• Subtask 6: 27 / 27
• Subtask 7: 28 / 28
• Subtask 8: 11 / 11