oj.uz

Submission #1048196

# Submission time Handle Problem Language Result Execution time Memory
1048196 2024-08-08T04:54:35 Z 박영우(#11091) Bikeparking (EGOI24_bikeparking) C++17
40 / 100
 1000 ms 26956 KB 
//#define LOCAL
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 2010101
#define MAXQ 101010
#define INF 1'000'000'100'000'000'000
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
#define TC 1
#ifdef LOCAL
#define DEBUG(a) cout<<a
#define TEST true
#else
#define DEBUG(...) 1234
#define TEST false
#endif
int X[MAX], Y[MAX];
int XX[MAX], YY[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	int i;
	set<int> st;
	int sx, sy;
	sx = sy = 0;
	for (i = 0; i < N; i++) cin >> X[i], XX[i] = X[i], sx += X[i];
	for (i = 0; i < N; i++) cin >> Y[i], YY[i] = Y[i], sy += Y[i];
	int l, r;
	l = 0;
	r = 1e9 + 10;
	auto get = [&](int x) {
		int i;
		for (i = 0; i < N; i++) {
			X[i] = XX[i];
			Y[i] = YY[i];
		}
		int rem = x;
		for (i = 0; i < N; i++) {
			int m = min(rem, Y[i]);
			Y[i] -= m;
			rem -= m;
		}

		rem = x + sx - sy;
		for (i = N - 1; i >= 0; i--) {
			int m = min(rem, X[i]);
			X[i] -= m;
			rem -= m;
		}

		for (i = 0; i < N; i++) if (X[i]) st.insert(i);
		ll sum = 0;
		int chk = 0;
		for (i = N - 1; i >= 0; i--) {
			while (Y[i]) {
				auto it = st.upper_bound(i);
				if (it == st.begin()) return -(ll)INF;
				else {
					it--;
					int m = min(Y[i], X[*it]);
					Y[i] -= m;
					X[*it] -= m;
					if (*it != i) sum += m;
					if (!X[*it]) st.erase(it);
				}
			}
			if (chk) break;
		}
		return (ll)sum - x;
	};
	while (r - l > 20) {
		int m = l + r >> 1;
		ll r1 = get(m);
		ll r2 = get(m + 1);
		if (r1 <= -INF) {
			l = m;
			continue;
		}
		if (r1 == r2) {
			cout << r1 << ln;
			return 0;
		}
		if (r1 < r2) l = m;
		else r = m + 1;
	}
	ll ans = -INF;
	for (i = l; i <= r; i++) ans = max(ans, get(i));
	cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:83:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |   int m = l + r >> 1;
      |           ~~^~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 0 ms 6492 KB Output is correct
12 Correct 0 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 0 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 0 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 125 ms 12920 KB Output is correct
6 Execution timed out 1071 ms 26956 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 129 ms 12920 KB Output is correct
3 Execution timed out 1059 ms 26956 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 0 ms 6492 KB Output is correct
12 Correct 0 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 0 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 0 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 0 ms 6492 KB Output is correct
25 Correct 0 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6544 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 0 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6488 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 1 ms 6492 KB Output is correct
40 Correct 0 ms 6492 KB Output is correct
41 Correct 0 ms 6492 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 0 ms 6492 KB Output is correct
46 Correct 0 ms 6492 KB Output is correct
47 Correct 0 ms 6492 KB Output is correct
48 Correct 0 ms 6492 KB Output is correct
49 Correct 0 ms 6492 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 1 ms 6492 KB Output is correct
52 Correct 1 ms 6492 KB Output is correct
53 Correct 1 ms 6492 KB Output is correct
54 Correct 1 ms 6492 KB Output is correct
55 Correct 1 ms 6492 KB Output is correct
56 Correct 1 ms 6492 KB Output is correct
57 Correct 1 ms 6492 KB Output is correct
58 Correct 1 ms 6492 KB Output is correct
59 Correct 1 ms 6492 KB Output is correct
60 Correct 1 ms 6492 KB Output is correct
61 Correct 1 ms 6492 KB Output is correct
62 Correct 1 ms 6492 KB Output is correct
63 Correct 1 ms 6492 KB Output is correct
64 Correct 1 ms 6492 KB Output is correct
65 Correct 1 ms 6488 KB Output is correct
66 Correct 1 ms 6492 KB Output is correct
67 Correct 1 ms 6492 KB Output is correct
68 Correct 1 ms 6492 KB Output is correct
69 Correct 1 ms 6492 KB Output is correct
70 Correct 1 ms 6492 KB Output is correct
71 Correct 1 ms 6492 KB Output is correct
72 Correct 0 ms 6492 KB Output is correct
73 Correct 1 ms 6492 KB Output is correct
74 Correct 1 ms 6492 KB Output is correct
75 Correct 0 ms 6492 KB Output is correct
76 Correct 1 ms 6492 KB Output is correct
77 Correct 0 ms 6492 KB Output is correct
78 Correct 0 ms 6492 KB Output is correct
79 Correct 0 ms 6492 KB Output is correct
80 Correct 1 ms 6492 KB Output is correct
81 Correct 1 ms 6492 KB Output is correct
82 Correct 1 ms 6492 KB Output is correct
83 Correct 1 ms 6488 KB Output is correct
84 Correct 1 ms 6492 KB Output is correct
85 Correct 1 ms 6492 KB Output is correct
86 Correct 1 ms 6492 KB Output is correct
87 Correct 1 ms 6492 KB Output is correct
88 Correct 1 ms 6492 KB Output is correct
89 Correct 1 ms 6492 KB Output is correct
90 Correct 0 ms 6492 KB Output is correct
91 Correct 1 ms 6488 KB Output is correct

Subtask #5
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 0 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 0 ms 6492 KB Output is correct
12 Correct 0 ms 6492 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 0 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 0 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 125 ms 12920 KB Output is correct
27 Execution timed out 1071 ms 26956 KB Time limit exceeded
28 Halted 0 ms 0 KB -