Submission #1219784

#TimeUsernameProblemLanguageResultExecution timeMemory
1219784bangan디지털 회로 (IOI22_circuit)C++20
0 / 100
6 ms1196 KiB
#include "circuit.h" #include <vector> #include <bits/stdc++.h> int n, m; std::vector<int> p, a; void init(int N, int M, std::vector<int> P, std::vector<int> A) { assert(N == 1); n = N; m = M; p = P; a = A; } int count_ways(int L, int R) { for (int i = L; i <= R; i++) { a[i] ^= 1; } int k = 0; for (int i = L; i <= R; i++) { k += a[i]; } return m - k + 1; }
#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...