Submission #1167783

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167783		vibeduck	Solar Storm (NOI20_solarstorm)	C++20	28 / 100	152 ms	31660 KiB

SolarStorm

#include <bits/stdc++.h> 
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

const int mxn = 1e6 + 5;
int d[mxn], p[mxn], v[mxn], vp[mxn];

int sv(int l, int r) {
    return vp[r + 1] - vp[l];
}

inline void solve() {
    int n, s, k;
    cin >> n >> s >> k;
    for (int i = 0; i < n - 1; i++) cin >> d[i];
    for (int i = 1; i < n; i++) p[i] = p[i - 1] + d[i - 1];
    for (int i = 0; i < n; i++) cin >> v[i];
    for (int i = 1; i <= n; i++) vp[i] = vp[i - 1] + v[i - 1];

    //for (int i = 0; i < n; i++) cout << p[i] << " ";
    //cout << '\n';
    //for (int i = 0; i < n; i++) cout << v[i] << " ";
    //cout << '\n';
    //cout << '\n';
    
    // s = 1
    pii ans = {-1e18, 0}; // {ben, id}
    for (int t = 0; t < n; t++) {
        int pos = p[t];

        int lo = t;
        int hi = n;
        while (hi > lo + 1) {
            int mid = (lo + hi) / 2;
            if (p[mid] - pos > k) hi = mid;
            else lo = mid;
        }
        int r = lo;

        int l;
        if (p[t] <= k) l = 0;
        else {
            int lo = 0;
            int hi = t;
            while (hi > lo + 1) {
                int mid = (lo + hi) / 2;
                if (p[t] - p[t-mid] > k) hi = mid;
                else lo = mid;
            }
            l = t-lo;
        }

        ans = max(ans, {sv(l, r), t});
        //cout << t + 1 << " gives " << sv(l, r) << '\n';
    }

    cout << "1\n";
    cout << ans.se + 1 << '\n';
    //cout << ans.fi << '\n';
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

SolarStorm.cpp: In function 'void setIO(std::string)':
SolarStorm.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
SolarStorm.cpp:92:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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