| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312444 | kawhiet | 디지털 회로 (IOI22_circuit) | C++20 | 2883 ms | 1304 KiB |
#include <bits/stdc++.h>
#include "circuit.h"
using namespace std;
constexpr int N = 2e5 + 5;
vector<int> c;
void init(int n, int m, vector<int> p, vector<int> a) {
c.resize(n + m);
for (int i = 0; i < m; i++) {
c[i + n] = a[i];
}
}
int count_ways(int l, int r) {
for (int i = l; i <= r; i++) {
c[i] ^= 1;
}
int sum = accumulate(c.begin(), c.end(), 0);
return sum;
}| # | 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... | ||||
