제출 #1101298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101298		vjudge1	Solar Storm (NOI20_solarstorm)	C++17	100 / 100	535 ms	210856 KiB

SolarStorm

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                     1000005
#define LOG                          21

int nArr, nShield;
long long radian;
long long dist[MAX], value[MAX], sum[MAX];
int to[MAX];

int jmp[MAX][LOG];


int jump(int u, int dis){
    for (; dis > 0; dis ^= (dis & -dis)){
        int i = __builtin_ctz(dis & -dis);

        u = jmp[u][i] + 1;
        if(u == nArr + 1) break;
    }
    return u - 1;
}


void process(void){
    cin >> nArr >> nShield >> radian;
    for (int i = 2; i <= nArr; ++i){
        cin >> dist[i];
        sum[i] = sum[i - 1] + dist[i];
    }
    for (int i = 1; i <= nArr; ++i) cin >> value[i], value[i] += value[i - 1];
    int j = 1;
    for (int i = 1; i <= nArr; ++i){
        maximize(j, i);
        while (j <= nArr and sum[j] - sum[i] <= radian) ++j;

        to[i] = j - 1;
    }
    for (int i = 1; i <= nArr; ++i){
        jmp[i][0] = to[to[i]];
    }

    for (int i = 1; i < LOG; ++i){
        for (int u = 1; u <= nArr; ++u){
            jmp[u][i] = jmp[min(jmp[u][i - 1] + 1, nArr)][i - 1];
        }
    }
    long long ans = 0, pos = 0;
    for (int l = 1; l <= nArr; ++l){
        int r = jump(l, nShield);
        if(maximize(ans, value[r] - value[l - 1])){
            pos = l;
        }
    }

//    cout << ans << '\n';
    vector<int> res;
    for (int i = 1; i <= nShield; ++i){
        if(pos <= nArr)
            res.emplace_back(to[pos]);
        else{
            break;
        }
        pos = jmp[pos][0] + 1;
    }
    cout << (int)res.size() << '\n';
    for (int&v : res) cout << v << " ";
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

• Subtask 1: 10 / 10
• Subtask 2: 7 / 7
• Subtask 3: 11 / 11
• Subtask 4: 8 / 8
• Subtask 5: 18 / 18
• Subtask 6: 16 / 16
• Subtask 7: 30 / 30