Submission #634887

#	Time	Username	Problem	Language	Result	Execution time	Memory
634887		keta_tsimakuridze	Digital Circuit (IOI22_circuit)	C++17	18 / 100	3029 ms	7448 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>2
#define ll long long
using namespace std;
#include <vector>
const int N = 2e5 + 5, mod = 1000002022;
int sub[N], k[N], n, m, a[N];
vector<int> V[N];
void dfs(int u) {
    sub[u] = 1;
    if(V[u].size()) sub[u] = (ll)sub[u] * V[u].size() % mod;
    for(int i = 0; i < V[u].size(); i++) {
        dfs(V[u][i]);
        sub[u] = (ll)sub[u] * sub[V[u][i]] % mod;
    }
}
void dfs2(int u, int cur) {
    vector<int> p(V[u].size()), s(V[u].size());
    k[u] = cur;
    for(int i = 0; i < V[u].size(); i++) {
        p[i] = sub[V[u][i]];
        if(i) p[i] = (ll)p[i] * p[i - 1] % mod;
    }
    for(int i = (int)V[u].size() - 1; i >= 0; i--) {
        s[i] = sub[V[u][i]];
        if(i + 1 != V[u].size()) s[i] = (ll)s[i + 1] * s[i] % mod;
    }
    for(int i = 0; i < V[u].size(); i++) {
        int x = 1;
        if(i) x = (ll)x * p[i - 1] % mod;
        if(i + 1 != V[u].size()) x = (ll)x * s[i + 1] % mod;

        dfs2(V[u][i], (ll)cur * x % mod);
    }
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    n = N, m = M;
    for(int i = 1; i < N + M; i++) {
        V[P[i]].push_back(i);
    }

    for(int i = N; i < N + M; i++) a[i] = A[i - N];

    dfs(0);
    dfs2(0, 1);
}

int count_ways(int L, int R) {


  for(int i = L; i <= R; i++) {
    a[i] ^= 1;
  }
  int ans = 0;
  for(int i = n; i < n + m; i++) {
    ans = (ans + (ll)a[i] * k[i] % mod) % mod;
  }
  return ans;
}

Compilation message (stderr)

circuit.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include <bits/stdc++.h>2
      |                         ^
circuit.cpp: In function 'void dfs(int)':
circuit.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
circuit.cpp: In function 'void dfs2(int, int)':
circuit.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
circuit.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         if(i + 1 != V[u].size()) s[i] = (ll)s[i + 1] * s[i] % mod;
      |            ~~~~~~^~~~~~~~~~~~~~
circuit.cpp:28:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
circuit.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         if(i + 1 != V[u].size()) x = (ll)x * s[i + 1] % mod;
      |            ~~~~~~^~~~~~~~~~~~~~

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