oj.uz

답안 #225232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225232 2020-04-19T18:29:38 Z PedroBigMan Solar Storm (NOI20_solarstorm) C++14
100 / 100
 1167 ms 195480 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF 100000000000000000LL
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

class SucPath
{
    public:
    ll N;
    vector<int> fo;
    vector<vector<int> > f2; //sparse table of steps powers of 2
    ll ms; //max_steps
    
    SucPath(vector<int> x, ll max_steps) 
    {
        N=x.size(); fo=x; ms=max_steps;
        vector<int> xx;
        REP(i,0,(ll) (floor(log2(ms)))+1LL) {xx.pb(0);}
        REP(i,0,N) {f2.pb(xx);}
        Conf2(0);
    }
    
    void Conf2(ll e) //O(NlogN)
    {
        if((1LL<<e)>ms) {return;}
        if(e==0) {REP(i,0,N) {f2[i][e]=fo[i];} Conf2(e+1);}
        else 
        {
            REP(i,0,N) 
            {
                f2[i][e]=f2[f2[i][e-1]][e-1];
            }
        }
        Conf2(e+1);
    }
    
    ll f(ll x,ll s) //O(logN)
    {
        ll ind=0; 
        while(s>0) 
        {
            if(s%2!=0) {x=f2[x][ind];}
            s/=2; ind++;
        }
        return x;
    }
};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N,S,K; cin>>N>>S>>K;
    vector<ll> p,d,v; In(d,N-1); In(v,N);
    p.pb(0LL); ll curpos=0LL;
    REP(i,0,N-1) {curpos+=d[i]; p.pb(curpos);}
    vector<int> nxt; vector<ll> cen;
    REP(i,0,N)
    {
        ll val = (ll) (upper_bound(p.begin(),p.end(),p[i]+K)-p.begin()); val--;
        cen.pb(val);
        val=(ll) (upper_bound(p.begin(),p.end(),p[val]+K)-p.begin()); val--;
        nxt.pb(val+1);
    }
    nxt.pb(N);
    SucPath P(nxt,S);
    vector<ll> ps; ll cursum=0LL; ps.pb(cursum); REP(i,0,N) {cursum+=v[i]; ps.pb(cursum);}
    ll ans=0LL; ll cur; ll start=0LL; ll val;
    REP(i,0,N)
    {
        cur=P.f(i,S)-1LL;
        val=ps[cur+1]-ps[i];
        if(val>ans) {ans=val; start=i;}
    }
    cout<<S<<endl; cur=start;
    REP(i,0,S)
    {
        cout<<cen[cur]+1LL<<" ";
        cur=nxt[cur];
        if(cur>=N) {cur=N-1;}
    }
    cout<<endl;
    return 0;
}

Compilation message

SolarStorm.cpp: In function 'void Out(std::vector<long long int>)':
SolarStorm.cpp:14:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
SolarStorm.cpp:23:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
SolarStorm.cpp:23:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 1596 KB Output is correct
3 Correct 9 ms 1724 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 8 ms 1724 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1596 KB Output is correct
11 Correct 9 ms 1724 KB Output is correct
12 Correct 6 ms 896 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 351 ms 104672 KB Output is correct
2 Correct 251 ms 71584 KB Output is correct
3 Correct 271 ms 75172 KB Output is correct
4 Correct 294 ms 81060 KB Output is correct
5 Correct 358 ms 92788 KB Output is correct
6 Correct 442 ms 120488 KB Output is correct
7 Correct 292 ms 83356 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 1596 KB Output is correct
3 Correct 9 ms 1724 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 8 ms 1724 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1596 KB Output is correct
11 Correct 9 ms 1724 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 351 ms 104672 KB Output is correct
14 Correct 251 ms 71584 KB Output is correct
15 Correct 271 ms 75172 KB Output is correct
16 Correct 294 ms 81060 KB Output is correct
17 Correct 358 ms 92788 KB Output is correct
18 Correct 442 ms 120488 KB Output is correct
19 Correct 292 ms 83356 KB Output is correct
20 Correct 267 ms 73648 KB Output is correct
21 Correct 347 ms 87592 KB Output is correct
22 Correct 406 ms 101916 KB Output is correct
23 Correct 338 ms 102300 KB Output is correct
24 Correct 337 ms 95676 KB Output is correct
25 Correct 369 ms 95752 KB Output is correct
26 Correct 283 ms 74160 KB Output is correct
27 Correct 356 ms 91944 KB Output is correct
28 Correct 360 ms 91020 KB Output is correct
29 Correct 451 ms 115104 KB Output is correct
30 Correct 372 ms 96164 KB Output is correct
31 Correct 344 ms 85664 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 780 ms 152808 KB Output is correct
2 Correct 383 ms 85048 KB Output is correct
3 Correct 349 ms 87968 KB Output is correct
4 Correct 431 ms 109832 KB Output is correct
5 Correct 370 ms 94984 KB Output is correct
6 Correct 366 ms 99980 KB Output is correct
7 Correct 994 ms 187272 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 1596 KB Output is correct
3 Correct 9 ms 1724 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 8 ms 1724 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1596 KB Output is correct
11 Correct 9 ms 1724 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 10 ms 1852 KB Output is correct
14 Correct 9 ms 1408 KB Output is correct
15 Correct 9 ms 1536 KB Output is correct
16 Correct 7 ms 1024 KB Output is correct
17 Correct 8 ms 1280 KB Output is correct
18 Correct 9 ms 1596 KB Output is correct
19 Correct 9 ms 1408 KB Output is correct
20 Correct 8 ms 1280 KB Output is correct
21 Correct 11 ms 1980 KB Output is correct
22 Correct 11 ms 2024 KB Output is correct
23 Correct 12 ms 1980 KB Output is correct
24 Correct 11 ms 1852 KB Output is correct
25 Correct 10 ms 1852 KB Output is correct
26 Correct 10 ms 1852 KB Output is correct
27 Correct 8 ms 1536 KB Output is correct
28 Correct 10 ms 1536 KB Output is correct
29 Correct 9 ms 1536 KB Output is correct
30 Correct 9 ms 1572 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 1596 KB Output is correct
3 Correct 9 ms 1724 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 8 ms 1724 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1596 KB Output is correct
11 Correct 9 ms 1724 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 351 ms 104672 KB Output is correct
14 Correct 251 ms 71584 KB Output is correct
15 Correct 271 ms 75172 KB Output is correct
16 Correct 294 ms 81060 KB Output is correct
17 Correct 358 ms 92788 KB Output is correct
18 Correct 442 ms 120488 KB Output is correct
19 Correct 292 ms 83356 KB Output is correct
20 Correct 267 ms 73648 KB Output is correct
21 Correct 347 ms 87592 KB Output is correct
22 Correct 406 ms 101916 KB Output is correct
23 Correct 338 ms 102300 KB Output is correct
24 Correct 337 ms 95676 KB Output is correct
25 Correct 369 ms 95752 KB Output is correct
26 Correct 283 ms 74160 KB Output is correct
27 Correct 356 ms 91944 KB Output is correct
28 Correct 360 ms 91020 KB Output is correct
29 Correct 451 ms 115104 KB Output is correct
30 Correct 372 ms 96164 KB Output is correct
31 Correct 344 ms 85664 KB Output is correct
32 Correct 430 ms 111192 KB Output is correct
33 Correct 375 ms 87556 KB Output is correct
34 Correct 508 ms 116488 KB Output is correct
35 Correct 338 ms 74528 KB Output is correct
36 Correct 338 ms 78728 KB Output is correct
37 Correct 359 ms 85788 KB Output is correct
38 Correct 529 ms 124680 KB Output is correct
39 Correct 408 ms 96392 KB Output is correct
40 Correct 553 ms 125832 KB Output is correct

Subtask #7
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 8 ms 1596 KB Output is correct
3 Correct 9 ms 1724 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 8 ms 1536 KB Output is correct
8 Correct 8 ms 1724 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1596 KB Output is correct
11 Correct 9 ms 1724 KB Output is correct
12 Correct 6 ms 896 KB Output is correct
13 Correct 351 ms 104672 KB Output is correct
14 Correct 251 ms 71584 KB Output is correct
15 Correct 271 ms 75172 KB Output is correct
16 Correct 294 ms 81060 KB Output is correct
17 Correct 358 ms 92788 KB Output is correct
18 Correct 442 ms 120488 KB Output is correct
19 Correct 292 ms 83356 KB Output is correct
20 Correct 267 ms 73648 KB Output is correct
21 Correct 347 ms 87592 KB Output is correct
22 Correct 406 ms 101916 KB Output is correct
23 Correct 338 ms 102300 KB Output is correct
24 Correct 337 ms 95676 KB Output is correct
25 Correct 369 ms 95752 KB Output is correct
26 Correct 283 ms 74160 KB Output is correct
27 Correct 356 ms 91944 KB Output is correct
28 Correct 360 ms 91020 KB Output is correct
29 Correct 451 ms 115104 KB Output is correct
30 Correct 372 ms 96164 KB Output is correct
31 Correct 344 ms 85664 KB Output is correct
32 Correct 780 ms 152808 KB Output is correct
33 Correct 383 ms 85048 KB Output is correct
34 Correct 349 ms 87968 KB Output is correct
35 Correct 431 ms 109832 KB Output is correct
36 Correct 370 ms 94984 KB Output is correct
37 Correct 366 ms 99980 KB Output is correct
38 Correct 994 ms 187272 KB Output is correct
39 Correct 10 ms 1852 KB Output is correct
40 Correct 9 ms 1408 KB Output is correct
41 Correct 9 ms 1536 KB Output is correct
42 Correct 7 ms 1024 KB Output is correct
43 Correct 8 ms 1280 KB Output is correct
44 Correct 9 ms 1596 KB Output is correct
45 Correct 9 ms 1408 KB Output is correct
46 Correct 8 ms 1280 KB Output is correct
47 Correct 11 ms 1980 KB Output is correct
48 Correct 11 ms 2024 KB Output is correct
49 Correct 12 ms 1980 KB Output is correct
50 Correct 11 ms 1852 KB Output is correct
51 Correct 10 ms 1852 KB Output is correct
52 Correct 10 ms 1852 KB Output is correct
53 Correct 8 ms 1536 KB Output is correct
54 Correct 10 ms 1536 KB Output is correct
55 Correct 9 ms 1536 KB Output is correct
56 Correct 9 ms 1572 KB Output is correct
57 Correct 430 ms 111192 KB Output is correct
58 Correct 375 ms 87556 KB Output is correct
59 Correct 508 ms 116488 KB Output is correct
60 Correct 338 ms 74528 KB Output is correct
61 Correct 338 ms 78728 KB Output is correct
62 Correct 359 ms 85788 KB Output is correct
63 Correct 529 ms 124680 KB Output is correct
64 Correct 408 ms 96392 KB Output is correct
65 Correct 553 ms 125832 KB Output is correct
66 Correct 568 ms 120816 KB Output is correct
67 Correct 795 ms 159120 KB Output is correct
68 Correct 568 ms 111624 KB Output is correct
69 Correct 667 ms 136080 KB Output is correct
70 Correct 334 ms 91784 KB Output is correct
71 Correct 681 ms 140424 KB Output is correct
72 Correct 432 ms 92680 KB Output is correct
73 Correct 498 ms 118024 KB Output is correct
74 Correct 308 ms 72256 KB Output is correct
75 Correct 525 ms 121096 KB Output is correct
76 Correct 380 ms 87312 KB Output is correct
77 Correct 679 ms 139024 KB Output is correct
78 Correct 332 ms 83592 KB Output is correct
79 Correct 444 ms 105480 KB Output is correct
80 Correct 566 ms 129544 KB Output is correct
81 Correct 307 ms 79560 KB Output is correct
82 Correct 415 ms 97664 KB Output is correct
83 Correct 268 ms 63424 KB Output is correct
84 Correct 292 ms 74308 KB Output is correct
85 Correct 276 ms 64312 KB Output is correct
86 Correct 473 ms 114568 KB Output is correct
87 Correct 276 ms 64696 KB Output is correct
88 Correct 920 ms 176136 KB Output is correct
89 Correct 424 ms 94984 KB Output is correct
90 Correct 377 ms 87088 KB Output is correct
91 Correct 1014 ms 195480 KB Output is correct
92 Correct 800 ms 173320 KB Output is correct
93 Correct 1167 ms 192240 KB Output is correct
94 Correct 1040 ms 192204 KB Output is correct
95 Correct 870 ms 171664 KB Output is correct
96 Correct 852 ms 139664 KB Output is correct
97 Correct 1006 ms 182148 KB Output is correct
98 Correct 681 ms 123332 KB Output is correct
99 Correct 694 ms 134664 KB Output is correct
100 Correct 670 ms 130428 KB Output is correct