oj.uz

답안 #624221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624221 2022-08-07T13:31:23 Z MatesV13 Jelly Flavours (IOI20_jelly) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

int find_maximum_unique(int x, int y, vector<int, allocator<int> >  a, vector<int, allocator<int> > b){
	
	int maks = 0; int n = sizeof(a)/sizeof(a[0]);
	for (int i=0; i<pow(3, n); i++){
		int tempi = i;
		int tempx = x;
		int tempy = y;
		int br=0;
		
		for (int j=0; j<n; j++){
			if (tempi%3){
				if (tempi%3==1) tempx -= a[j];
				else tempy -= b[j];
				br++;
			} tempi /= 3;
		}
		
		if (tempx >= 0 and tempy >= 0)
			maks = max(maks, br); 
	}
	
	return maks;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 14.0

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

Subtask #6
0 / 32.0

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