oj.uz

Submission #225309

# Submission time Handle Problem Language Result Execution time Memory
225309 2020-04-20T09:08:32 Z alvinpiter Solar Storm (NOI20_solarstorm) C++14
100 / 100
 922 ms 122836 KB 
#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;
    pos[N + 1] = 1e18;
    for (int i = 2; i <= N; i++) {
        int d;
        scanf("%d", &d);

        pos[i] = pos[i - 1] + d;
    }

    sumV[0] = 0;
    for (int i = 1; i <= N; i++) {
        int v;
        scanf("%d", &v);

        sumV[i] = sumV[i - 1] + v;
    }

    for (int i = 1; i <= N; i++) {
        int p1 = lower_bound(pos + 1, pos + N + 1, pos[i] + K) - pos;

        if (pos[p1] > pos[i] + K)
            p1 -= 1;

        int p2 = lower_bound(pos + 1, pos + N + 1, pos[p1] + K) - pos;

        if (pos[p2] == pos[p1] + K)
            p2 += 1;

        nxt[i][0] = p2;
    }

    for (int lg = 1; lg <= MAXLG; lg++) {
        for (int i = 1; i <= N; i++) {
            int j = nxt[i][lg - 1];

            if (j == N + 1)
                nxt[i][lg] = j;
            else
                nxt[i][lg] = nxt[nxt[i][lg - 1]][lg - 1];
        }
    }

    bestScore = 0;
    for (int l = 1; l <= N; l++) {
        LL score = calculateScore(l);
        if (score > bestScore) {
            bestScore = score;
            bestPos = l;
        }
    }

    int cur = bestPos;
    for (int rep = 1; rep <= S && cur <= N; rep++) {
        int p = lower_bound(pos + 1, pos + N + 1, pos[cur] + K) - pos;
        if (pos[p] > pos[cur] + K)
            p -= 1;

        answer.push_back(p);

        cur = nxt[cur][0];
    }

    printf("%d\n", (int) answer.size());
    for (int i = 0; i < (int) answer.size(); i++) {
        if (i > 0) printf(" ");
        printf("%d", answer[i]);
    }
    printf("\n");
}

/*
6 2 7
10 4 7 18 11
5 8 2 4 8 12

6 2 38
10 4 7 18 11
5 8 2 4 8 12

10 3 1
2 2 2 2 2 2 2 2 2
3 7 5 6 8 4 3 2 2 9
*/

Compilation message

SolarStorm.cpp: In function 'int main()':
SolarStorm.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%lld", &N, &S, &K);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
SolarStorm.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &d);
         ~~~~~^~~~~~~~~~
SolarStorm.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &v);
         ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 10 ms 1408 KB Output is correct
12 Correct 7 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 440 ms 87032 KB Output is correct
2 Correct 309 ms 57244 KB Output is correct
3 Correct 340 ms 60792 KB Output is correct
4 Correct 390 ms 65784 KB Output is correct
5 Correct 495 ms 76232 KB Output is correct
6 Correct 645 ms 100308 KB Output is correct
7 Correct 433 ms 69120 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 10 ms 1408 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 440 ms 87032 KB Output is correct
14 Correct 309 ms 57244 KB Output is correct
15 Correct 340 ms 60792 KB Output is correct
16 Correct 390 ms 65784 KB Output is correct
17 Correct 495 ms 76232 KB Output is correct
18 Correct 645 ms 100308 KB Output is correct
19 Correct 433 ms 69120 KB Output is correct
20 Correct 338 ms 57720 KB Output is correct
21 Correct 466 ms 68952 KB Output is correct
22 Correct 591 ms 80248 KB Output is correct
23 Correct 495 ms 84216 KB Output is correct
24 Correct 495 ms 75896 KB Output is correct
25 Correct 496 ms 75772 KB Output is correct
26 Correct 342 ms 58668 KB Output is correct
27 Correct 454 ms 72572 KB Output is correct
28 Correct 477 ms 71952 KB Output is correct
29 Correct 660 ms 91172 KB Output is correct
30 Correct 527 ms 75440 KB Output is correct
31 Correct 461 ms 67228 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 88772 KB Output is correct
2 Correct 331 ms 53856 KB Output is correct
3 Correct 355 ms 57340 KB Output is correct
4 Correct 498 ms 81144 KB Output is correct
5 Correct 509 ms 78720 KB Output is correct
6 Correct 495 ms 82556 KB Output is correct
7 Correct 765 ms 106596 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 10 ms 1408 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 10 ms 1536 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 11 ms 1152 KB Output is correct
16 Correct 9 ms 896 KB Output is correct
17 Correct 11 ms 1152 KB Output is correct
18 Correct 12 ms 1408 KB Output is correct
19 Correct 11 ms 1152 KB Output is correct
20 Correct 10 ms 1024 KB Output is correct
21 Correct 13 ms 1664 KB Output is correct
22 Correct 10 ms 1496 KB Output is correct
23 Correct 9 ms 1408 KB Output is correct
24 Correct 10 ms 1408 KB Output is correct
25 Correct 12 ms 1408 KB Output is correct
26 Correct 11 ms 1408 KB Output is correct
27 Correct 10 ms 1152 KB Output is correct
28 Correct 10 ms 1280 KB Output is correct
29 Correct 12 ms 1280 KB Output is correct
30 Correct 11 ms 1408 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 10 ms 1408 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 440 ms 87032 KB Output is correct
14 Correct 309 ms 57244 KB Output is correct
15 Correct 340 ms 60792 KB Output is correct
16 Correct 390 ms 65784 KB Output is correct
17 Correct 495 ms 76232 KB Output is correct
18 Correct 645 ms 100308 KB Output is correct
19 Correct 433 ms 69120 KB Output is correct
20 Correct 338 ms 57720 KB Output is correct
21 Correct 466 ms 68952 KB Output is correct
22 Correct 591 ms 80248 KB Output is correct
23 Correct 495 ms 84216 KB Output is correct
24 Correct 495 ms 75896 KB Output is correct
25 Correct 496 ms 75772 KB Output is correct
26 Correct 342 ms 58668 KB Output is correct
27 Correct 454 ms 72572 KB Output is correct
28 Correct 477 ms 71952 KB Output is correct
29 Correct 660 ms 91172 KB Output is correct
30 Correct 527 ms 75440 KB Output is correct
31 Correct 461 ms 67228 KB Output is correct
32 Correct 517 ms 87416 KB Output is correct
33 Correct 410 ms 68216 KB Output is correct
34 Correct 632 ms 102520 KB Output is correct
35 Correct 424 ms 61816 KB Output is correct
36 Correct 418 ms 66040 KB Output is correct
37 Correct 457 ms 72924 KB Output is correct
38 Correct 682 ms 110708 KB Output is correct
39 Correct 557 ms 83280 KB Output is correct
40 Correct 922 ms 111704 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1408 KB Output is correct
4 Correct 7 ms 768 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 1152 KB Output is correct
7 Correct 8 ms 1280 KB Output is correct
8 Correct 9 ms 1408 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 10 ms 1408 KB Output is correct
11 Correct 10 ms 1408 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 440 ms 87032 KB Output is correct
14 Correct 309 ms 57244 KB Output is correct
15 Correct 340 ms 60792 KB Output is correct
16 Correct 390 ms 65784 KB Output is correct
17 Correct 495 ms 76232 KB Output is correct
18 Correct 645 ms 100308 KB Output is correct
19 Correct 433 ms 69120 KB Output is correct
20 Correct 338 ms 57720 KB Output is correct
21 Correct 466 ms 68952 KB Output is correct
22 Correct 591 ms 80248 KB Output is correct
23 Correct 495 ms 84216 KB Output is correct
24 Correct 495 ms 75896 KB Output is correct
25 Correct 496 ms 75772 KB Output is correct
26 Correct 342 ms 58668 KB Output is correct
27 Correct 454 ms 72572 KB Output is correct
28 Correct 477 ms 71952 KB Output is correct
29 Correct 660 ms 91172 KB Output is correct
30 Correct 527 ms 75440 KB Output is correct
31 Correct 461 ms 67228 KB Output is correct
32 Correct 622 ms 88772 KB Output is correct
33 Correct 331 ms 53856 KB Output is correct
34 Correct 355 ms 57340 KB Output is correct
35 Correct 498 ms 81144 KB Output is correct
36 Correct 509 ms 78720 KB Output is correct
37 Correct 495 ms 82556 KB Output is correct
38 Correct 765 ms 106596 KB Output is correct
39 Correct 10 ms 1536 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 11 ms 1152 KB Output is correct
42 Correct 9 ms 896 KB Output is correct
43 Correct 11 ms 1152 KB Output is correct
44 Correct 12 ms 1408 KB Output is correct
45 Correct 11 ms 1152 KB Output is correct
46 Correct 10 ms 1024 KB Output is correct
47 Correct 13 ms 1664 KB Output is correct
48 Correct 10 ms 1496 KB Output is correct
49 Correct 9 ms 1408 KB Output is correct
50 Correct 10 ms 1408 KB Output is correct
51 Correct 12 ms 1408 KB Output is correct
52 Correct 11 ms 1408 KB Output is correct
53 Correct 10 ms 1152 KB Output is correct
54 Correct 10 ms 1280 KB Output is correct
55 Correct 12 ms 1280 KB Output is correct
56 Correct 11 ms 1408 KB Output is correct
57 Correct 517 ms 87416 KB Output is correct
58 Correct 410 ms 68216 KB Output is correct
59 Correct 632 ms 102520 KB Output is correct
60 Correct 424 ms 61816 KB Output is correct
61 Correct 418 ms 66040 KB Output is correct
62 Correct 457 ms 72924 KB Output is correct
63 Correct 682 ms 110708 KB Output is correct
64 Correct 557 ms 83280 KB Output is correct
65 Correct 922 ms 111704 KB Output is correct
66 Correct 362 ms 66848 KB Output is correct
67 Correct 752 ms 96188 KB Output is correct
68 Correct 484 ms 67032 KB Output is correct
69 Correct 650 ms 87908 KB Output is correct
70 Correct 375 ms 69496 KB Output is correct
71 Correct 681 ms 111092 KB Output is correct
72 Correct 434 ms 70052 KB Output is correct
73 Correct 596 ms 91896 KB Output is correct
74 Correct 403 ms 57080 KB Output is correct
75 Correct 623 ms 94068 KB Output is correct
76 Correct 424 ms 65664 KB Output is correct
77 Correct 536 ms 87852 KB Output is correct
78 Correct 475 ms 62560 KB Output is correct
79 Correct 492 ms 81140 KB Output is correct
80 Correct 673 ms 101212 KB Output is correct
81 Correct 366 ms 66808 KB Output is correct
82 Correct 527 ms 84568 KB Output is correct
83 Correct 372 ms 56568 KB Output is correct
84 Correct 399 ms 61048 KB Output is correct
85 Correct 392 ms 57208 KB Output is correct
86 Correct 676 ms 100856 KB Output is correct
87 Correct 385 ms 57464 KB Output is correct
88 Correct 686 ms 101108 KB Output is correct
89 Correct 530 ms 81912 KB Output is correct
90 Correct 465 ms 74172 KB Output is correct
91 Correct 918 ms 122836 KB Output is correct
92 Correct 746 ms 112496 KB Output is correct
93 Correct 814 ms 117600 KB Output is correct
94 Correct 842 ms 117732 KB Output is correct
95 Correct 620 ms 99680 KB Output is correct
96 Correct 493 ms 78184 KB Output is correct
97 Correct 776 ms 106856 KB Output is correct
98 Correct 503 ms 71656 KB Output is correct
99 Correct 562 ms 82184 KB Output is correct
100 Correct 558 ms 79564 KB Output is correct