oj.uz

답안 #252425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252425 2020-07-25T14:37:07 Z yuma220284 Detecting Molecules (IOI16_molecules) C++14
0 / 100
 0 ms 256 KB 
#include "molecules.h"
#include <algorithm>
using namespace std;

std::vector<int> find_subset(int L, int U, std::vector<int> W) {
	int N = W.size();
	vector<pair<long long, int> > V(N);
	for (int i = 0; i < N; i++) V[i] = { W[i], i };
	sort(V.begin(), V.end());
	vector<long long> Left(N + 1), Right(N + 1);
	Left[0] = 0;
	for (int i = 0; i < N; i++) Left[i + 1] = Left[i] + V[i].first;
	Right[N] = 0;
	for (int i = N - 1; i >= 0; i--) Right[i] = Right[i + 1] + V[i].first;
	reverse(Right.begin(), Right.end());
	for (int i = 0; i <= N; i++) {
		long long X = L - Left[i];
		int Y = lower_bound(Right.begin(), Right.end(), X) - Right.begin();
		if (i + Y > N) continue;
		if (Left[i] + Right[Y] <= U) {
			vector<int> ANS;
			for (int j = 0; j < i; j++) ANS.push_back(V[j].second);
			for (int j = 0; j < Y; j++) ANS.push_back(V[N - 1 - j].second);
			sort(ANS.begin(), ANS.end());
			return ANS;
		}
	}
	return { 0 };
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 0 ms 256 KB OK (n = 12, answer = YES)
3 Incorrect 0 ms 256 KB sum of weights should be in [307..317] but it is 50
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 256 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -