oj.uz

답안 #336792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336792 2020-12-16T20:15:39 Z northlake Jelly Flavours (IOI20_jelly) C++17
0 / 100
 1 ms 384 KB 
#include<bits/stdc++.h>
#include<jelly.h>

using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
    int n = a.size(); int counter = 0; int answer = 0;
    if (x > y) swap(x, y);
    sort(a.begin(), a.end());

    int sum_x = 0;
    while ((sum_x + a[counter]) <= x && counter < n) {
        sum_x += a[counter];
        answer += 1; counter += 1;
    }
    int sum_y = 0;
    while ((sum_y + a[counter]) <= y && counter < n) {
        sum_y += a[counter];
        answer += 1; counter += 1;
    }
    
    return answer;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 32.0

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