| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346560 | retarde | Bikeparking (EGOI24_bikeparking) | C++20 | 177 ms | 39292 KiB |
#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;
int n;
vi pre;
int sm(int l, int r) {
return pre[r + 1] - pre[l];
}
inline void solve() {
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);
pre.resize(n + 1);
for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + x[i - 1];
set<pii> activ;
int ptr = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (!y[i]) {
activ.insert({i, x[i]});
continue;
}
// go thru actives and complete
vector<pii> rem, ad;
for (auto it = activ.rbegin(); it != activ.rend(); it++) {
pii p = *it;
int j = p.fi; int v = p.se;
int m = min(v, y[i]);
y[i] -= m;
x[j] -=m;
ans += m;
if (y[i] == 0) {
// this guy is done
rem.pb(p);
pii z2 = p;
z2.se -= m;
ad.pb(z2);
break;
} else {
// this guy is done
rem.pb(p);
}
}
for (auto &z : rem) activ.erase(z);
for (auto &z : ad) activ.insert(z);
// 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;
activ.insert({i, x[i]});
continue;
}
activ.insert({i, x[i]});
// 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();
}
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
