| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1235631 | mariza | Digital Circuit (IOI22_circuit) | C++20 | 6 ms | 1332 KiB |
#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, a[1000], c=0;
void init(int N, int M, vector<int> P, vector<int> A) {
n=N;
m=M;
for(ll i=0; i<m; i++){
a[i]=A[i];
c+=a[i];
}
}
int count_ways(int l, int r) {
for(ll i=l-n; i<=r-n; i++){
c-=a[i];
a[i]^=1;
c+=a[i];
}
return c;
}
| # | 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... | ||||
