oj.uz

답안 #61371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61371 2018-07-25T16:35:25 Z nvmdava Detecting Molecules (IOI16_molecules) C++17
0 / 100
 4 ms 564 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
struct mol{
	int loc, val;
	bool operator<(const mol& rhs) const{
		return val <= rhs.val;
	}
};
vector<mol> v;
vector<int> s;
 
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int i, n = w.size();
	mol tmp;
	for( i = 0; i < n; i++){
		tmp.loc = i;
		tmp.val = w[i];
		v.push_back(tmp);
	}
	
	sort(v.begin(), v.end());
	
	s.push_back(0);
	
	for(i = 0; i < n; i++){
		s.push_back(s[i] + v[i].val);
	}
	
	for( i = 1;i <=n ; i++){
		if(s[i ] > u){
			break;
		}
		if(s[n] - s[ n - i] >= l){
			break;
		}
	}
	if(s[i] > u || i == n + 1){
		return std::vector<int>(0);
	}
	vector<int> ans;
	int j;
	if(n == i){
		for(i = i - 1; i >= 0 ; i--){
			ans.push_back(v[i].loc);
		}
		return ans;
	}
	for( j = 1; n - j - i >=-1 ;j++){
		if(n - j == i -1){
			for(i = i - 1; i >= 0 ; i--){
				ans.push_back(v[i].loc);
			}
			break;
		}
		cout<<s[n - j] - s[n - i -j]<<"\n";
		if(s[n - j] - s[n - i -j] < l){
			ans.push_back(v[n - j].loc);
			l -= v[n - j].val;
			i--;
			if(i == 0){
				break;
			}
		}
	}
	return ans;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB OK (n = 1, answer = NO)
2 Correct 4 ms 484 KB OK (n = 1, answer = NO)
3 Correct 2 ms 564 KB OK (n = 1, answer = YES)
4 Correct 2 ms 564 KB OK (n = 2, answer = YES)
5 Incorrect 2 ms 564 KB Secret is incorrect!
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 564 KB Secret is incorrect!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB OK (n = 1, answer = NO)
2 Correct 4 ms 484 KB OK (n = 1, answer = NO)
3 Correct 2 ms 564 KB OK (n = 1, answer = YES)
4 Correct 2 ms 564 KB OK (n = 2, answer = YES)
5 Incorrect 2 ms 564 KB Secret is incorrect!
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB OK (n = 1, answer = NO)
2 Correct 4 ms 484 KB OK (n = 1, answer = NO)
3 Correct 2 ms 564 KB OK (n = 1, answer = YES)
4 Correct 2 ms 564 KB OK (n = 2, answer = YES)
5 Incorrect 2 ms 564 KB Secret is incorrect!
6 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB OK (n = 1, answer = NO)
2 Correct 4 ms 484 KB OK (n = 1, answer = NO)
3 Correct 2 ms 564 KB OK (n = 1, answer = YES)
4 Correct 2 ms 564 KB OK (n = 2, answer = YES)
5 Incorrect 2 ms 564 KB Secret is incorrect!
6 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB OK (n = 1, answer = NO)
2 Correct 4 ms 484 KB OK (n = 1, answer = NO)
3 Correct 2 ms 564 KB OK (n = 1, answer = YES)
4 Correct 2 ms 564 KB OK (n = 2, answer = YES)
5 Incorrect 2 ms 564 KB Secret is incorrect!
6 Halted 0 ms 0 KB -