답안 #406443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406443	2021-05-17T15:25:50 Z	victoriad	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	2 ms	332 KB

jelly

#include "jelly.h"
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();
		vector<pair<int,int> >pa(n);
		vector<pair<int,int> >pb(n);
		for(int i=0;i<n;i++){
			pa[i]=make_pair(a[i],i);
			pb[i]=make_pair(b[i],i);
		}
		sort(pb.begin(),pb.end());
		sort(pa.begin(),pa.end());
		int r=0;
		vector<bool>v(n,false);
		bool f=true,s=true;
		for(int i=0;i<n;i++){
			if(f){
			if(!v[pb[i].second]){
				if(pb[i].first<=y){
					r++;
					y-=pb[i].first;
					v[pb[i].second]=true;
				}
				else{
					f=false;
				}
			}
			}
			if(s){
			if(!v[pa[i].second]){
				if(pa[i].first<=x){
					r++;
					x-=pa[i].first;
					v[pa[i].second]=true;
				}
				else{
					s=false;
				}
			}
			}
			if(!f && !s)break;

		}
		return r;
}

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Incorrect	1 ms	204 KB	1st lines differ - on the 1st token, expected: '5', found: '4'
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Incorrect	1 ms	204 KB	1st lines differ - on the 1st token, expected: '5', found: '4'
9	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

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

Subtask #4

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	332 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	2 ms	332 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	2 ms	320 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	2 ms	328 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	2 ms	308 KB	Output is correct
16	Correct	2 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Incorrect	2 ms	332 KB	1st lines differ - on the 1st token, expected: '1617', found: '1533'
20	Halted	0 ms	0 KB	-

Subtask #5

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	332 KB	Output is correct
2	Correct	2 ms	332 KB	Output is correct
3	Correct	2 ms	332 KB	Output is correct
4	Correct	2 ms	304 KB	Output is correct
5	Incorrect	2 ms	332 KB	1st lines differ - on the 1st token, expected: '1867', found: '1866'
6	Halted	0 ms	0 KB	-

Subtask #6

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Incorrect	1 ms	204 KB	1st lines differ - on the 1st token, expected: '5', found: '4'
9	Halted	0 ms	0 KB	-