oj.uz

Submission #225259

# Submission time Handle Problem Language Result Execution time Memory
225259 2020-04-20T05:32:16 Z bukanYohandi Solar Storm (NOI20_solarstorm) C++14
100 / 100
 1341 ms 187636 KB 
#include <bits/stdc++.h>
/*
	Karya anak bangsa yang paling agung
	Author : Yohandi or... bukan..
*/

#define fs first
#define sc second
#define pb push_back
#define eb emplace_back

#define all(a) a.begin(),a.end()
#define lb(a,x) (lower_bound(all(a),x)-a.begin())
#define ub(a,x) (upper_bound(all(a),x)-a.begin())

#define rep(a,x,y) for(int a=(int)x;a<=(int)y;++a)
#define repd(a,x,y,d) for(int a=(int)x;a<=(int)y;a+=d)
#define res(a,x,y) for(int a=(int)x;a>=(int)y;--a)
#define resd(a,x,y,d) for(int a=(int)x;a>=(int)y;a-=d)

// Ordered Set, Ordered Multiset
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define o_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define o_multiset tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
// .order_of_key(x) -> Number of elements less than x
// * .find_by_order(k) -> Kth smallest element (0-based)
// .erase(x) -> Remove all elements equal to x

#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
using lint=long long;

mt19937 rng(time(NULL));

lint Power(lint A,lint B,lint C){
	if(!B) return 1LL;
	lint tmp=Power(A,B>>1,C);
	return tmp*tmp%C*(B&1?A:1)%C;
}

int T,N,S,Le,Ri,Id;
int Par[1111111][33];
lint K,Ans;
lint V[1111111],D[1111111];
pair<int,int> P[1111111];

int Ancestor(int U,int Diff){
    for(int j=log2(N+1);j>=0;--j){
        if(Diff&(1<<j))
            U=Par[U][j];
    }
    return U;
}

int main(){
//	ios_base::sync_with_stdio(0);
//	cin.tie(0); cout.tie(0);
	T=1;
//	cin>>T;
	rep(t,1,T){
        cin>>N>>S>>K;
        for(int i=1;i<=N-1;++i){
            cin>>D[i];
            D[i]+=D[i-1];
        }
        for(int i=1;i<=N;++i){
            cin>>V[i];
            V[i]+=V[i-1];
        }
        Le=1; Ri=1;
        for(int i=1;i<=N;++i){
            while(Le<=i&&D[i-1]-D[Le-1]>K) Le++;
            while(Ri<=N&&D[Ri-1]-D[i-1]<=K) Ri++;
            P[Le].fs=Ri;
            P[Le].sc=i;
        }
        for(int i=1;i<=N;++i){
            if(P[i].fs==0)
                P[i]=P[i-1];
        }
        P[N+1]=P[N];
        V[N+1]=V[N];
        memset(Par,-1,sizeof(Par));
        for(int i=1;i<=N+1;++i) Par[i][0]=P[i].fs;
        for(int j=1;j<=log2(N);++j)
            for(int i=1;i<=N+1;++i)
                if(Par[i][j-1]!=-1&&Par[Par[i][j-1]][j-1]!=-1)
                    Par[i][j]=Par[Par[i][j-1]][j-1];
        for(int i=1;i<=N;++i){
            if(Ans<V[Ancestor(i,S)-1]-V[i-1]){
                Ans=max(Ans,V[Ancestor(i,S)-1]-V[i-1]);
                Id=i;
            }
        }
        cout<<S<<endl;
        for(int i=1;i<=S;++i){
            if(i!=1) cout<<" ";
            cout<<P[Id].sc;
            Id=P[Id].fs;
        }
        cout<<"\n";
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 143864 KB Output is correct
2 Correct 76 ms 144120 KB Output is correct
3 Correct 83 ms 144248 KB Output is correct
4 Correct 72 ms 143992 KB Output is correct
5 Correct 69 ms 143864 KB Output is correct
6 Correct 76 ms 144120 KB Output is correct
7 Correct 77 ms 144120 KB Output is correct
8 Correct 77 ms 144248 KB Output is correct
9 Correct 75 ms 144120 KB Output is correct
10 Correct 77 ms 144120 KB Output is correct
11 Correct 78 ms 144248 KB Output is correct
12 Correct 72 ms 144012 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 832 ms 170728 KB Output is correct
2 Correct 549 ms 161400 KB Output is correct
3 Correct 591 ms 162676 KB Output is correct
4 Correct 644 ms 164480 KB Output is correct
5 Correct 741 ms 167544 KB Output is correct
6 Correct 976 ms 175668 KB Output is correct
7 Correct 666 ms 164984 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 143864 KB Output is correct
2 Correct 76 ms 144120 KB Output is correct
3 Correct 83 ms 144248 KB Output is correct
4 Correct 72 ms 143992 KB Output is correct
5 Correct 69 ms 143864 KB Output is correct
6 Correct 76 ms 144120 KB Output is correct
7 Correct 77 ms 144120 KB Output is correct
8 Correct 77 ms 144248 KB Output is correct
9 Correct 75 ms 144120 KB Output is correct
10 Correct 77 ms 144120 KB Output is correct
11 Correct 78 ms 144248 KB Output is correct
12 Correct 72 ms 144012 KB Output is correct
13 Correct 832 ms 170728 KB Output is correct
14 Correct 549 ms 161400 KB Output is correct
15 Correct 591 ms 162676 KB Output is correct
16 Correct 644 ms 164480 KB Output is correct
17 Correct 741 ms 167544 KB Output is correct
18 Correct 976 ms 175668 KB Output is correct
19 Correct 666 ms 164984 KB Output is correct
20 Correct 690 ms 163424 KB Output is correct
21 Correct 838 ms 168440 KB Output is correct
22 Correct 995 ms 173048 KB Output is correct
23 Correct 868 ms 171644 KB Output is correct
24 Correct 911 ms 171128 KB Output is correct
25 Correct 948 ms 171040 KB Output is correct
26 Correct 733 ms 163960 KB Output is correct
27 Correct 891 ms 169976 KB Output is correct
28 Correct 903 ms 169720 KB Output is correct
29 Correct 1111 ms 177400 KB Output is correct
30 Correct 950 ms 171256 KB Output is correct
31 Correct 844 ms 167840 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 173944 KB Output is correct
2 Correct 531 ms 160248 KB Output is correct
3 Correct 562 ms 161272 KB Output is correct
4 Correct 773 ms 169208 KB Output is correct
5 Correct 761 ms 168440 KB Output is correct
6 Correct 805 ms 169980 KB Output is correct
7 Correct 1068 ms 179576 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 143864 KB Output is correct
2 Correct 76 ms 144120 KB Output is correct
3 Correct 83 ms 144248 KB Output is correct
4 Correct 72 ms 143992 KB Output is correct
5 Correct 69 ms 143864 KB Output is correct
6 Correct 76 ms 144120 KB Output is correct
7 Correct 77 ms 144120 KB Output is correct
8 Correct 77 ms 144248 KB Output is correct
9 Correct 75 ms 144120 KB Output is correct
10 Correct 77 ms 144120 KB Output is correct
11 Correct 78 ms 144248 KB Output is correct
12 Correct 72 ms 144012 KB Output is correct
13 Correct 80 ms 144248 KB Output is correct
14 Correct 81 ms 144120 KB Output is correct
15 Correct 83 ms 144080 KB Output is correct
16 Correct 75 ms 143992 KB Output is correct
17 Correct 76 ms 144076 KB Output is correct
18 Correct 82 ms 144248 KB Output is correct
19 Correct 77 ms 144120 KB Output is correct
20 Correct 75 ms 144120 KB Output is correct
21 Correct 80 ms 144248 KB Output is correct
22 Correct 78 ms 144248 KB Output is correct
23 Correct 79 ms 144248 KB Output is correct
24 Correct 78 ms 144248 KB Output is correct
25 Correct 79 ms 144120 KB Output is correct
26 Correct 80 ms 144120 KB Output is correct
27 Correct 76 ms 144120 KB Output is correct
28 Correct 76 ms 144120 KB Output is correct
29 Correct 76 ms 144120 KB Output is correct
30 Correct 78 ms 144248 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 143864 KB Output is correct
2 Correct 76 ms 144120 KB Output is correct
3 Correct 83 ms 144248 KB Output is correct
4 Correct 72 ms 143992 KB Output is correct
5 Correct 69 ms 143864 KB Output is correct
6 Correct 76 ms 144120 KB Output is correct
7 Correct 77 ms 144120 KB Output is correct
8 Correct 77 ms 144248 KB Output is correct
9 Correct 75 ms 144120 KB Output is correct
10 Correct 77 ms 144120 KB Output is correct
11 Correct 78 ms 144248 KB Output is correct
12 Correct 72 ms 144012 KB Output is correct
13 Correct 832 ms 170728 KB Output is correct
14 Correct 549 ms 161400 KB Output is correct
15 Correct 591 ms 162676 KB Output is correct
16 Correct 644 ms 164480 KB Output is correct
17 Correct 741 ms 167544 KB Output is correct
18 Correct 976 ms 175668 KB Output is correct
19 Correct 666 ms 164984 KB Output is correct
20 Correct 690 ms 163424 KB Output is correct
21 Correct 838 ms 168440 KB Output is correct
22 Correct 995 ms 173048 KB Output is correct
23 Correct 868 ms 171644 KB Output is correct
24 Correct 911 ms 171128 KB Output is correct
25 Correct 948 ms 171040 KB Output is correct
26 Correct 733 ms 163960 KB Output is correct
27 Correct 891 ms 169976 KB Output is correct
28 Correct 903 ms 169720 KB Output is correct
29 Correct 1111 ms 177400 KB Output is correct
30 Correct 950 ms 171256 KB Output is correct
31 Correct 844 ms 167840 KB Output is correct
32 Correct 1052 ms 176248 KB Output is correct
33 Correct 840 ms 168696 KB Output is correct
34 Correct 1139 ms 177784 KB Output is correct
35 Correct 718 ms 164216 KB Output is correct
36 Correct 788 ms 165752 KB Output is correct
37 Correct 847 ms 167912 KB Output is correct
38 Correct 1279 ms 180348 KB Output is correct
39 Correct 963 ms 171476 KB Output is correct
40 Correct 1237 ms 180980 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 143864 KB Output is correct
2 Correct 76 ms 144120 KB Output is correct
3 Correct 83 ms 144248 KB Output is correct
4 Correct 72 ms 143992 KB Output is correct
5 Correct 69 ms 143864 KB Output is correct
6 Correct 76 ms 144120 KB Output is correct
7 Correct 77 ms 144120 KB Output is correct
8 Correct 77 ms 144248 KB Output is correct
9 Correct 75 ms 144120 KB Output is correct
10 Correct 77 ms 144120 KB Output is correct
11 Correct 78 ms 144248 KB Output is correct
12 Correct 72 ms 144012 KB Output is correct
13 Correct 832 ms 170728 KB Output is correct
14 Correct 549 ms 161400 KB Output is correct
15 Correct 591 ms 162676 KB Output is correct
16 Correct 644 ms 164480 KB Output is correct
17 Correct 741 ms 167544 KB Output is correct
18 Correct 976 ms 175668 KB Output is correct
19 Correct 666 ms 164984 KB Output is correct
20 Correct 690 ms 163424 KB Output is correct
21 Correct 838 ms 168440 KB Output is correct
22 Correct 995 ms 173048 KB Output is correct
23 Correct 868 ms 171644 KB Output is correct
24 Correct 911 ms 171128 KB Output is correct
25 Correct 948 ms 171040 KB Output is correct
26 Correct 733 ms 163960 KB Output is correct
27 Correct 891 ms 169976 KB Output is correct
28 Correct 903 ms 169720 KB Output is correct
29 Correct 1111 ms 177400 KB Output is correct
30 Correct 950 ms 171256 KB Output is correct
31 Correct 844 ms 167840 KB Output is correct
32 Correct 860 ms 173944 KB Output is correct
33 Correct 531 ms 160248 KB Output is correct
34 Correct 562 ms 161272 KB Output is correct
35 Correct 773 ms 169208 KB Output is correct
36 Correct 761 ms 168440 KB Output is correct
37 Correct 805 ms 169980 KB Output is correct
38 Correct 1068 ms 179576 KB Output is correct
39 Correct 80 ms 144248 KB Output is correct
40 Correct 81 ms 144120 KB Output is correct
41 Correct 83 ms 144080 KB Output is correct
42 Correct 75 ms 143992 KB Output is correct
43 Correct 76 ms 144076 KB Output is correct
44 Correct 82 ms 144248 KB Output is correct
45 Correct 77 ms 144120 KB Output is correct
46 Correct 75 ms 144120 KB Output is correct
47 Correct 80 ms 144248 KB Output is correct
48 Correct 78 ms 144248 KB Output is correct
49 Correct 79 ms 144248 KB Output is correct
50 Correct 78 ms 144248 KB Output is correct
51 Correct 79 ms 144120 KB Output is correct
52 Correct 80 ms 144120 KB Output is correct
53 Correct 76 ms 144120 KB Output is correct
54 Correct 76 ms 144120 KB Output is correct
55 Correct 76 ms 144120 KB Output is correct
56 Correct 78 ms 144248 KB Output is correct
57 Correct 1052 ms 176248 KB Output is correct
58 Correct 840 ms 168696 KB Output is correct
59 Correct 1139 ms 177784 KB Output is correct
60 Correct 718 ms 164216 KB Output is correct
61 Correct 788 ms 165752 KB Output is correct
62 Correct 847 ms 167912 KB Output is correct
63 Correct 1279 ms 180348 KB Output is correct
64 Correct 963 ms 171476 KB Output is correct
65 Correct 1237 ms 180980 KB Output is correct
66 Correct 812 ms 170052 KB Output is correct
67 Correct 1082 ms 177140 KB Output is correct
68 Correct 755 ms 167800 KB Output is correct
69 Correct 995 ms 173684 KB Output is correct
70 Correct 770 ms 166904 KB Output is correct
71 Correct 1242 ms 180600 KB Output is correct
72 Correct 836 ms 167032 KB Output is correct
73 Correct 1049 ms 174200 KB Output is correct
74 Correct 683 ms 162808 KB Output is correct
75 Correct 1073 ms 175096 KB Output is correct
76 Correct 748 ms 165496 KB Output is correct
77 Correct 997 ms 173944 KB Output is correct
78 Correct 708 ms 164728 KB Output is correct
79 Correct 923 ms 170744 KB Output is correct
80 Correct 1136 ms 177272 KB Output is correct
81 Correct 747 ms 165880 KB Output is correct
82 Correct 955 ms 171768 KB Output is correct
83 Correct 657 ms 162552 KB Output is correct
84 Correct 726 ms 163960 KB Output is correct
85 Correct 676 ms 162808 KB Output is correct
86 Correct 1139 ms 177396 KB Output is correct
87 Correct 680 ms 162936 KB Output is correct
88 Correct 1198 ms 181952 KB Output is correct
89 Correct 925 ms 171000 KB Output is correct
90 Correct 831 ms 168440 KB Output is correct
91 Correct 1319 ms 187636 KB Output is correct
92 Correct 1243 ms 181336 KB Output is correct
93 Correct 1341 ms 184524 KB Output is correct
94 Correct 1305 ms 184564 KB Output is correct
95 Correct 1153 ms 179448 KB Output is correct
96 Correct 957 ms 174568 KB Output is correct
97 Correct 1223 ms 182124 KB Output is correct
98 Correct 860 ms 169848 KB Output is correct
99 Correct 932 ms 173400 KB Output is correct
100 Correct 890 ms 172280 KB Output is correct