oj.uz

답안 #1058041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058041 2024-08-14T08:05:43 Z aykhn 디지털 회로 (IOI22_circuit) C++17
100 / 100
 730 ms 50996 KB 
#include <bits/stdc++.h>
#include "circuit.h"
 
using namespace std;
 
#define int long long
 
const int MXN = 2e5 + 5;
const int mod = 1e9 + 2022;
 
int n, m, res = 0;
vector<int> A, P;
vector<int> adj[MXN];
int dp[2][MXN], SZ[MXN];
int way[MXN];
 
void _init(int a)
{
  if (adj[a].empty())
  {
    way[a] = 1;
    return;
  }
  way[a] = adj[a].size();
  for (int &v : adj[a])
  {
    _init(v);
    way[a] = (way[a] * way[v]) % mod;
  }
}

int val[MXN];

void dfs(int a, int cur)
{
  if (adj[a].empty())
  {
    val[a] = cur;
    return;
  }
  vector<int> pre(adj[a].size()), suf(adj[a].size());
  for (int i = 0; i < adj[a].size(); i++)
  {
    pre[i] = (i ? pre[i - 1] : 1LL);
    pre[i] = (pre[i] * way[adj[a][i]]) % mod;
  }
  for (int i = (int)adj[a].size() - 1; i >= 0; i--)
  {
    suf[i] = (i + 1 < adj[a].size() ? suf[i + 1] : 1LL);
    suf[i] = (suf[i] * way[adj[a][i]]) % mod;
  }
  for (int i = 0; i < adj[a].size(); i++)
  {
    int A = (i ? pre[i - 1] : 1LL), B = (i + 1 < adj[a].size() ? suf[i + 1] : 1LL);
    dfs(adj[a][i], (((cur * A) % mod) * B) % mod);
  }
}

array<int, 2> st[MXN << 2];
int lz[MXN << 2];

void relax(int l, int r, int x)
{
  if (!lz[x]) return;
  swap(st[x][0], st[x][1]);
  if (l == r)
  {
    lz[x] = 0;
    return;
  }
  lz[2*x] ^= lz[x], lz[2*x + 1] ^= lz[x];
  lz[x] = 0;
}

void upd(int l, int r, int x, int lx, int rx)
{
  relax(l, r, x);
  if (l > rx || r < lx) return;
  if (l >= lx && r <= rx)
  {
    lz[x] ^= 1;
    relax(l, r, x);
    return;
  }
  int mid = (l + r) >> 1;
  upd(l, mid, 2*x, lx, rx);
  upd(mid + 1, r, 2*x + 1, lx, rx);
  st[x][0] = (st[2*x][0] + st[2*x + 1][0]) % mod;
  st[x][1] = (st[2*x][1] + st[2*x + 1][1]) % mod;
}

void build(int l, int r, int x)
{
  if (l == r)
  {
    st[x][0] = A[l] * val[l];
    st[x][1] = (A[l] ^ 1) * val[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, 2*x);
  build(mid + 1, r, 2*x + 1);
  st[x][0] = (st[2*x][0] + st[2*x + 1][0]) % mod;
  st[x][1] = (st[2*x][1] + st[2*x + 1][1]) % mod;
}
 
void init(int32_t N, int32_t M, vector<int32_t> PP, vector<int32_t> AA) 
{
  n = N, m = M;
  for (int32_t &i : PP) P.push_back(i);
  for (int32_t &i : AA) A.push_back(i);
  reverse(A.begin(), A.end());
  A.resize(N + M, 0);
  reverse(A.begin(), A.end());
  for (int i = 1; i < N + M; i++) adj[P[i]].push_back(i);
  _init(0);
  dfs(0, 1);
  build(N, N + M - 1, 1);
}
 
int32_t count_ways(int32_t L, int32_t R) {
  upd(n, n + m - 1, 1, L, R);
  return st[1][0];
}

Compilation message

circuit.cpp: In function 'void dfs(long long int, long long int)':
circuit.cpp:42:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for (int i = 0; i < adj[a].size(); i++)
      |                   ~~^~~~~~~~~~~~~~~
circuit.cpp:49:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     suf[i] = (i + 1 < adj[a].size() ? suf[i + 1] : 1LL);
      |               ~~~~~~^~~~~~~~~~~~~~~
circuit.cpp:52:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for (int i = 0; i < adj[a].size(); i++)
      |                   ~~^~~~~~~~~~~~~~~
circuit.cpp:54:48: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     int A = (i ? pre[i - 1] : 1LL), B = (i + 1 < adj[a].size() ? suf[i + 1] : 1LL);
      |                                          ~~~~~~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 1 ms 10840 KB Output is correct
3 Correct 1 ms 11096 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 11096 KB Output is correct
6 Correct 1 ms 11096 KB Output is correct
7 Correct 2 ms 11368 KB Output is correct
8 Correct 1 ms 11096 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 1 ms 10840 KB Output is correct
3 Correct 1 ms 11096 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 11096 KB Output is correct
6 Correct 1 ms 11096 KB Output is correct
7 Correct 2 ms 11368 KB Output is correct
8 Correct 1 ms 11096 KB Output is correct
9 Correct 1 ms 10840 KB Output is correct
10 Correct 1 ms 10840 KB Output is correct
11 Correct 1 ms 11096 KB Output is correct
12 Correct 1 ms 11096 KB Output is correct
13 Correct 1 ms 11256 KB Output is correct
14 Correct 2 ms 11096 KB Output is correct
15 Correct 1 ms 11096 KB Output is correct
16 Correct 1 ms 11096 KB Output is correct
17 Correct 1 ms 11096 KB Output is correct
18 Correct 2 ms 11352 KB Output is correct
19 Correct 2 ms 11352 KB Output is correct
20 Correct 1 ms 11096 KB Output is correct
21 Correct 1 ms 11096 KB Output is correct
22 Correct 1 ms 11256 KB Output is correct
23 Correct 2 ms 11256 KB Output is correct
24 Correct 2 ms 11096 KB Output is correct
25 Correct 2 ms 11096 KB Output is correct
26 Correct 2 ms 11096 KB Output is correct
27 Correct 2 ms 11348 KB Output is correct
28 Correct 1 ms 11096 KB Output is correct
29 Correct 1 ms 11096 KB Output is correct
30 Correct 1 ms 11096 KB Output is correct
31 Correct 1 ms 11096 KB Output is correct
32 Correct 1 ms 11096 KB Output is correct
33 Correct 2 ms 11096 KB Output is correct
34 Correct 1 ms 11096 KB Output is correct
35 Correct 1 ms 11096 KB Output is correct
36 Correct 1 ms 11352 KB Output is correct
37 Correct 2 ms 11352 KB Output is correct
38 Correct 2 ms 11352 KB Output is correct
39 Correct 2 ms 11096 KB Output is correct
40 Correct 1 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 1 ms 11096 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 18004 KB Output is correct
2 Correct 536 ms 20780 KB Output is correct
3 Correct 607 ms 20816 KB Output is correct
4 Correct 558 ms 20780 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 18004 KB Output is correct
2 Correct 536 ms 20780 KB Output is correct
3 Correct 607 ms 20816 KB Output is correct
4 Correct 558 ms 20780 KB Output is correct
5 Correct 495 ms 18128 KB Output is correct
6 Correct 568 ms 22264 KB Output is correct
7 Correct 564 ms 21076 KB Output is correct
8 Correct 471 ms 22128 KB Output is correct
9 Correct 235 ms 11096 KB Output is correct
10 Correct 578 ms 13656 KB Output is correct
11 Correct 587 ms 13400 KB Output is correct
12 Correct 440 ms 13400 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10840 KB Output is correct
2 Correct 1 ms 10840 KB Output is correct
3 Correct 1 ms 11096 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 1 ms 11256 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 1 ms 11096 KB Output is correct
8 Correct 1 ms 11096 KB Output is correct
9 Correct 1 ms 11096 KB Output is correct
10 Correct 2 ms 11352 KB Output is correct
11 Correct 2 ms 11352 KB Output is correct
12 Correct 1 ms 11096 KB Output is correct
13 Correct 331 ms 18004 KB Output is correct
14 Correct 536 ms 20780 KB Output is correct
15 Correct 607 ms 20816 KB Output is correct
16 Correct 558 ms 20780 KB Output is correct
17 Correct 495 ms 18128 KB Output is correct
18 Correct 568 ms 22264 KB Output is correct
19 Correct 564 ms 21076 KB Output is correct
20 Correct 471 ms 22128 KB Output is correct
21 Correct 235 ms 11096 KB Output is correct
22 Correct 578 ms 13656 KB Output is correct
23 Correct 587 ms 13400 KB Output is correct
24 Correct 440 ms 13400 KB Output is correct
25 Correct 565 ms 20940 KB Output is correct
26 Correct 676 ms 26704 KB Output is correct
27 Correct 568 ms 26712 KB Output is correct
28 Correct 399 ms 25764 KB Output is correct
29 Correct 613 ms 48744 KB Output is correct
30 Correct 666 ms 47524 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 1 ms 10840 KB Output is correct
3 Correct 1 ms 11096 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 11096 KB Output is correct
6 Correct 1 ms 11096 KB Output is correct
7 Correct 2 ms 11368 KB Output is correct
8 Correct 1 ms 11096 KB Output is correct
9 Correct 1 ms 10840 KB Output is correct
10 Correct 1 ms 10840 KB Output is correct
11 Correct 1 ms 11096 KB Output is correct
12 Correct 1 ms 11096 KB Output is correct
13 Correct 1 ms 11256 KB Output is correct
14 Correct 2 ms 11096 KB Output is correct
15 Correct 1 ms 11096 KB Output is correct
16 Correct 1 ms 11096 KB Output is correct
17 Correct 1 ms 11096 KB Output is correct
18 Correct 2 ms 11352 KB Output is correct
19 Correct 2 ms 11352 KB Output is correct
20 Correct 1 ms 11096 KB Output is correct
21 Correct 1 ms 11096 KB Output is correct
22 Correct 1 ms 11256 KB Output is correct
23 Correct 2 ms 11256 KB Output is correct
24 Correct 2 ms 11096 KB Output is correct
25 Correct 2 ms 11096 KB Output is correct
26 Correct 2 ms 11096 KB Output is correct
27 Correct 2 ms 11348 KB Output is correct
28 Correct 1 ms 11096 KB Output is correct
29 Correct 1 ms 11096 KB Output is correct
30 Correct 1 ms 11096 KB Output is correct
31 Correct 1 ms 11096 KB Output is correct
32 Correct 1 ms 11096 KB Output is correct
33 Correct 2 ms 11096 KB Output is correct
34 Correct 1 ms 11096 KB Output is correct
35 Correct 1 ms 11096 KB Output is correct
36 Correct 1 ms 11352 KB Output is correct
37 Correct 2 ms 11352 KB Output is correct
38 Correct 2 ms 11352 KB Output is correct
39 Correct 2 ms 11096 KB Output is correct
40 Correct 1 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 1 ms 11096 KB Output is correct
43 Correct 336 ms 13400 KB Output is correct
44 Correct 579 ms 13400 KB Output is correct
45 Correct 545 ms 13400 KB Output is correct
46 Correct 509 ms 13656 KB Output is correct
47 Correct 581 ms 13912 KB Output is correct
48 Correct 559 ms 13656 KB Output is correct
49 Correct 584 ms 13656 KB Output is correct
50 Correct 540 ms 13400 KB Output is correct
51 Correct 497 ms 13412 KB Output is correct
52 Correct 488 ms 13516 KB Output is correct
53 Correct 489 ms 12376 KB Output is correct
54 Correct 574 ms 13656 KB Output is correct
55 Correct 491 ms 13560 KB Output is correct
56 Correct 576 ms 13400 KB Output is correct
57 Correct 437 ms 13456 KB Output is correct
58 Correct 477 ms 14680 KB Output is correct
59 Correct 507 ms 14936 KB Output is correct
60 Correct 437 ms 14680 KB Output is correct
61 Correct 508 ms 13656 KB Output is correct
62 Correct 477 ms 13400 KB Output is correct
63 Correct 579 ms 13400 KB Output is correct
64 Correct 550 ms 13400 KB Output is correct
65 Correct 266 ms 11096 KB Output is correct
66 Correct 499 ms 13400 KB Output is correct
67 Correct 507 ms 13400 KB Output is correct
68 Correct 513 ms 13400 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 1 ms 10840 KB Output is correct
3 Correct 1 ms 11096 KB Output is correct
4 Correct 1 ms 11096 KB Output is correct
5 Correct 2 ms 11096 KB Output is correct
6 Correct 1 ms 11096 KB Output is correct
7 Correct 2 ms 11368 KB Output is correct
8 Correct 1 ms 11096 KB Output is correct
9 Correct 1 ms 10840 KB Output is correct
10 Correct 1 ms 10840 KB Output is correct
11 Correct 1 ms 11096 KB Output is correct
12 Correct 1 ms 11096 KB Output is correct
13 Correct 1 ms 11256 KB Output is correct
14 Correct 2 ms 11096 KB Output is correct
15 Correct 1 ms 11096 KB Output is correct
16 Correct 1 ms 11096 KB Output is correct
17 Correct 1 ms 11096 KB Output is correct
18 Correct 2 ms 11352 KB Output is correct
19 Correct 2 ms 11352 KB Output is correct
20 Correct 1 ms 11096 KB Output is correct
21 Correct 1 ms 11096 KB Output is correct
22 Correct 1 ms 11256 KB Output is correct
23 Correct 2 ms 11256 KB Output is correct
24 Correct 2 ms 11096 KB Output is correct
25 Correct 2 ms 11096 KB Output is correct
26 Correct 2 ms 11096 KB Output is correct
27 Correct 2 ms 11348 KB Output is correct
28 Correct 1 ms 11096 KB Output is correct
29 Correct 1 ms 11096 KB Output is correct
30 Correct 1 ms 11096 KB Output is correct
31 Correct 1 ms 11096 KB Output is correct
32 Correct 1 ms 11096 KB Output is correct
33 Correct 2 ms 11096 KB Output is correct
34 Correct 1 ms 11096 KB Output is correct
35 Correct 1 ms 11096 KB Output is correct
36 Correct 1 ms 11352 KB Output is correct
37 Correct 2 ms 11352 KB Output is correct
38 Correct 2 ms 11352 KB Output is correct
39 Correct 2 ms 11096 KB Output is correct
40 Correct 1 ms 11096 KB Output is correct
41 Correct 2 ms 11096 KB Output is correct
42 Correct 1 ms 11096 KB Output is correct
43 Correct 331 ms 18004 KB Output is correct
44 Correct 536 ms 20780 KB Output is correct
45 Correct 607 ms 20816 KB Output is correct
46 Correct 558 ms 20780 KB Output is correct
47 Correct 495 ms 18128 KB Output is correct
48 Correct 568 ms 22264 KB Output is correct
49 Correct 564 ms 21076 KB Output is correct
50 Correct 471 ms 22128 KB Output is correct
51 Correct 235 ms 11096 KB Output is correct
52 Correct 578 ms 13656 KB Output is correct
53 Correct 587 ms 13400 KB Output is correct
54 Correct 440 ms 13400 KB Output is correct
55 Correct 565 ms 20940 KB Output is correct
56 Correct 676 ms 26704 KB Output is correct
57 Correct 568 ms 26712 KB Output is correct
58 Correct 399 ms 25764 KB Output is correct
59 Correct 613 ms 48744 KB Output is correct
60 Correct 666 ms 47524 KB Output is correct
61 Correct 336 ms 13400 KB Output is correct
62 Correct 579 ms 13400 KB Output is correct
63 Correct 545 ms 13400 KB Output is correct
64 Correct 509 ms 13656 KB Output is correct
65 Correct 581 ms 13912 KB Output is correct
66 Correct 559 ms 13656 KB Output is correct
67 Correct 584 ms 13656 KB Output is correct
68 Correct 540 ms 13400 KB Output is correct
69 Correct 497 ms 13412 KB Output is correct
70 Correct 488 ms 13516 KB Output is correct
71 Correct 489 ms 12376 KB Output is correct
72 Correct 574 ms 13656 KB Output is correct
73 Correct 491 ms 13560 KB Output is correct
74 Correct 576 ms 13400 KB Output is correct
75 Correct 437 ms 13456 KB Output is correct
76 Correct 477 ms 14680 KB Output is correct
77 Correct 507 ms 14936 KB Output is correct
78 Correct 437 ms 14680 KB Output is correct
79 Correct 508 ms 13656 KB Output is correct
80 Correct 477 ms 13400 KB Output is correct
81 Correct 579 ms 13400 KB Output is correct
82 Correct 550 ms 13400 KB Output is correct
83 Correct 266 ms 11096 KB Output is correct
84 Correct 499 ms 13400 KB Output is correct
85 Correct 507 ms 13400 KB Output is correct
86 Correct 513 ms 13400 KB Output is correct
87 Correct 2 ms 10840 KB Output is correct
88 Correct 442 ms 26448 KB Output is correct
89 Correct 529 ms 21356 KB Output is correct
90 Correct 582 ms 22488 KB Output is correct
91 Correct 514 ms 26820 KB Output is correct
92 Correct 605 ms 27328 KB Output is correct
93 Correct 668 ms 27336 KB Output is correct
94 Correct 626 ms 27500 KB Output is correct
95 Correct 609 ms 27540 KB Output is correct
96 Correct 599 ms 21016 KB Output is correct
97 Correct 562 ms 22688 KB Output is correct
98 Correct 551 ms 40384 KB Output is correct
99 Correct 621 ms 26780 KB Output is correct
100 Correct 563 ms 25148 KB Output is correct
101 Correct 684 ms 24220 KB Output is correct
102 Correct 584 ms 23104 KB Output is correct
103 Correct 664 ms 48616 KB Output is correct
104 Correct 730 ms 50972 KB Output is correct
105 Correct 609 ms 50996 KB Output is correct
106 Correct 589 ms 26016 KB Output is correct
107 Correct 618 ms 23560 KB Output is correct
108 Correct 538 ms 23512 KB Output is correct
109 Correct 565 ms 22856 KB Output is correct