# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225309 | alvinpiter | Solar Storm (NOI20_solarstorm) | C++14 | 922 ms | 122836 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 int
#define MAXN 1000000
#define MAXLG 19
#define DEBUG false
/*
nxt2[i][lg] -> next 2^lg uncovered module if we start covering from module i
*/
int N, S, nxt[MAXN + 3][MAXLG + 2], bestPos;
LL K, pos[MAXN + 3], sumV[MAXN + 3], bestScore;
vector<int> answer;
LL calculateScore(int i) {
int j = i;
for (int lg = 0; lg <= MAXLG && j <= N; lg++) {
if (S & (1 << lg)) {
j = nxt[j][lg];
}
}
return sumV[j - 1] - sumV[i - 1];
}
int main() {
scanf("%d%d%lld", &N, &S, &K);
pos[1] = 0;
Compilation message (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... |