oj.uz

답안 #418744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418744 2021-06-05T19:42:15 Z Divanny Jelly Flavours (IOI20_jelly) C++14
0 / 100
 1 ms 460 KB 
#include "jelly.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) 
{
	int n = a.size(), ans = 0;
	ans += y / b[0];
	sort(a.begin(), a.end());
	int cont = 0, i = 0;
	while (cont + a[i] <= x && i < n)
	{
		cont += a[i];
		i++;
	}
	ans += i;
	return ans;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 32.0

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