제출 #627313

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
627313	2022-08-12 12:45:12	haojiandan	디지털 회로 (IOI22_circuit)	C++17	100 / 100	1020 ms	20512 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;
typedef long long ll;
const int mod=(1e9)+2022;
const int maxn=(2e5)+10;
vector<int> son[maxn];
int prod[maxn],n,m;
void dfs1(int u) {
  prod[u]=1;
  if ((int)son[u].size()==0) return;
  prod[u]=(int)son[u].size();
  for (int &v : son[u]) dfs1(v),prod[u]=(ll)prod[u]*prod[v]%mod;
}
int sum[maxn];
int pre[maxn],suf[maxn];
void dfs2(int u) {
  int sz=(int)son[u].size();
  for (int i=0;i<sz;i++) pre[i]=(ll)(i==0?1:pre[i-1])*prod[son[u][i]]%mod;
  for (int i=sz-1;i>=0;i--) suf[i]=(ll)(i==sz-1?1:suf[i+1])*prod[son[u][i]]%mod;
  for (int i=0;i<sz;i++) {
    int v=son[u][i];
    sum[v]=sum[u];
    if (i) sum[v]=(ll)sum[v]*pre[i-1]%mod;
    if (i<sz-1) sum[v]=(ll)sum[v]*suf[i+1]%mod;
  }
  for (int &v : son[u]) {
    dfs2(v);
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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