oj.uz

Submission #225263

# Submission time Handle Problem Language Result Execution time Memory
225263 2020-04-20T05:47:21 Z bukanYohandi Solar Storm (NOI20_solarstorm) C++14
36 / 100
 520 ms 122708 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,Log;
int Par[1111111][21];
lint K,Ans,Sum;
lint V[1111111],D[1111111];
pair<int,int> P[1111111];

int Ancestor(int U,int Diff){
    for(int j=Log;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;
        Log=log2(N+1);
        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;
        }
        memset(Par,-1,sizeof(Par));
        for(int i=1;i<=N;++i) Par[i][0]=P[i].fs;
        Par[N+1][0]=N+1;
        for(int j=1;j<=Log;++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){
            Sum=V[Ancestor(i,S)-1]-V[i-1];
            if(Ans<Sum){
                Ans=Sum;
                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 48 ms 91640 KB Output is correct
2 Correct 50 ms 92024 KB Output is correct
3 Correct 50 ms 92024 KB Output is correct
4 Correct 48 ms 91768 KB Output is correct
5 Correct 48 ms 91640 KB Output is correct
6 Correct 50 ms 91896 KB Output is correct
7 Correct 49 ms 91896 KB Output is correct
8 Correct 54 ms 91896 KB Output is correct
9 Correct 50 ms 91896 KB Output is correct
10 Correct 52 ms 92064 KB Output is correct
11 Correct 58 ms 92152 KB Output is correct
12 Correct 49 ms 91768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 108792 KB Output is correct
2 Correct 228 ms 106488 KB Output is correct
3 Correct 245 ms 108536 KB Output is correct
4 Correct 274 ms 110456 KB Output is correct
5 Correct 311 ms 112888 KB Output is correct
6 Correct 413 ms 119032 KB Output is correct
7 Correct 297 ms 110840 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 50 ms 92024 KB Output is correct
3 Correct 50 ms 92024 KB Output is correct
4 Correct 48 ms 91768 KB Output is correct
5 Correct 48 ms 91640 KB Output is correct
6 Correct 50 ms 91896 KB Output is correct
7 Correct 49 ms 91896 KB Output is correct
8 Correct 54 ms 91896 KB Output is correct
9 Correct 50 ms 91896 KB Output is correct
10 Correct 52 ms 92064 KB Output is correct
11 Correct 58 ms 92152 KB Output is correct
12 Correct 49 ms 91768 KB Output is correct
13 Correct 300 ms 108792 KB Output is correct
14 Correct 228 ms 106488 KB Output is correct
15 Correct 245 ms 108536 KB Output is correct
16 Correct 274 ms 110456 KB Output is correct
17 Correct 311 ms 112888 KB Output is correct
18 Correct 413 ms 119032 KB Output is correct
19 Correct 297 ms 110840 KB Output is correct
20 Correct 251 ms 105080 KB Output is correct
21 Correct 344 ms 111992 KB Output is correct
22 Correct 400 ms 116956 KB Output is correct
23 Correct 302 ms 109048 KB Output is correct
24 Correct 302 ms 108792 KB Output is correct
25 Correct 357 ms 113912 KB Output is correct
26 Correct 284 ms 107004 KB Output is correct
27 Correct 337 ms 113016 KB Output is correct
28 Correct 328 ms 113144 KB Output is correct
29 Correct 411 ms 119548 KB Output is correct
30 Correct 337 ms 114936 KB Output is correct
31 Correct 292 ms 111596 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 117836 KB Output is correct
2 Correct 246 ms 107128 KB Output is correct
3 Correct 255 ms 107640 KB Output is correct
4 Correct 356 ms 113228 KB Output is correct
5 Correct 340 ms 112632 KB Output is correct
6 Correct 359 ms 113528 KB Output is correct
7 Correct 520 ms 122708 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 50 ms 92024 KB Output is correct
3 Correct 50 ms 92024 KB Output is correct
4 Correct 48 ms 91768 KB Output is correct
5 Correct 48 ms 91640 KB Output is correct
6 Correct 50 ms 91896 KB Output is correct
7 Correct 49 ms 91896 KB Output is correct
8 Correct 54 ms 91896 KB Output is correct
9 Correct 50 ms 91896 KB Output is correct
10 Correct 52 ms 92064 KB Output is correct
11 Correct 58 ms 92152 KB Output is correct
12 Correct 49 ms 91768 KB Output is correct
13 Incorrect 55 ms 92024 KB Output format isn't correct
14 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 50 ms 92024 KB Output is correct
3 Correct 50 ms 92024 KB Output is correct
4 Correct 48 ms 91768 KB Output is correct
5 Correct 48 ms 91640 KB Output is correct
6 Correct 50 ms 91896 KB Output is correct
7 Correct 49 ms 91896 KB Output is correct
8 Correct 54 ms 91896 KB Output is correct
9 Correct 50 ms 91896 KB Output is correct
10 Correct 52 ms 92064 KB Output is correct
11 Correct 58 ms 92152 KB Output is correct
12 Correct 49 ms 91768 KB Output is correct
13 Correct 300 ms 108792 KB Output is correct
14 Correct 228 ms 106488 KB Output is correct
15 Correct 245 ms 108536 KB Output is correct
16 Correct 274 ms 110456 KB Output is correct
17 Correct 311 ms 112888 KB Output is correct
18 Correct 413 ms 119032 KB Output is correct
19 Correct 297 ms 110840 KB Output is correct
20 Correct 251 ms 105080 KB Output is correct
21 Correct 344 ms 111992 KB Output is correct
22 Correct 400 ms 116956 KB Output is correct
23 Correct 302 ms 109048 KB Output is correct
24 Correct 302 ms 108792 KB Output is correct
25 Correct 357 ms 113912 KB Output is correct
26 Correct 284 ms 107004 KB Output is correct
27 Correct 337 ms 113016 KB Output is correct
28 Correct 328 ms 113144 KB Output is correct
29 Correct 411 ms 119548 KB Output is correct
30 Correct 337 ms 114936 KB Output is correct
31 Correct 292 ms 111596 KB Output is correct
32 Incorrect 363 ms 111368 KB Output format isn't correct
33 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 50 ms 92024 KB Output is correct
3 Correct 50 ms 92024 KB Output is correct
4 Correct 48 ms 91768 KB Output is correct
5 Correct 48 ms 91640 KB Output is correct
6 Correct 50 ms 91896 KB Output is correct
7 Correct 49 ms 91896 KB Output is correct
8 Correct 54 ms 91896 KB Output is correct
9 Correct 50 ms 91896 KB Output is correct
10 Correct 52 ms 92064 KB Output is correct
11 Correct 58 ms 92152 KB Output is correct
12 Correct 49 ms 91768 KB Output is correct
13 Correct 300 ms 108792 KB Output is correct
14 Correct 228 ms 106488 KB Output is correct
15 Correct 245 ms 108536 KB Output is correct
16 Correct 274 ms 110456 KB Output is correct
17 Correct 311 ms 112888 KB Output is correct
18 Correct 413 ms 119032 KB Output is correct
19 Correct 297 ms 110840 KB Output is correct
20 Correct 251 ms 105080 KB Output is correct
21 Correct 344 ms 111992 KB Output is correct
22 Correct 400 ms 116956 KB Output is correct
23 Correct 302 ms 109048 KB Output is correct
24 Correct 302 ms 108792 KB Output is correct
25 Correct 357 ms 113912 KB Output is correct
26 Correct 284 ms 107004 KB Output is correct
27 Correct 337 ms 113016 KB Output is correct
28 Correct 328 ms 113144 KB Output is correct
29 Correct 411 ms 119548 KB Output is correct
30 Correct 337 ms 114936 KB Output is correct
31 Correct 292 ms 111596 KB Output is correct
32 Correct 410 ms 117836 KB Output is correct
33 Correct 246 ms 107128 KB Output is correct
34 Correct 255 ms 107640 KB Output is correct
35 Correct 356 ms 113228 KB Output is correct
36 Correct 340 ms 112632 KB Output is correct
37 Correct 359 ms 113528 KB Output is correct
38 Correct 520 ms 122708 KB Output is correct
39 Incorrect 55 ms 92024 KB Output format isn't correct
40 Halted 0 ms 0 KB -