oj.uz

답안 #61055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61055 2018-07-25T07:07:01 Z Tenuun Detecting Molecules (IOI16_molecules) C++17
0 / 100
 3 ms 644 KB 
#include "molecules.h"
#include<bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<int>res;
	vector<pair<int, int> >v;
	for(int i=0; i<w.size(); i++){
		v.push_back({w[i], i});
	}
	sort(v.rbegin(), v.rend());
	long long curr=0;
	int r=0;
	for(int i=0; i<v.size(); i++){
		r=max(r, i);
		if(i==r){
			curr=v[i].first;
			res.clear();
			res.push_back(v[i].second);
		}
		while(r+1<v.size() && curr<=l){
			curr+=v[r+1].first;
			res.push_back(v[r+1].second);
			r++;
		}
		if(curr>=l && curr<=u) return res;
		curr-=v[i].first;
		swap(*res.begin(), *res.end());
		res.pop_back();
	}
	if(curr>=l && curr<=u) return res;
	else return res={}, res;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<w.size(); i++){
               ~^~~~~~~~~
molecules.cpp:15:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<v.size(); i++){
               ~^~~~~~~~~
molecules.cpp:22:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(r+1<v.size() && curr<=l){
         ~~~^~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 376 KB OK (n = 1, answer = YES)
4 Correct 3 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 588 KB OK (n = 2, answer = YES)
6 Correct 3 ms 588 KB OK (n = 3, answer = YES)
7 Correct 3 ms 588 KB OK (n = 3, answer = YES)
8 Incorrect 2 ms 588 KB item #1 is taken twice
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 644 KB sum of weights should be in [302..304] but it is 305
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 376 KB OK (n = 1, answer = YES)
4 Correct 3 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 588 KB OK (n = 2, answer = YES)
6 Correct 3 ms 588 KB OK (n = 3, answer = YES)
7 Correct 3 ms 588 KB OK (n = 3, answer = YES)
8 Incorrect 2 ms 588 KB item #1 is taken twice
9 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 376 KB OK (n = 1, answer = YES)
4 Correct 3 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 588 KB OK (n = 2, answer = YES)
6 Correct 3 ms 588 KB OK (n = 3, answer = YES)
7 Correct 3 ms 588 KB OK (n = 3, answer = YES)
8 Incorrect 2 ms 588 KB item #1 is taken twice
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 376 KB OK (n = 1, answer = YES)
4 Correct 3 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 588 KB OK (n = 2, answer = YES)
6 Correct 3 ms 588 KB OK (n = 3, answer = YES)
7 Correct 3 ms 588 KB OK (n = 3, answer = YES)
8 Incorrect 2 ms 588 KB item #1 is taken twice
9 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 376 KB OK (n = 1, answer = YES)
4 Correct 3 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 588 KB OK (n = 2, answer = YES)
6 Correct 3 ms 588 KB OK (n = 3, answer = YES)
7 Correct 3 ms 588 KB OK (n = 3, answer = YES)
8 Incorrect 2 ms 588 KB item #1 is taken twice
9 Halted 0 ms 0 KB -