# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092715 | _rain_ | Solar Storm (NOI20_solarstorm) | C++14 | 284 ms | 138176 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define BIT(mask,x) (((mask)>>(x))&(1))
#define MASK(x) (((ll)(1)<<(x)))
const int maxn = 1e6;
const int maxlog = 20;
ll d[maxn+2] , v[maxn+2] , pre[maxn+2] , sum = 0 , k;
int s , n;
int r[maxn+2] , par[maxn+2][maxlog+2];
int jump(int u , int step){
for (int i = 0; i <= maxlog; ++i)
if (BIT(step,i)) u = par[u][i];
return u;
}
ll Get(int L , int R){
return pre[R]-pre[L-1];
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> s >> k;
d[1] = 1;
for (int i = 2; i <= n; ++i) {
ll x; cin >> x;
d[i] = d[i - 1] + x;
# | 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... |