oj.uz

Submission #224886

# Submission time Handle Problem Language Result Execution time Memory
224886 2020-04-19T04:38:03 Z nabilervatra Solar Storm (NOI20_solarstorm) C++14
28 / 100
 1037 ms 179764 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;
        // 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;
        ri=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;
        }
        jwb[i]= psum[ri]-psum[i-1];
        ans = max(ans,jwb[i]);
    }
    // cout<<ans<<endl;
    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:99:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i =0;i<ret.size();i++){
                        ~^~~~~~~~~~~
SolarStorm.cpp:101: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 12 ms 1792 KB Output is correct
3 Correct 13 ms 2176 KB Output is correct
4 Correct 9 ms 1152 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 11 ms 1536 KB Output is correct
10 Correct 13 ms 2048 KB Output is correct
11 Correct 14 ms 2176 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 154784 KB Output is correct
2 Correct 423 ms 98496 KB Output is correct
3 Correct 437 ms 105544 KB Output is correct
4 Correct 482 ms 115156 KB Output is correct
5 Correct 571 ms 134980 KB Output is correct
6 Correct 733 ms 179764 KB Output is correct
7 Correct 502 ms 118740 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 12 ms 1792 KB Output is correct
3 Correct 13 ms 2176 KB Output is correct
4 Correct 9 ms 1152 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 11 ms 1536 KB Output is correct
10 Correct 13 ms 2048 KB Output is correct
11 Correct 14 ms 2176 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 669 ms 154784 KB Output is correct
14 Correct 423 ms 98496 KB Output is correct
15 Correct 437 ms 105544 KB Output is correct
16 Correct 482 ms 115156 KB Output is correct
17 Correct 571 ms 134980 KB Output is correct
18 Correct 733 ms 179764 KB Output is correct
19 Correct 502 ms 118740 KB Output is correct
20 Correct 562 ms 98184 KB Output is correct
21 Correct 663 ms 120912 KB Output is correct
22 Correct 820 ms 143348 KB Output is correct
23 Correct 708 ms 147848 KB Output is correct
24 Correct 752 ms 133372 KB Output is correct
25 Correct 736 ms 133496 KB Output is correct
26 Correct 560 ms 99716 KB Output is correct
27 Correct 707 ms 127736 KB Output is correct
28 Correct 724 ms 126328 KB Output is correct
29 Correct 916 ms 164088 KB Output is correct
30 Correct 752 ms 134392 KB Output is correct
31 Correct 659 ms 117880 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 854 ms 153912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 12 ms 1792 KB Output is correct
3 Correct 13 ms 2176 KB Output is correct
4 Correct 9 ms 1152 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 11 ms 1536 KB Output is correct
10 Correct 13 ms 2048 KB Output is correct
11 Correct 14 ms 2176 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 15 ms 2304 KB Output is correct
14 Correct 14 ms 1920 KB Output is correct
15 Correct 12 ms 1920 KB Output is correct
16 Correct 10 ms 1408 KB Output is correct
17 Incorrect 12 ms 1792 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 12 ms 1792 KB Output is correct
3 Correct 13 ms 2176 KB Output is correct
4 Correct 9 ms 1152 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 11 ms 1536 KB Output is correct
10 Correct 13 ms 2048 KB Output is correct
11 Correct 14 ms 2176 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 669 ms 154784 KB Output is correct
14 Correct 423 ms 98496 KB Output is correct
15 Correct 437 ms 105544 KB Output is correct
16 Correct 482 ms 115156 KB Output is correct
17 Correct 571 ms 134980 KB Output is correct
18 Correct 733 ms 179764 KB Output is correct
19 Correct 502 ms 118740 KB Output is correct
20 Correct 562 ms 98184 KB Output is correct
21 Correct 663 ms 120912 KB Output is correct
22 Correct 820 ms 143348 KB Output is correct
23 Correct 708 ms 147848 KB Output is correct
24 Correct 752 ms 133372 KB Output is correct
25 Correct 736 ms 133496 KB Output is correct
26 Correct 560 ms 99716 KB Output is correct
27 Correct 707 ms 127736 KB Output is correct
28 Correct 724 ms 126328 KB Output is correct
29 Correct 916 ms 164088 KB Output is correct
30 Correct 752 ms 134392 KB Output is correct
31 Correct 659 ms 117880 KB Output is correct
32 Correct 929 ms 157396 KB Output is correct
33 Correct 774 ms 120696 KB Output is correct
34 Incorrect 1037 ms 178040 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 12 ms 1792 KB Output is correct
3 Correct 13 ms 2176 KB Output is correct
4 Correct 9 ms 1152 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 11 ms 1536 KB Output is correct
10 Correct 13 ms 2048 KB Output is correct
11 Correct 14 ms 2176 KB Output is correct
12 Correct 8 ms 1024 KB Output is correct
13 Correct 669 ms 154784 KB Output is correct
14 Correct 423 ms 98496 KB Output is correct
15 Correct 437 ms 105544 KB Output is correct
16 Correct 482 ms 115156 KB Output is correct
17 Correct 571 ms 134980 KB Output is correct
18 Correct 733 ms 179764 KB Output is correct
19 Correct 502 ms 118740 KB Output is correct
20 Correct 562 ms 98184 KB Output is correct
21 Correct 663 ms 120912 KB Output is correct
22 Correct 820 ms 143348 KB Output is correct
23 Correct 708 ms 147848 KB Output is correct
24 Correct 752 ms 133372 KB Output is correct
25 Correct 736 ms 133496 KB Output is correct
26 Correct 560 ms 99716 KB Output is correct
27 Correct 707 ms 127736 KB Output is correct
28 Correct 724 ms 126328 KB Output is correct
29 Correct 916 ms 164088 KB Output is correct
30 Correct 752 ms 134392 KB Output is correct
31 Correct 659 ms 117880 KB Output is correct
32 Incorrect 854 ms 153912 KB Output isn't correct
33 Halted 0 ms 0 KB -