답안 #928546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928546	2024-02-16T15:58:42 Z	pan	Jelly Flavours (IOI20_jelly)	C++17	24 / 100	38 ms	896 KB

jelly

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define auto set<pi>:: iterator 
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = LLONG_MAX/2;
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b)
{
	ll n  = a.size();
	vector<pi> jelly(n);
	for (ll i=0; i<n; ++i) jelly[i] = mp(a[i], b[i]);
	sort(jelly.begin(), jelly.end());
	vector<ll> prevv(x+1, 0);
	vector<ll> dp;
	prevv[0] = 0;
	ll i;
	for (i=0; i<n; ++i)
	{
		ll can = 0;
		dp.assign(x+1, INF);
		ll A = jelly[i].f, B = jelly[i].s;
		for (ll j=0; j<=x; ++j)
		{
			dp[j] = prevv[j]+B;
			if (j-A>=0) dp[j] = min(dp[j], prevv[j-A]);
			can|=(dp[j]<=y);
		}
		if (!can) break;
		swap(dp, prevv);
	}
	return i;
}

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '8', found: '7'
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '8', found: '7'
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	348 KB	1st lines differ - on the 1st token, expected: '689', found: '65'
2	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	604 KB	Output is correct
2	Correct	2 ms	600 KB	Output is correct
3	Correct	2 ms	856 KB	Output is correct
4	Correct	32 ms	604 KB	Output is correct
5	Correct	32 ms	640 KB	Output is correct
6	Correct	2 ms	604 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	31 ms	660 KB	Output is correct
10	Correct	30 ms	600 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	2 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	2 ms	444 KB	Output is correct
19	Correct	26 ms	604 KB	Output is correct
20	Correct	22 ms	604 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	2 ms	604 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	32 ms	604 KB	Output is correct
25	Correct	32 ms	604 KB	Output is correct
26	Correct	2 ms	800 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	33 ms	636 KB	Output is correct
30	Correct	35 ms	604 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	1 ms	344 KB	Output is correct
37	Correct	2 ms	604 KB	Output is correct
38	Correct	2 ms	448 KB	Output is correct
39	Correct	27 ms	664 KB	Output is correct
40	Correct	23 ms	644 KB	Output is correct
41	Correct	2 ms	604 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	31 ms	444 KB	Output is correct
45	Correct	32 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	31 ms	604 KB	Output is correct
50	Correct	35 ms	632 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Correct	1 ms	348 KB	Output is correct
55	Correct	2 ms	348 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	2 ms	452 KB	Output is correct
58	Correct	2 ms	604 KB	Output is correct
59	Correct	27 ms	600 KB	Output is correct
60	Correct	22 ms	604 KB	Output is correct
61	Correct	2 ms	604 KB	Output is correct
62	Correct	2 ms	604 KB	Output is correct
63	Correct	2 ms	604 KB	Output is correct
64	Correct	32 ms	604 KB	Output is correct
65	Correct	32 ms	604 KB	Output is correct
66	Correct	2 ms	604 KB	Output is correct
67	Correct	2 ms	604 KB	Output is correct
68	Correct	2 ms	604 KB	Output is correct
69	Correct	31 ms	604 KB	Output is correct
70	Correct	30 ms	600 KB	Output is correct
71	Correct	1 ms	344 KB	Output is correct
72	Correct	1 ms	348 KB	Output is correct
73	Correct	1 ms	344 KB	Output is correct
74	Correct	1 ms	348 KB	Output is correct
75	Correct	2 ms	512 KB	Output is correct
76	Correct	1 ms	444 KB	Output is correct
77	Correct	2 ms	604 KB	Output is correct
78	Correct	2 ms	604 KB	Output is correct
79	Correct	29 ms	852 KB	Output is correct
80	Correct	22 ms	604 KB	Output is correct
81	Correct	2 ms	600 KB	Output is correct
82	Correct	2 ms	604 KB	Output is correct
83	Correct	2 ms	604 KB	Output is correct
84	Correct	31 ms	664 KB	Output is correct
85	Correct	32 ms	600 KB	Output is correct
86	Correct	2 ms	604 KB	Output is correct
87	Correct	2 ms	656 KB	Output is correct
88	Correct	2 ms	472 KB	Output is correct
89	Correct	31 ms	600 KB	Output is correct
90	Correct	31 ms	856 KB	Output is correct
91	Correct	1 ms	348 KB	Output is correct
92	Correct	1 ms	500 KB	Output is correct
93	Correct	1 ms	348 KB	Output is correct
94	Correct	1 ms	348 KB	Output is correct
95	Correct	2 ms	348 KB	Output is correct
96	Correct	1 ms	348 KB	Output is correct
97	Correct	2 ms	412 KB	Output is correct
98	Correct	2 ms	604 KB	Output is correct
99	Correct	27 ms	640 KB	Output is correct

Subtask #5

14.0 / 14.0

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

Subtask #6

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	1st lines differ - on the 1st token, expected: '8', found: '7'
2	Halted	0 ms	0 KB	-