# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1167098 | SmuggingSpun | 디지털 회로 (IOI22_circuit) | C++20 | 1504 ms | 1576 KiB |
#include<bits/stdc++.h>
#include "circuit.h"
using namespace std;
const int lim = 2e5 + 5;
int n, m, a[lim], parent[lim];
void init(int __n, int __m, vector<int>__p, vector<int>__a){
n = __n;
m = __m;
for(int i = 0; i < n + m; i++){
parent[i] = __p[i];
}
for(int i = 0; i < m; i++){
a[i + n] = __a[i];
}
}
int count_ways(int l, int r){
for(int i = l; i <= r; i++){
a[i] ^= 1;
}
if(n == 1 && m <= 1000){
return count(a + n, a + n + m + 1, 1);
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |