Submission #910884

#TimeUsernameProblemLanguageResultExecution timeMemory
910884ALTAKEXEDigital Circuit (IOI22_circuit)C++17
0 / 100
348 ms5448 KiB
#include "circuit.h" #include <bits/stdc++.h> #define ll long long int const ll MOD = 1000002022; ll st[8000001], a[1000001], p[1000001]; ll n, m; void init(int N, int M, std::vector<int> P, std::vector<int> A) { n = N; m = M; for (int i = 0; i < N + M; i++) p[i] = P[i]; for (int i = 0; i < M; i++) a[i] = A[i]; } int count_ways(int L, int R) { ll cnt = 0; for (int i = L - 1; i < R; i++) { cnt += a[i]; } return cnt; }
#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...