제출 #627371

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
627371	2022-08-12 13:57:27	Elegia	디지털 회로 (IOI22_circuit)	C++17	2 / 100	3022 ms	3664 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 <algorithm>
#include <iostream>
#include <vector>
using ull = unsigned long long;
const int MOD = 1000002022;
int N, M;
std::vector<int> P, A, prod;
std::vector<std::vector<int>> ch;
void init(int _N, int _M, std::vector<int> _P, std::vector<int> _A) {
  N = _N; M = _M;
  P = _P;
  prod.resize(N + M);
  std::fill(prod.begin() + N, prod.end(), 1);
  for (int i = 1; i != N + M; ++i) ++prod[P[i]];
  for (int i = N - 1; i; --i) prod[P[i]] *= prod[i];
  A.resize(N + M);
  std::copy(_A.begin(), _A.end(), A.begin() + N);
  ch.resize(N);
  for (int i = 1; i != N + M; ++i) ch[P[i]].push_back(i);
}
int count_ways(int L, int R) {
  for (int i = L; i <= R; ++i) A[i] = !A[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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