Submission #1098371

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1098371	2024-10-09T10:47:52 Z	ALTAKEXE	Bikeparking (EGOI24_bikeparking)	C++17	16 / 100	33 ms	4244 KB

Main

#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define inf INT_MAX
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
const int MOD = 1e9 + 7;
using namespace std;
int main()
{
  ll n, ans = 0;
  cin >> n;
  ll x[100001], y[100001];
  for (ll i = 0; i < n; i++)
    cin >> x[i];
  for (ll i = 0; i < n; i++)
    cin >> y[i];
  ll i = 0, j = 1;
  while (1)
  {
    while (i < n && !x[i])
      i++;
    if (i == n)
      break;
    if (i >= j)
      j = i + 1;
    while (j < n && !y[j])
      j++;
    if (j == n)
      break;
    ll curr = min(x[i], y[j]);
    ans += curr;
    x[i] -= curr;
    y[j] -= curr;
  }
  for (ll i = 0; i < n; i++)
    ans -= max(0ll, y[i] - x[i]);
  cout << ans << endl;
  return 0;
}

Subtask #1

16.0 / 16.0

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

Subtask #2

0.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1884 KB	Output is correct
2	Correct	1 ms	1884 KB	Output is correct
3	Correct	1 ms	1884 KB	Output is correct
4	Correct	1 ms	1884 KB	Output is correct
5	Runtime error	18 ms	4244 KB	Execution killed with signal 11
6	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1884 KB	Output is correct
2	Runtime error	33 ms	4152 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1884 KB	Output is correct
2	Correct	1 ms	1884 KB	Output is correct
3	Correct	2 ms	1880 KB	Output is correct
4	Correct	1 ms	1884 KB	Output is correct
5	Correct	1 ms	1884 KB	Output is correct
6	Correct	1 ms	1884 KB	Output is correct
7	Correct	1 ms	1884 KB	Output is correct
8	Correct	1 ms	1884 KB	Output is correct
9	Correct	1 ms	1884 KB	Output is correct
10	Correct	1 ms	1884 KB	Output is correct
11	Correct	1 ms	1884 KB	Output is correct
12	Correct	1 ms	1884 KB	Output is correct
13	Correct	1 ms	1880 KB	Output is correct
14	Correct	1 ms	1884 KB	Output is correct
15	Correct	1 ms	1884 KB	Output is correct
16	Correct	1 ms	1884 KB	Output is correct
17	Correct	1 ms	2136 KB	Output is correct
18	Correct	1 ms	1884 KB	Output is correct
19	Correct	1 ms	1884 KB	Output is correct
20	Correct	1 ms	1884 KB	Output is correct
21	Correct	1 ms	1884 KB	Output is correct
22	Correct	1 ms	1884 KB	Output is correct
23	Correct	1 ms	1884 KB	Output is correct
24	Correct	1 ms	1884 KB	Output is correct
25	Correct	1 ms	1884 KB	Output is correct
26	Correct	1 ms	1884 KB	Output is correct
27	Correct	1 ms	1884 KB	Output is correct
28	Correct	1 ms	1884 KB	Output is correct
29	Correct	1 ms	1880 KB	Output is correct
30	Correct	1 ms	1884 KB	Output is correct
31	Correct	1 ms	1884 KB	Output is correct
32	Correct	1 ms	1884 KB	Output is correct
33	Correct	1 ms	1940 KB	Output is correct
34	Correct	1 ms	1884 KB	Output is correct
35	Correct	1 ms	1884 KB	Output is correct
36	Correct	1 ms	1884 KB	Output is correct
37	Correct	1 ms	1884 KB	Output is correct
38	Correct	1 ms	1884 KB	Output is correct
39	Correct	1 ms	1884 KB	Output is correct
40	Correct	1 ms	1884 KB	Output is correct
41	Correct	1 ms	1884 KB	Output is correct
42	Correct	1 ms	1884 KB	Output is correct
43	Correct	1 ms	1992 KB	Output is correct
44	Correct	1 ms	1848 KB	Output is correct
45	Correct	1 ms	1884 KB	Output is correct
46	Correct	1 ms	1884 KB	Output is correct
47	Correct	2 ms	1884 KB	Output is correct
48	Correct	1 ms	1884 KB	Output is correct
49	Correct	1 ms	1884 KB	Output is correct
50	Incorrect	1 ms	1884 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1884 KB	Output is correct
2	Correct	1 ms	1884 KB	Output is correct
3	Correct	2 ms	1880 KB	Output is correct
4	Correct	1 ms	1884 KB	Output is correct
5	Correct	1 ms	1884 KB	Output is correct
6	Correct	1 ms	1884 KB	Output is correct
7	Correct	1 ms	1884 KB	Output is correct
8	Correct	1 ms	1884 KB	Output is correct
9	Correct	1 ms	1884 KB	Output is correct
10	Correct	1 ms	1884 KB	Output is correct
11	Correct	1 ms	1884 KB	Output is correct
12	Correct	1 ms	1884 KB	Output is correct
13	Correct	1 ms	1880 KB	Output is correct
14	Correct	1 ms	1884 KB	Output is correct
15	Correct	1 ms	1884 KB	Output is correct
16	Correct	1 ms	1884 KB	Output is correct
17	Correct	1 ms	2136 KB	Output is correct
18	Correct	1 ms	1884 KB	Output is correct
19	Correct	1 ms	1884 KB	Output is correct
20	Correct	1 ms	1884 KB	Output is correct
21	Correct	1 ms	1884 KB	Output is correct
22	Correct	1 ms	1884 KB	Output is correct
23	Correct	1 ms	1884 KB	Output is correct
24	Correct	1 ms	1884 KB	Output is correct
25	Correct	1 ms	1884 KB	Output is correct
26	Runtime error	18 ms	4244 KB	Execution killed with signal 11
27	Halted	0 ms	0 KB	-