| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1219784 | bangan | 디지털 회로 (IOI22_circuit) | C++20 | 6 ms | 1196 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
