Submission #737933

#TimeUsernameProblemLanguageResultExecution timeMemory
737933math_rabbit_1028Digital Circuit (IOI22_circuit)C++17
18 / 100
3099 ms7856 KiB
#include "circuit.h" #include <vector> #include <bits/stdc++.h> using namespace std; int n, m, onoff[101010], par[202020]; vector<int> adj[202020]; const long long MOD = 1000002022; long long cnt[202020], dp[202020]; void DFS(int v) { if (v < n) cnt[v] = adj[v].size(); else cnt[v] = 1; for (int i = 0; i < adj[v].size(); i++) { int next = adj[v][i]; DFS(next); cnt[v] = (cnt[v] * cnt[next]) % MOD; } } void init(int N, int M, std::vector<int> P, std::vector<int> A) { n = N; m = M; for (int i = 0; i < n + m; i++) par[i] = P[i]; for (int i = 0; i < m; i++) onoff[i] = A[i]; for (int i = 1; i < n + m; i++) { adj[par[i]].push_back(i); } DFS(0); } void solve(int v) { if (v < n) dp[v] = 0; else dp[v] = onoff[v - n]; for (int i = 0; i < adj[v].size(); i++) { int next = adj[v][i]; solve(next); long long t = dp[next]; for (int j = 0; j < adj[v].size(); j++) { if (i != j) t = (t * cnt[adj[v][j]]) % MOD; } dp[v] = (dp[v] + t) % MOD; } } int count_ways(int L, int R) { for (int i = L; i <= R; i++) { onoff[i - n] = 1 - onoff[i - n]; } solve(0); return dp[0]; }

Compilation message (stderr)

circuit.cpp: In function 'void DFS(int)':
circuit.cpp:16:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for (int i = 0; i < adj[v].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
circuit.cpp: In function 'void solve(int)':
circuit.cpp:39:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for (int i = 0; i < adj[v].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
circuit.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int j = 0; j < adj[v].size(); j++) {
      |                     ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...