oj.uz

답안 #225260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225260 2020-04-20T05:35:48 Z bukanYohandi Solar Storm (NOI20_solarstorm) C++14
100 / 100
 1258 ms 126188 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][21];
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=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

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 54 ms 92028 KB Output is correct
3 Correct 56 ms 92024 KB Output is correct
4 Correct 50 ms 91768 KB Output is correct
5 Correct 46 ms 91640 KB Output is correct
6 Correct 54 ms 91896 KB Output is correct
7 Correct 56 ms 91896 KB Output is correct
8 Correct 55 ms 92024 KB Output is correct
9 Correct 52 ms 91896 KB Output is correct
10 Correct 55 ms 92024 KB Output is correct
11 Correct 56 ms 92024 KB Output is correct
12 Correct 50 ms 91768 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 755 ms 118516 KB Output is correct
2 Correct 493 ms 109244 KB Output is correct
3 Correct 532 ms 110584 KB Output is correct
4 Correct 579 ms 112248 KB Output is correct
5 Correct 664 ms 115448 KB Output is correct
6 Correct 885 ms 123256 KB Output is correct
7 Correct 607 ms 113016 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 54 ms 92028 KB Output is correct
3 Correct 56 ms 92024 KB Output is correct
4 Correct 50 ms 91768 KB Output is correct
5 Correct 46 ms 91640 KB Output is correct
6 Correct 54 ms 91896 KB Output is correct
7 Correct 56 ms 91896 KB Output is correct
8 Correct 55 ms 92024 KB Output is correct
9 Correct 52 ms 91896 KB Output is correct
10 Correct 55 ms 92024 KB Output is correct
11 Correct 56 ms 92024 KB Output is correct
12 Correct 50 ms 91768 KB Output is correct
13 Correct 755 ms 118516 KB Output is correct
14 Correct 493 ms 109244 KB Output is correct
15 Correct 532 ms 110584 KB Output is correct
16 Correct 579 ms 112248 KB Output is correct
17 Correct 664 ms 115448 KB Output is correct
18 Correct 885 ms 123256 KB Output is correct
19 Correct 607 ms 113016 KB Output is correct
20 Correct 638 ms 111364 KB Output is correct
21 Correct 778 ms 115448 KB Output is correct
22 Correct 911 ms 118192 KB Output is correct
23 Correct 798 ms 118648 KB Output is correct
24 Correct 821 ms 116728 KB Output is correct
25 Correct 859 ms 116856 KB Output is correct
26 Correct 645 ms 111864 KB Output is correct
27 Correct 827 ms 115788 KB Output is correct
28 Correct 811 ms 115776 KB Output is correct
29 Correct 1050 ms 120032 KB Output is correct
30 Correct 884 ms 116600 KB Output is correct
31 Correct 771 ms 114552 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 792 ms 121652 KB Output is correct
2 Correct 466 ms 108024 KB Output is correct
3 Correct 513 ms 109304 KB Output is correct
4 Correct 713 ms 117112 KB Output is correct
5 Correct 691 ms 116344 KB Output is correct
6 Correct 733 ms 117752 KB Output is correct
7 Correct 993 ms 126072 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 54 ms 92028 KB Output is correct
3 Correct 56 ms 92024 KB Output is correct
4 Correct 50 ms 91768 KB Output is correct
5 Correct 46 ms 91640 KB Output is correct
6 Correct 54 ms 91896 KB Output is correct
7 Correct 56 ms 91896 KB Output is correct
8 Correct 55 ms 92024 KB Output is correct
9 Correct 52 ms 91896 KB Output is correct
10 Correct 55 ms 92024 KB Output is correct
11 Correct 56 ms 92024 KB Output is correct
12 Correct 50 ms 91768 KB Output is correct
13 Correct 56 ms 92024 KB Output is correct
14 Correct 53 ms 91984 KB Output is correct
15 Correct 53 ms 91896 KB Output is correct
16 Correct 52 ms 91896 KB Output is correct
17 Correct 52 ms 91896 KB Output is correct
18 Correct 55 ms 92024 KB Output is correct
19 Correct 54 ms 91896 KB Output is correct
20 Correct 53 ms 91896 KB Output is correct
21 Correct 56 ms 92024 KB Output is correct
22 Correct 55 ms 92024 KB Output is correct
23 Correct 56 ms 92024 KB Output is correct
24 Correct 54 ms 92024 KB Output is correct
25 Correct 54 ms 92024 KB Output is correct
26 Correct 55 ms 92024 KB Output is correct
27 Correct 52 ms 91928 KB Output is correct
28 Correct 52 ms 91896 KB Output is correct
29 Correct 53 ms 91896 KB Output is correct
30 Correct 59 ms 92024 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 54 ms 92028 KB Output is correct
3 Correct 56 ms 92024 KB Output is correct
4 Correct 50 ms 91768 KB Output is correct
5 Correct 46 ms 91640 KB Output is correct
6 Correct 54 ms 91896 KB Output is correct
7 Correct 56 ms 91896 KB Output is correct
8 Correct 55 ms 92024 KB Output is correct
9 Correct 52 ms 91896 KB Output is correct
10 Correct 55 ms 92024 KB Output is correct
11 Correct 56 ms 92024 KB Output is correct
12 Correct 50 ms 91768 KB Output is correct
13 Correct 755 ms 118516 KB Output is correct
14 Correct 493 ms 109244 KB Output is correct
15 Correct 532 ms 110584 KB Output is correct
16 Correct 579 ms 112248 KB Output is correct
17 Correct 664 ms 115448 KB Output is correct
18 Correct 885 ms 123256 KB Output is correct
19 Correct 607 ms 113016 KB Output is correct
20 Correct 638 ms 111364 KB Output is correct
21 Correct 778 ms 115448 KB Output is correct
22 Correct 911 ms 118192 KB Output is correct
23 Correct 798 ms 118648 KB Output is correct
24 Correct 821 ms 116728 KB Output is correct
25 Correct 859 ms 116856 KB Output is correct
26 Correct 645 ms 111864 KB Output is correct
27 Correct 827 ms 115788 KB Output is correct
28 Correct 811 ms 115776 KB Output is correct
29 Correct 1050 ms 120032 KB Output is correct
30 Correct 884 ms 116600 KB Output is correct
31 Correct 771 ms 114552 KB Output is correct
32 Correct 984 ms 118912 KB Output is correct
33 Correct 770 ms 114552 KB Output is correct
34 Correct 1066 ms 119800 KB Output is correct
35 Correct 664 ms 111608 KB Output is correct
36 Correct 709 ms 112504 KB Output is correct
37 Correct 788 ms 113272 KB Output is correct
38 Correct 1178 ms 121464 KB Output is correct
39 Correct 896 ms 115672 KB Output is correct
40 Correct 1156 ms 121332 KB Output is correct

Subtask #7
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 91640 KB Output is correct
2 Correct 54 ms 92028 KB Output is correct
3 Correct 56 ms 92024 KB Output is correct
4 Correct 50 ms 91768 KB Output is correct
5 Correct 46 ms 91640 KB Output is correct
6 Correct 54 ms 91896 KB Output is correct
7 Correct 56 ms 91896 KB Output is correct
8 Correct 55 ms 92024 KB Output is correct
9 Correct 52 ms 91896 KB Output is correct
10 Correct 55 ms 92024 KB Output is correct
11 Correct 56 ms 92024 KB Output is correct
12 Correct 50 ms 91768 KB Output is correct
13 Correct 755 ms 118516 KB Output is correct
14 Correct 493 ms 109244 KB Output is correct
15 Correct 532 ms 110584 KB Output is correct
16 Correct 579 ms 112248 KB Output is correct
17 Correct 664 ms 115448 KB Output is correct
18 Correct 885 ms 123256 KB Output is correct
19 Correct 607 ms 113016 KB Output is correct
20 Correct 638 ms 111364 KB Output is correct
21 Correct 778 ms 115448 KB Output is correct
22 Correct 911 ms 118192 KB Output is correct
23 Correct 798 ms 118648 KB Output is correct
24 Correct 821 ms 116728 KB Output is correct
25 Correct 859 ms 116856 KB Output is correct
26 Correct 645 ms 111864 KB Output is correct
27 Correct 827 ms 115788 KB Output is correct
28 Correct 811 ms 115776 KB Output is correct
29 Correct 1050 ms 120032 KB Output is correct
30 Correct 884 ms 116600 KB Output is correct
31 Correct 771 ms 114552 KB Output is correct
32 Correct 792 ms 121652 KB Output is correct
33 Correct 466 ms 108024 KB Output is correct
34 Correct 513 ms 109304 KB Output is correct
35 Correct 713 ms 117112 KB Output is correct
36 Correct 691 ms 116344 KB Output is correct
37 Correct 733 ms 117752 KB Output is correct
38 Correct 993 ms 126072 KB Output is correct
39 Correct 56 ms 92024 KB Output is correct
40 Correct 53 ms 91984 KB Output is correct
41 Correct 53 ms 91896 KB Output is correct
42 Correct 52 ms 91896 KB Output is correct
43 Correct 52 ms 91896 KB Output is correct
44 Correct 55 ms 92024 KB Output is correct
45 Correct 54 ms 91896 KB Output is correct
46 Correct 53 ms 91896 KB Output is correct
47 Correct 56 ms 92024 KB Output is correct
48 Correct 55 ms 92024 KB Output is correct
49 Correct 56 ms 92024 KB Output is correct
50 Correct 54 ms 92024 KB Output is correct
51 Correct 54 ms 92024 KB Output is correct
52 Correct 55 ms 92024 KB Output is correct
53 Correct 52 ms 91928 KB Output is correct
54 Correct 52 ms 91896 KB Output is correct
55 Correct 53 ms 91896 KB Output is correct
56 Correct 59 ms 92024 KB Output is correct
57 Correct 984 ms 118912 KB Output is correct
58 Correct 770 ms 114552 KB Output is correct
59 Correct 1066 ms 119800 KB Output is correct
60 Correct 664 ms 111608 KB Output is correct
61 Correct 709 ms 112504 KB Output is correct
62 Correct 788 ms 113272 KB Output is correct
63 Correct 1178 ms 121464 KB Output is correct
64 Correct 896 ms 115672 KB Output is correct
65 Correct 1156 ms 121332 KB Output is correct
66 Correct 746 ms 116300 KB Output is correct
67 Correct 984 ms 120092 KB Output is correct
68 Correct 700 ms 114808 KB Output is correct
69 Correct 902 ms 117368 KB Output is correct
70 Correct 710 ms 112720 KB Output is correct
71 Correct 1147 ms 120696 KB Output is correct
72 Correct 754 ms 112856 KB Output is correct
73 Correct 974 ms 116728 KB Output is correct
74 Correct 605 ms 109816 KB Output is correct
75 Correct 973 ms 116900 KB Output is correct
76 Correct 676 ms 111328 KB Output is correct
77 Correct 926 ms 116600 KB Output is correct
78 Correct 662 ms 110564 KB Output is correct
79 Correct 822 ms 114040 KB Output is correct
80 Correct 1030 ms 118008 KB Output is correct
81 Correct 677 ms 110968 KB Output is correct
82 Correct 878 ms 114428 KB Output is correct
83 Correct 605 ms 108664 KB Output is correct
84 Correct 675 ms 109692 KB Output is correct
85 Correct 617 ms 108664 KB Output is correct
86 Correct 1062 ms 117496 KB Output is correct
87 Correct 617 ms 108540 KB Output is correct
88 Correct 1117 ms 121720 KB Output is correct
89 Correct 847 ms 113624 KB Output is correct
90 Correct 766 ms 111864 KB Output is correct
91 Correct 1258 ms 126188 KB Output is correct
92 Correct 1132 ms 120124 KB Output is correct
93 Correct 1240 ms 122872 KB Output is correct
94 Correct 1228 ms 122704 KB Output is correct
95 Correct 1081 ms 119160 KB Output is correct
96 Correct 932 ms 116644 KB Output is correct
97 Correct 1160 ms 120564 KB Output is correct
98 Correct 804 ms 113016 KB Output is correct
99 Correct 857 ms 115704 KB Output is correct
100 Correct 825 ms 114680 KB Output is correct