oj.uz

답안 #254465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254465 2020-07-30T04:40:41 Z babo Detecting Molecules (IOI16_molecules) C++14
0 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>
#define L long long
using namespace std;

L n;
L s,e;

struct S{
	L idx, weight;
};

bool operator<(S a,S b){
	return a.weight<b.weight;
}

vector<int> find_subset(int l,int u, vector<int> w){
	n=(L)w.size();
	vector<int> ans(n);
	L i;
	s=l,e=u;
	L W=0;
	vector<S>v;
	for(i=0;i<n;i++)
		v.push_back((S){i,w[i]});
	sort(v.begin(),v.end());
	for(i=n-1;i>=0;i--)
	{
		W+=v[i].weight;
		ans[v[i].idx]=1;
		if(W>e)
		{
			L j=n-1;
			while(i>0)
			{
				W+=v[i-1].weight;
				ans[v[i-1].idx]=1;
				W-=v[j].weight;
				ans[v[j].idx]=0;
				i--;j--;
				if(s<=W&&W<=e) return ans;
			}
			break;
		}
		else if(W>=s)
			return ans;
	}
	vector<int> ans2(n,0);
	return ans2;
}

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 Incorrect 1 ms 256 KB item #0 is taken twice
2 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 -