# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738515 | 2023-05-09T01:50:20 Z | math_rabbit_1028 | Digital Circuit (IOI22_circuit) | C++17 | 3000 ms | 8224 KB |
#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], wgt[101010]; void get_cnt(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]; get_cnt(next); cnt[v] = (cnt[v] * cnt[next]) % MOD; } } long long get_wgt(int v, int goal) { if (v == goal) return 1; for (int i = 0; i < adj[v].size(); i++) { int next = adj[v][i]; long long ret = get_wgt(next, goal); if (ret > 0) { for (int j = 0; j < adj[v].size(); j++) { if (i != j) ret = (ret * cnt[adj[v][j]]) % MOD; } return ret; } } return 0; } 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); } get_cnt(0); for (int i = n; i < n + m; i++) wgt[i - n] = get_wgt(0, i); for (int i = n; i < n + m; i++) cout << wgt[i - n] << " "; cout << "\n"; } int count_ways(int L, int R) { for (int i = L; i <= R; i++) { onoff[i - n] = 1 - onoff[i - n]; } long long ans = 0; for (int i = n; i < n + m; i++) ans = (ans + onoff[i - n] * wgt[i - n]) % MOD; return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5044 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4944 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5044 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3027 ms | 8224 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3027 ms | 8224 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4944 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5044 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5044 KB | Possible tampering with the output or unexpected termination of the program |
2 | Halted | 0 ms | 0 KB | - |