Submission #224877

# Submission time Handle Problem Language Result Execution time Memory
224877 2020-04-19T04:29:47 Z nabilervatra Solar Storm (NOI20_solarstorm) C++14
36 / 100
959 ms 172024 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;
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;
        // cout<<tab[i][0]<<' ';
    }
    // cout<<endl;
    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];
            // cout<<tab[i][j]<<' ';
        }
        // cout<<endl;
    }
    for(long long i=1;i<=n;i++){
        tmp= log2(m);
        cnt=m;
        now=i;
        while(cnt>0&&now<=n){
            ri = tab[now][tmp];
            now=ri+1;
            cnt-=(1<<tmp);
            tmp--;
            // if(i==2)cout<<ri<<' '<<now<<' '<<cnt<<' '<<tmp<<endl;
        }
        ans = max(ans,psum[ri]-psum[i-1]);
    }
    // cout<<ans<<endl;
    for(long long i=1;i<=n;i++){
        tmp= log2(m);
        cnt=m;
        now=i;
        while(cnt>0&&now<=n){
            ri = tab[now][tmp];
            now=ri+1;
            cnt-=(1<<tmp);
            tmp--;
        }
        if(psum[ri]-psum[i-1]==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);
                while(pref[p1+1]-pref[p1]<=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:105:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i =0;i<ret.size();i++){
                        ~^~~~~~~~~~~
SolarStorm.cpp:107:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i<ret.size()-1)cout<<' ';
            ~^~~~~~~~~~~~~
# 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 2176 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 13 ms 2176 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 15 ms 2176 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 636 ms 148216 KB Output is correct
2 Correct 408 ms 94200 KB Output is correct
3 Correct 421 ms 101368 KB Output is correct
4 Correct 475 ms 110584 KB Output is correct
5 Correct 570 ms 129016 KB Output is correct
6 Correct 742 ms 172024 KB Output is correct
7 Correct 570 ms 113656 KB Output is correct
# 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 2176 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 13 ms 2176 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 15 ms 2176 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 636 ms 148216 KB Output is correct
14 Correct 408 ms 94200 KB Output is correct
15 Correct 421 ms 101368 KB Output is correct
16 Correct 475 ms 110584 KB Output is correct
17 Correct 570 ms 129016 KB Output is correct
18 Correct 742 ms 172024 KB Output is correct
19 Correct 570 ms 113656 KB Output is correct
20 Correct 556 ms 93944 KB Output is correct
21 Correct 665 ms 115320 KB Output is correct
22 Correct 802 ms 136768 KB Output is correct
23 Correct 691 ms 140920 KB Output is correct
24 Correct 726 ms 127224 KB Output is correct
25 Correct 752 ms 127352 KB Output is correct
26 Correct 549 ms 94840 KB Output is correct
27 Correct 703 ms 121848 KB Output is correct
28 Correct 691 ms 120440 KB Output is correct
29 Correct 921 ms 156536 KB Output is correct
30 Correct 741 ms 128376 KB Output is correct
31 Correct 643 ms 112504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 603 ms 17404 KB Output is correct
2 Correct 332 ms 8312 KB Output is correct
3 Correct 358 ms 9080 KB Output is correct
4 Correct 529 ms 12680 KB Output is correct
5 Correct 504 ms 12280 KB Output is correct
6 Correct 531 ms 13048 KB Output is correct
7 Correct 700 ms 19696 KB Output is correct
# 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 2176 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 13 ms 2176 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 15 ms 2176 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 15 ms 2048 KB Output is correct
14 Incorrect 13 ms 1792 KB Damaged module blocking communication between protected modules
15 Halted 0 ms 0 KB -
# 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 2176 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 13 ms 2176 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 15 ms 2176 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 636 ms 148216 KB Output is correct
14 Correct 408 ms 94200 KB Output is correct
15 Correct 421 ms 101368 KB Output is correct
16 Correct 475 ms 110584 KB Output is correct
17 Correct 570 ms 129016 KB Output is correct
18 Correct 742 ms 172024 KB Output is correct
19 Correct 570 ms 113656 KB Output is correct
20 Correct 556 ms 93944 KB Output is correct
21 Correct 665 ms 115320 KB Output is correct
22 Correct 802 ms 136768 KB Output is correct
23 Correct 691 ms 140920 KB Output is correct
24 Correct 726 ms 127224 KB Output is correct
25 Correct 752 ms 127352 KB Output is correct
26 Correct 549 ms 94840 KB Output is correct
27 Correct 703 ms 121848 KB Output is correct
28 Correct 691 ms 120440 KB Output is correct
29 Correct 921 ms 156536 KB Output is correct
30 Correct 741 ms 128376 KB Output is correct
31 Correct 643 ms 112504 KB Output is correct
32 Correct 959 ms 150648 KB Output is correct
33 Incorrect 707 ms 115272 KB Damaged module blocking communication between protected modules
34 Halted 0 ms 0 KB -
# 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 2176 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 12 ms 1920 KB Output is correct
8 Correct 13 ms 2176 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 15 ms 2176 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 636 ms 148216 KB Output is correct
14 Correct 408 ms 94200 KB Output is correct
15 Correct 421 ms 101368 KB Output is correct
16 Correct 475 ms 110584 KB Output is correct
17 Correct 570 ms 129016 KB Output is correct
18 Correct 742 ms 172024 KB Output is correct
19 Correct 570 ms 113656 KB Output is correct
20 Correct 556 ms 93944 KB Output is correct
21 Correct 665 ms 115320 KB Output is correct
22 Correct 802 ms 136768 KB Output is correct
23 Correct 691 ms 140920 KB Output is correct
24 Correct 726 ms 127224 KB Output is correct
25 Correct 752 ms 127352 KB Output is correct
26 Correct 549 ms 94840 KB Output is correct
27 Correct 703 ms 121848 KB Output is correct
28 Correct 691 ms 120440 KB Output is correct
29 Correct 921 ms 156536 KB Output is correct
30 Correct 741 ms 128376 KB Output is correct
31 Correct 643 ms 112504 KB Output is correct
32 Correct 603 ms 17404 KB Output is correct
33 Correct 332 ms 8312 KB Output is correct
34 Correct 358 ms 9080 KB Output is correct
35 Correct 529 ms 12680 KB Output is correct
36 Correct 504 ms 12280 KB Output is correct
37 Correct 531 ms 13048 KB Output is correct
38 Correct 700 ms 19696 KB Output is correct
39 Correct 15 ms 2048 KB Output is correct
40 Incorrect 13 ms 1792 KB Damaged module blocking communication between protected modules
41 Halted 0 ms 0 KB -