답안 #429919

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429919 2021-06-16T10:28:44 Z tinjyu Jelly Flavours (IOI20_jelly) C++14
9 / 100
55 ms 580 KB
#include "jelly.h"
#include <vector>
#include <iostream>
using namespace std;
long long int dp[100005][2];
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
	for(int i=0;i<n;i++)
	{
		for(int j=i-1;j>=0;j--)
		{
			if(a[j+1]<a[j])
			{
				swap(a[j+1],a[j]);
				swap(b[j+1],b[j]);
			}
		}
	}
	for(int i=1;i<=y;i++)
	{
		dp[i][0]=-1;
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<=y;j++)
		{
			long long int tmpc=-1,tmpd=0;
			if(dp[j][1]+a[i]<=x)
			{
				tmpc=dp[j][0]+1;
				tmpd=dp[j][1]+a[i];
			}
			if(j>=b[i])
			{
				if(dp[j-b[i]][0]+1>tmpc || (dp[j-b[i]][0]+1==tmpc && dp[j-b[i]][1]<tmpd))
				{
					tmpc=dp[j-b[i]][0]+1;
					tmpd=dp[j-b[i]][1];
				}
			}
			//cout<<tmpc<<" "<<tmpd<<"  ";
			if(tmpc>dp[j][0] || (dp[j][0]==tmpc && dp[j][1]>tmpd))
			{
				dp[j][0]=tmpc;
				dp[j][1]=tmpd;
			}
			//cout<<dp[j][0]<<" "<<dp[j][1]<<"  ";
		}
		//cout<<endl;
	}
	long long int ans=0;
	for(int i=0;i<=y;i++)
	{
		ans=max(dp[i][0],ans);
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB 1st lines differ - on the 1st token, expected: '8', found: '30'
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB 1st lines differ - on the 1st token, expected: '8', found: '30'
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 9 ms 332 KB Output is correct
3 Correct 6 ms 308 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 7 ms 340 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 7 ms 336 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 6 ms 332 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 7 ms 304 KB Output is correct
15 Correct 7 ms 332 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 6 ms 332 KB Output is correct
18 Correct 6 ms 332 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 6 ms 332 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 7 ms 332 KB Output is correct
24 Correct 7 ms 340 KB Output is correct
25 Correct 6 ms 332 KB Output is correct
26 Correct 8 ms 348 KB Output is correct
27 Correct 7 ms 312 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 6 ms 332 KB Output is correct
30 Correct 7 ms 304 KB Output is correct
31 Correct 9 ms 460 KB Output is correct
32 Correct 6 ms 368 KB Output is correct
33 Correct 9 ms 352 KB Output is correct
34 Correct 5 ms 332 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 6 ms 312 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 9 ms 332 KB Output is correct
39 Correct 8 ms 332 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 7 ms 332 KB Output is correct
42 Correct 7 ms 332 KB Output is correct
43 Correct 7 ms 332 KB Output is correct
44 Correct 7 ms 332 KB Output is correct
45 Correct 7 ms 348 KB Output is correct
46 Correct 6 ms 348 KB Output is correct
47 Correct 6 ms 384 KB Output is correct
48 Correct 6 ms 332 KB Output is correct
49 Correct 7 ms 332 KB Output is correct
50 Correct 6 ms 332 KB Output is correct
51 Correct 8 ms 332 KB Output is correct
52 Correct 6 ms 332 KB Output is correct
53 Correct 8 ms 332 KB Output is correct
54 Correct 6 ms 304 KB Output is correct
55 Correct 6 ms 332 KB Output is correct
56 Correct 6 ms 332 KB Output is correct
57 Correct 6 ms 332 KB Output is correct
58 Correct 7 ms 332 KB Output is correct
59 Correct 6 ms 340 KB Output is correct
60 Correct 7 ms 332 KB Output is correct
61 Correct 8 ms 332 KB Output is correct
62 Correct 6 ms 332 KB Output is correct
63 Correct 6 ms 332 KB Output is correct
64 Correct 7 ms 332 KB Output is correct
65 Correct 7 ms 332 KB Output is correct
66 Correct 6 ms 316 KB Output is correct
67 Correct 7 ms 332 KB Output is correct
68 Correct 6 ms 332 KB Output is correct
69 Correct 6 ms 332 KB Output is correct
70 Correct 5 ms 332 KB Output is correct
71 Correct 6 ms 332 KB Output is correct
72 Correct 6 ms 332 KB Output is correct
73 Correct 6 ms 460 KB Output is correct
74 Correct 6 ms 332 KB Output is correct
75 Correct 6 ms 316 KB Output is correct
76 Correct 6 ms 332 KB Output is correct
77 Correct 6 ms 316 KB Output is correct
78 Correct 6 ms 332 KB Output is correct
79 Correct 6 ms 332 KB Output is correct
80 Correct 5 ms 332 KB Output is correct
81 Correct 6 ms 332 KB Output is correct
82 Correct 6 ms 332 KB Output is correct
83 Correct 8 ms 332 KB Output is correct
84 Correct 7 ms 332 KB Output is correct
85 Correct 7 ms 332 KB Output is correct
86 Correct 6 ms 332 KB Output is correct
87 Correct 7 ms 332 KB Output is correct
88 Correct 6 ms 332 KB Output is correct
89 Correct 6 ms 340 KB Output is correct
90 Correct 6 ms 316 KB Output is correct
91 Correct 6 ms 332 KB Output is correct
92 Correct 6 ms 332 KB Output is correct
93 Correct 7 ms 332 KB Output is correct
94 Correct 5 ms 332 KB Output is correct
95 Correct 7 ms 340 KB Output is correct
96 Correct 6 ms 332 KB Output is correct
97 Correct 6 ms 316 KB Output is correct
98 Correct 6 ms 332 KB Output is correct
99 Correct 6 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 332 KB Output is correct
2 Correct 42 ms 476 KB Output is correct
3 Correct 52 ms 580 KB Output is correct
4 Incorrect 55 ms 468 KB 1st lines differ - on the 1st token, expected: '1906', found: '3797'
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 364 KB 1st lines differ - on the 1st token, expected: '154', found: '686'
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB 1st lines differ - on the 1st token, expected: '8', found: '30'
2 Halted 0 ms 0 KB -