제출 #1076715

#제출 시각아이디문제언어결과실행 시간메모리
1076715Boas디지털 회로 (IOI22_circuit)C++17
2 / 100
2392 ms2904 KiB
#include "circuit.h" #include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define loop(x, i) for (int i = 0; i < x; i++) #define rev(x, i) for (int i = (int)x - 1; i >= 0; i--) #define ALL(x) begin(x), end(x) #define sz(x) (int)x.size() typedef signed i32; typedef array<int, 2> ii; typedef vector<ii> vii; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<i32> vi32; typedef vector<vi> vvi; constexpr int MOD = 1'000'002'022; vvi children; int n, m; vb a; void init(i32 N, i32 M, vi32 P, vi32 A) { n = N; m = M; children = vvi(N); a = vb(M); loop(sz(P), i) { if (i == 0) continue; children[P[i]].pb(i); } loop(sz(A), i) { a[i] = A[i]; } } i32 count_ways(i32 L, i32 R) { int res = 0; for (int i = L; i <= R; i++) { a[i - n].flip(); } for (bool b : a) if (b) res++; return res; }
#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...