Submission #1346364

#	Time	Username	Problem	Language	Result	Execution time	Memory
1346364		retarde	Bikeparking (EGOI24_bikeparking)	C++20	25 / 100	21 ms	7436 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];

    int ptr = 0, ans = 0;
    for (int i = 0; i < n; i++) {
        while (ptr <= n) {
            // definitely bad
            if (ptr > i) {
                ans -= y[i];
                y[i] = 0;
                break;
            }

            // neutral, seeing maybe send to far
            if (ptr == i) {
                int s = (i == n - 1 ? 0 : ysuf[i + 1]);
                int m = min(s, y[i]);;
                m = min(m, max(ysuf[i] - x[ptr], (int)0));
                // send m to far
                ans -= m;
                y[i] -= m;

                // use rest on cur
                int z = min(y[i], x[ptr]);
                y[i] -= z;
                x[ptr] -= z;

                if (y[i] == 0) break;
                else if (x[ptr] == 0) ptr++;
                else {
                    assert(false);
                }

                continue;
            }

            // good

            // too much people, not eenough slots
            if (y[i] > x[ptr]) {
                y[i] -= x[ptr];
                if (i != ptr) ans += x[ptr];
                ptr++;
                continue;
            }

            // enough slots
            x[ptr] -= y[i];
            if (i != ptr) ans += y[i];
            y[i] = 0;
            break;
        }
    }
    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:94:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:95:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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