oj.uz

답안 #112319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
112319 2019-05-18T18:19:47 Z ioilolcom Detecting Molecules (IOI16_molecules) C++14
0 / 100
 2 ms 384 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long int

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<pair<int,int> > ww;
	for(int i=0; i<(int)w.size(); i++) {
		ww.push_back({w[i],i});
	}
	sort(ww.begin(),ww.end());
	vector<int> ans;
	int a=0;
	int r=0;
	int n=(int)w.size();
	ll sum=0;
	for(int i=0; i<n; i++) {
		if(sum+ww[i].x<=l) {sum+=ww[i].x; r=i;}
		else{
			break;
		}
	}
	while(r<n) {
		if(sum>=l&&sum<=u) {
			break;
		}
		sum+=ww[++r].x;
		sum-=ww[a++].x;
	}

	for(int i=a; i<=r; i++) {
		ans.push_back(ww[i].y);
	}
	if(ans.size()) return ans;
	return std::vector<int>(0);
}

Subtask #1
0 / 9.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 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 2 ms 384 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 2 ms 384 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 2 ms 384 KB sum of weights should be in [10..12] but it is 9
2 Halted 0 ms 0 KB -