Submission #1346540

#	Time	Username	Problem	Language	Result	Execution time	Memory
1346540		retarde	Bikeparking (EGOI24_bikeparking)	C++20	68 / 100	1095 ms	9828 KiB

Main

#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;

inline void solve() {
    int n; cin >> n;
    vi x(n); for (int i = 0; i < n; i++) cin >> x[i];
    vi y(n); for (int i = 0; i < n; i++) cin >> y[i];
    vi ysuf(n); ysuf[n - 1] = y[n - 1]; for (int i = n-2; i >= 0; i--) ysuf[i] = ysuf[i + 1] + y[i];
    vi b(n);

    int ptr = 0, ans = 0;
    for (int i = 0; i < n; i++) {
        if (!y[i]) continue;

        for (int j = i - 1; j >= 0; j--) {
            int m = min(y[i], x[j]);
            x[j] -= m; y[i] -= m;
            ans += m;
            if (y[i] == 0) break;
        }

        if (y[i]) {
            // bruh
            // send all ahead, later do stuff
            ans -= y[i];
            b[i] = 1;
            continue;
        }

        // while (ptr <= n) {
        //     cout << i+1 << " " << ptr+1 << '\n';
        //     // bad
        //     if (ptr > i) {
        //         cout << "bad\n";
        //         ans -= y[i];
        //         y[i] = 0;
        //         continue;
        //     }

        //     // good
        //     if (ptr < i) {
        //         cout << "good\n";
        //         int m = min(y[i], x[ptr]);
        //         y[i] -= m;
        //         x[ptr] -= m;
        //         ans += m;
        //         if (y[i] == 0) break;
        //         else {
        //             ptr++;
        //             continue;
        //         }
        //     }

        //     // bruh
        //     if (ptr == i) {
        //         cout << "bruh\n";
        //         // send these away, later collect
        //         ans -= y[i];
        //         b[i] = 1;
        //         // y[i] = 0;
        //         break;
        //     }
        // }
    }

    for (int i = 0; i < n; i++) {
        if (!b[i]) continue;
        ans += min(x[i], y[i]);
    }

    // assert(accumulate(all(y), (int)0) == 0);
    cout << ans << '\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)

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

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 19 / 19
• Subtask 4: 24 / 24
• Subtask 5: 0 / 32