답안 #1048209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1048209	2024-08-08T05:19:22 Z	ksun69(#11093)	Bikeparking (EGOI24_bikeparking)	C++17	100 / 100	39 ms	2904 KB

Main

#include <bits/stdc++.h>
using namespace std;

// B. Bike Parking
// Problem Name bikeparking
// Time Limit 1 second
// Memory Limit 1 gigabyte
// Sanne recently conceived a lucrative business idea: renting out premium bike parking at the
// Eindhoven train station. To maximize her profits, she divided the bike parking slots into N
// different tiers, numbered from 0 to N − 1. Tier 0, the premium tier, is located very close to the
// train platforms. Higher-numbered tiers consist of parking slots that are worse (the higher the tier,
// the worse the slot). The number of slots in tier t is x .
// Users parking their bikes are assigned their parking slot via an app. Each user has a subscription
// level and expects a parking slot in the corresponding tier. However, the terms of service do not
// guarantee users a slot in their respective tier.
// If a user with subscription level s is assigned a slot in tier t, then one of the following three things
// happens:
// 1. If t < s, the user will be happy and upvote the app.
// 2. If t = s, the user will be satisfied and will not do anything.
// 3. If t > s, the user will be angry and downvote the app.
// Today, Sanne's app has y + y + ... + y users, where y is the number of users with
// subscription level s. She needs your help to assign the users to the parking slots. Each user should
// get exactly one slot. No slot can be assigned to more than one user, but it is okay for some parking
// slots to not be assigned to any users. Furthermore, the total number of users does not exceed the
// total number of available parking slots.
// Sanne wants to maximize the rating of her app. Let U be the number of upvotes and D be the
// number of downvotes. Your task is to maximize U − D.
// Input
// The first line contains one integer N, the number of tiers or subscription levels.
// The second line contains N integers x ,x ,...,x , the number of slots in the different tiers.
// t
// 0 1 N−1 s
// 0 1 N−1
// bikeparking (1 of 4) 
// The third line contains N integers y , y ,..., y , the number of users with each subscription
// level.
// Output
// Output one integer, the maximum possible value of U − D by assigning the users to parking slots
// optimally

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int N;
	cin >> N;
	vector<int> x(N), y(N);
	for(int i = 0; i < N; i++) cin >> x[i]; // slots
	for(int i = 0; i < N; i++) cin >> y[i]; // users

	int score = 0;
	for(int a : y) score += a;

	int del = 0;
	int m1 = 0, m2 = 0;

	for(int i = 0; i < N; i++){
		del += y[i];
		m2 = max(m2, del);
		if(m2 > m1) swap(m1, m2);
		del -= x[i];
	}
	int ans = m1 + m2;
	cout << (score - ans) << '\n';
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	408 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	372 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	17 ms	2812 KB	Output is correct
6	Correct	18 ms	2820 KB	Output is correct
7	Correct	27 ms	2812 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	20 ms	2812 KB	Output is correct
3	Correct	20 ms	2808 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	22 ms	2760 KB	Output is correct
11	Correct	20 ms	2652 KB	Output is correct
12	Correct	20 ms	2820 KB	Output is correct
13	Correct	19 ms	2812 KB	Output is correct
14	Correct	17 ms	2652 KB	Output is correct
15	Correct	17 ms	2816 KB	Output is correct
16	Correct	21 ms	2804 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #4
24.0 / 24.0

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

Subtask #5
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	408 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	372 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	17 ms	2812 KB	Output is correct
27	Correct	18 ms	2820 KB	Output is correct
28	Correct	27 ms	2812 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	20 ms	2812 KB	Output is correct
34	Correct	20 ms	2808 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	22 ms	2760 KB	Output is correct
42	Correct	20 ms	2652 KB	Output is correct
43	Correct	20 ms	2820 KB	Output is correct
44	Correct	19 ms	2812 KB	Output is correct
45	Correct	17 ms	2652 KB	Output is correct
46	Correct	17 ms	2816 KB	Output is correct
47	Correct	21 ms	2804 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	344 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	348 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	0 ms	348 KB	Output is correct
76	Correct	0 ms	348 KB	Output is correct
77	Correct	0 ms	348 KB	Output is correct
78	Correct	0 ms	348 KB	Output is correct
79	Correct	0 ms	348 KB	Output is correct
80	Correct	0 ms	348 KB	Output is correct
81	Correct	0 ms	348 KB	Output is correct
82	Correct	0 ms	348 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	0 ms	348 KB	Output is correct
85	Correct	0 ms	348 KB	Output is correct
86	Correct	0 ms	348 KB	Output is correct
87	Correct	0 ms	348 KB	Output is correct
88	Correct	0 ms	348 KB	Output is correct
89	Correct	0 ms	348 KB	Output is correct
90	Correct	0 ms	348 KB	Output is correct
91	Correct	0 ms	348 KB	Output is correct
92	Correct	0 ms	348 KB	Output is correct
93	Correct	0 ms	348 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct
100	Correct	0 ms	348 KB	Output is correct
101	Correct	0 ms	348 KB	Output is correct
102	Correct	0 ms	348 KB	Output is correct
103	Correct	0 ms	348 KB	Output is correct
104	Correct	0 ms	348 KB	Output is correct
105	Correct	0 ms	348 KB	Output is correct
106	Correct	0 ms	348 KB	Output is correct
107	Correct	1 ms	600 KB	Output is correct
108	Correct	0 ms	348 KB	Output is correct
109	Correct	0 ms	348 KB	Output is correct
110	Correct	0 ms	348 KB	Output is correct
111	Correct	0 ms	348 KB	Output is correct
112	Correct	0 ms	348 KB	Output is correct
113	Correct	0 ms	348 KB	Output is correct
114	Correct	0 ms	348 KB	Output is correct
115	Correct	0 ms	348 KB	Output is correct
116	Correct	0 ms	348 KB	Output is correct
117	Correct	0 ms	348 KB	Output is correct
118	Correct	0 ms	344 KB	Output is correct
119	Correct	0 ms	348 KB	Output is correct
120	Correct	0 ms	348 KB	Output is correct
121	Correct	0 ms	348 KB	Output is correct
122	Correct	0 ms	348 KB	Output is correct
123	Correct	0 ms	348 KB	Output is correct
124	Correct	0 ms	348 KB	Output is correct
125	Correct	0 ms	420 KB	Output is correct
126	Correct	0 ms	348 KB	Output is correct
127	Correct	0 ms	348 KB	Output is correct
128	Correct	0 ms	348 KB	Output is correct
129	Correct	0 ms	348 KB	Output is correct
130	Correct	0 ms	348 KB	Output is correct
131	Correct	0 ms	348 KB	Output is correct
132	Correct	0 ms	348 KB	Output is correct
133	Correct	0 ms	348 KB	Output is correct
134	Correct	0 ms	348 KB	Output is correct
135	Correct	0 ms	348 KB	Output is correct
136	Correct	0 ms	348 KB	Output is correct
137	Correct	0 ms	348 KB	Output is correct
138	Correct	0 ms	348 KB	Output is correct
139	Correct	0 ms	348 KB	Output is correct
140	Correct	0 ms	348 KB	Output is correct
141	Correct	0 ms	348 KB	Output is correct
142	Correct	0 ms	348 KB	Output is correct
143	Correct	15 ms	2820 KB	Output is correct
144	Correct	16 ms	2812 KB	Output is correct
145	Correct	22 ms	2652 KB	Output is correct
146	Correct	0 ms	348 KB	Output is correct
147	Correct	0 ms	348 KB	Output is correct
148	Correct	0 ms	348 KB	Output is correct
149	Correct	0 ms	348 KB	Output is correct
150	Correct	0 ms	348 KB	Output is correct
151	Correct	0 ms	348 KB	Output is correct
152	Correct	18 ms	2816 KB	Output is correct
153	Correct	19 ms	2816 KB	Output is correct
154	Correct	27 ms	2652 KB	Output is correct
155	Correct	19 ms	2816 KB	Output is correct
156	Correct	16 ms	2648 KB	Output is correct
157	Correct	16 ms	2812 KB	Output is correct
158	Correct	18 ms	2648 KB	Output is correct
159	Correct	0 ms	344 KB	Output is correct
160	Correct	0 ms	348 KB	Output is correct
161	Correct	0 ms	348 KB	Output is correct
162	Correct	0 ms	348 KB	Output is correct
163	Correct	1 ms	348 KB	Output is correct
164	Correct	0 ms	348 KB	Output is correct
165	Correct	0 ms	348 KB	Output is correct
166	Correct	0 ms	348 KB	Output is correct
167	Correct	0 ms	344 KB	Output is correct
168	Correct	0 ms	348 KB	Output is correct
169	Correct	0 ms	348 KB	Output is correct
170	Correct	0 ms	348 KB	Output is correct
171	Correct	0 ms	356 KB	Output is correct
172	Correct	0 ms	348 KB	Output is correct
173	Correct	0 ms	352 KB	Output is correct
174	Correct	0 ms	348 KB	Output is correct
175	Correct	0 ms	360 KB	Output is correct
176	Correct	0 ms	352 KB	Output is correct
177	Correct	0 ms	348 KB	Output is correct
178	Correct	0 ms	360 KB	Output is correct
179	Correct	0 ms	360 KB	Output is correct
180	Correct	0 ms	356 KB	Output is correct
181	Correct	0 ms	352 KB	Output is correct
182	Correct	0 ms	356 KB	Output is correct
183	Correct	0 ms	356 KB	Output is correct
184	Correct	0 ms	360 KB	Output is correct
185	Correct	0 ms	360 KB	Output is correct
186	Correct	0 ms	356 KB	Output is correct
187	Correct	0 ms	360 KB	Output is correct
188	Correct	0 ms	352 KB	Output is correct
189	Correct	0 ms	360 KB	Output is correct
190	Correct	0 ms	356 KB	Output is correct
191	Correct	0 ms	352 KB	Output is correct
192	Correct	0 ms	360 KB	Output is correct
193	Correct	0 ms	356 KB	Output is correct
194	Correct	0 ms	348 KB	Output is correct
195	Correct	0 ms	348 KB	Output is correct
196	Correct	0 ms	348 KB	Output is correct
197	Correct	15 ms	2820 KB	Output is correct
198	Correct	19 ms	2904 KB	Output is correct
199	Correct	18 ms	2652 KB	Output is correct
200	Correct	19 ms	2792 KB	Output is correct
201	Correct	23 ms	2648 KB	Output is correct
202	Correct	25 ms	2648 KB	Output is correct
203	Correct	19 ms	2648 KB	Output is correct
204	Correct	22 ms	2652 KB	Output is correct
205	Correct	22 ms	2816 KB	Output is correct
206	Correct	15 ms	2652 KB	Output is correct
207	Correct	19 ms	2652 KB	Output is correct
208	Correct	19 ms	2812 KB	Output is correct
209	Correct	19 ms	2648 KB	Output is correct
210	Correct	22 ms	2820 KB	Output is correct
211	Correct	39 ms	2652 KB	Output is correct
212	Correct	20 ms	2652 KB	Output is correct
213	Correct	27 ms	2900 KB	Output is correct
214	Correct	23 ms	2648 KB	Output is correct
215	Correct	15 ms	2820 KB	Output is correct
216	Correct	15 ms	2652 KB	Output is correct
217	Correct	16 ms	2820 KB	Output is correct
218	Correct	17 ms	2652 KB	Output is correct
219	Correct	0 ms	348 KB	Output is correct
220	Correct	0 ms	348 KB	Output is correct
221	Correct	0 ms	348 KB	Output is correct
222	Correct	0 ms	348 KB	Output is correct
223	Correct	0 ms	348 KB	Output is correct

답안 #1048209

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 9.0 / 9.0

Subtask #3 19.0 / 19.0

Subtask #4 24.0 / 24.0

Subtask #5 32.0 / 32.0

Subtask #1
16.0 / 16.0

Subtask #2
9.0 / 9.0

Subtask #3
19.0 / 19.0

Subtask #4
24.0 / 24.0

Subtask #5
32.0 / 32.0