oj.uz

Submission #224890

# Submission time Handle Problem Language Result Execution time Memory
224890 2020-04-19T04:39:35 Z nabilervatra Solar Storm (NOI20_solarstorm) C++14
36 / 100
 1018 ms 179796 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
long long n,m,k,psum[1000005],pref[1000005],x,p1,tab[1000005][20],cnt,tmp,now,ri,ans,p2,jwb[1000005];
bool sub4;
vector<long long> ret;
int main(){
    cin>>n>>m>>k;
    if(k==1)sub4=1;
    for(long long i =2;i<=n;i++){
        cin>>x;
        if(x<=1)sub4=0;
        pref[i]=pref[i-1]+x;
    }
    for(long long i =1;i<=n;i++){
        cin>>x;
        
        psum[i]=psum[i-1]+x;
    }
    if (sub4) {
        // cout<<'.';
        for(int i =1;i+m-1<=n;i++){
            if(psum[i+m-1]-psum[i-1]>ans)ans=psum[i+m-1]-psum[i-1];
        }
        for(int i=1;i+m-1<=n;i++){
            if(psum[i+m-1]-psum[i-1]==ans){
                cout<<m<<endl;
                for(int j =i;j<=i+m-2;j++){
                    cout<<j<<' ';
                }
                cout<<i+m-1<<endl;
                return 0;
            }
        }
    }
    p1=1;
    p2=1;
    for(long long i =1;i<=n;i++){
        p1=max(p1,(long long )i);
        p2=max(p2,p1);
        while(pref[p1+1]-pref[i]<=k&&p1<n){
            p1++;
        }
        while(pref[p2+1]-pref[p1]<=k&&p2<n){
            p2++;
        }
        tab[i][0]=p2;
    }
    for(long long j =1;j<=log2(m);j++){
        for(long long i =1;i<=n;i++){
            if(tab[i][j-1]==n)tab[i][j]=n;
            else tab[i][j] = tab[tab[i][j-1]+1][j-1];
        }
    }
    for(long long i=1;i<=n;i++){
        tmp= log2(m);
        cnt=m;
        now=i;
        ri=i;
        while(cnt>0&&now<=n){
            ri = tab[now][tmp];
            now=ri+1;
            cnt-=(1<<tmp);
            tmp--;
        }
        jwb[i]= psum[ri]-psum[i-1];
        ans = max(ans,jwb[i]);
    }
    for(long long i=1;i<=n;i++){
        if(jwb[i]==ans){
            cnt=m;
            p1=i;
            p2=i;
            while(cnt>0){ 
                if(p1==n){
                    if(ret.empty()||ret.back()!=n)ret.pb(n);
                    break;
                }
                p2=p1;
                while(pref[p2+1]-pref[p1]<=k&&p2<n)p2++;
                ret.pb(p2);
                p1=p2;
                while(pref[p1+1]-pref[p2]<=k&&p1<n)p1++;
                if(p1<n)p1++;
               
                cnt--;
            }
            break;
        }
    }
    cout<<ret.size()<<endl;
    for(long long i =0;i<ret.size();i++){
        cout<<ret[i];
        if(i<ret.size()-1)cout<<' ';
    }
    cout<<endl;
}

Compilation message

SolarStorm.cpp: In function 'int main()':
SolarStorm.cpp:92:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i =0;i<ret.size();i++){
                        ~^~~~~~~~~~~
SolarStorm.cpp:94:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i<ret.size()-1)cout<<' ';
            ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 1920 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 12 ms 1920 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 14 ms 2304 KB Output is correct
11 Correct 14 ms 2432 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 154748 KB Output is correct
2 Correct 401 ms 98412 KB Output is correct
3 Correct 434 ms 105464 KB Output is correct
4 Correct 474 ms 115064 KB Output is correct
5 Correct 552 ms 134904 KB Output is correct
6 Correct 740 ms 179796 KB Output is correct
7 Correct 486 ms 118776 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 13 ms 1920 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 12 ms 1920 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 14 ms 2304 KB Output is correct
11 Correct 14 ms 2432 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 638 ms 154748 KB Output is correct
14 Correct 401 ms 98412 KB Output is correct
15 Correct 434 ms 105464 KB Output is correct
16 Correct 474 ms 115064 KB Output is correct
17 Correct 552 ms 134904 KB Output is correct
18 Correct 740 ms 179796 KB Output is correct
19 Correct 486 ms 118776 KB Output is correct
20 Correct 541 ms 98376 KB Output is correct
21 Correct 653 ms 120588 KB Output is correct
22 Correct 771 ms 143040 KB Output is correct
23 Correct 694 ms 147320 KB Output is correct
24 Correct 740 ms 133232 KB Output is correct
25 Correct 737 ms 133116 KB Output is correct
26 Correct 542 ms 99448 KB Output is correct
27 Correct 697 ms 127352 KB Output is correct
28 Correct 712 ms 126104 KB Output is correct
29 Correct 895 ms 163704 KB Output is correct
30 Correct 736 ms 134008 KB Output is correct
31 Correct 641 ms 117616 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 17188 KB Output is correct
2 Correct 332 ms 8568 KB Output is correct
3 Correct 354 ms 8928 KB Output is correct
4 Correct 517 ms 12640 KB Output is correct
5 Correct 514 ms 12324 KB Output is correct
6 Correct 534 ms 13052 KB Output is correct
7 Correct 696 ms 19932 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 1920 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 12 ms 1920 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 14 ms 2304 KB Output is correct
11 Correct 14 ms 2432 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 14 ms 2176 KB Output is correct
14 Correct 13 ms 1792 KB Output is correct
15 Correct 13 ms 1792 KB Output is correct
16 Correct 10 ms 1408 KB Output is correct
17 Incorrect 12 ms 1664 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 1920 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 12 ms 1920 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 14 ms 2304 KB Output is correct
11 Correct 14 ms 2432 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 638 ms 154748 KB Output is correct
14 Correct 401 ms 98412 KB Output is correct
15 Correct 434 ms 105464 KB Output is correct
16 Correct 474 ms 115064 KB Output is correct
17 Correct 552 ms 134904 KB Output is correct
18 Correct 740 ms 179796 KB Output is correct
19 Correct 486 ms 118776 KB Output is correct
20 Correct 541 ms 98376 KB Output is correct
21 Correct 653 ms 120588 KB Output is correct
22 Correct 771 ms 143040 KB Output is correct
23 Correct 694 ms 147320 KB Output is correct
24 Correct 740 ms 133232 KB Output is correct
25 Correct 737 ms 133116 KB Output is correct
26 Correct 542 ms 99448 KB Output is correct
27 Correct 697 ms 127352 KB Output is correct
28 Correct 712 ms 126104 KB Output is correct
29 Correct 895 ms 163704 KB Output is correct
30 Correct 736 ms 134008 KB Output is correct
31 Correct 641 ms 117616 KB Output is correct
32 Correct 917 ms 157416 KB Output is correct
33 Correct 727 ms 120396 KB Output is correct
34 Incorrect 1018 ms 165752 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 13 ms 1920 KB Output is correct
3 Correct 13 ms 2304 KB Output is correct
4 Correct 9 ms 512 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 12 ms 1920 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 14 ms 2304 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 14 ms 2304 KB Output is correct
11 Correct 14 ms 2432 KB Output is correct
12 Correct 9 ms 1152 KB Output is correct
13 Correct 638 ms 154748 KB Output is correct
14 Correct 401 ms 98412 KB Output is correct
15 Correct 434 ms 105464 KB Output is correct
16 Correct 474 ms 115064 KB Output is correct
17 Correct 552 ms 134904 KB Output is correct
18 Correct 740 ms 179796 KB Output is correct
19 Correct 486 ms 118776 KB Output is correct
20 Correct 541 ms 98376 KB Output is correct
21 Correct 653 ms 120588 KB Output is correct
22 Correct 771 ms 143040 KB Output is correct
23 Correct 694 ms 147320 KB Output is correct
24 Correct 740 ms 133232 KB Output is correct
25 Correct 737 ms 133116 KB Output is correct
26 Correct 542 ms 99448 KB Output is correct
27 Correct 697 ms 127352 KB Output is correct
28 Correct 712 ms 126104 KB Output is correct
29 Correct 895 ms 163704 KB Output is correct
30 Correct 736 ms 134008 KB Output is correct
31 Correct 641 ms 117616 KB Output is correct
32 Correct 574 ms 17188 KB Output is correct
33 Correct 332 ms 8568 KB Output is correct
34 Correct 354 ms 8928 KB Output is correct
35 Correct 517 ms 12640 KB Output is correct
36 Correct 514 ms 12324 KB Output is correct
37 Correct 534 ms 13052 KB Output is correct
38 Correct 696 ms 19932 KB Output is correct
39 Correct 14 ms 2176 KB Output is correct
40 Correct 13 ms 1792 KB Output is correct
41 Correct 13 ms 1792 KB Output is correct
42 Correct 10 ms 1408 KB Output is correct
43 Incorrect 12 ms 1664 KB Output isn't correct
44 Halted 0 ms 0 KB -