oj.uz

답안 #73137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73137 2018-08-28T00:25:42 Z Kmcode Detecting Molecules (IOI16_molecules) C++14
0 / 100
 3 ms 696 KB 
#include<bits/stdc++.h>
using namespace std;

//#include "molecules.h"

vector<pair<long long int,int> > im;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	sort(w.begin(),w.end());
	im.push_back(make_pair(0,-1));
	for(int i=0;i<w.size();i++){
		im.push_back(make_pair(im.back().first+w[i],i) );
		/*if(l<=im.back()&&im.back()<=u){
			vector<int> ans;
			for(int j=1;j<im.size();j++){
				ans.push_back(im[j].second);
			}
			return ans;
		}*/
		if(im.back().first<u)continue;
		long long int id=lower_bound(im.begin(),im.end(),make_pair(im.back().first-u,-1))-im.begin();
		if(l<=im.back().first-im[id].first&&im.back().first-im[id].first<=u){
			vector<int> ans;
			for(int j=id+1;j<im.size();j++){
				ans.push_back(im[j].second);
			}
			return ans;
		}
	}
    return std::vector<int>();
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<w.size();i++){
              ~^~~~~~~~~
molecules.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j=id+1;j<im.size();j++){
                   ~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 440 KB OK (n = 1, answer = YES)
4 Correct 3 ms 488 KB OK (n = 2, answer = YES)
5 Correct 2 ms 696 KB OK (n = 2, answer = YES)
6 Correct 2 ms 696 KB OK (n = 3, answer = YES)
7 Correct 2 ms 696 KB OK (n = 3, answer = YES)
8 Correct 2 ms 696 KB OK (n = 3, answer = YES)
9 Correct 2 ms 696 KB OK (n = 3, answer = YES)
10 Correct 2 ms 696 KB OK (n = 3, answer = YES)
11 Correct 2 ms 696 KB OK (n = 3, answer = YES)
12 Correct 2 ms 696 KB OK (n = 3, answer = YES)
13 Correct 2 ms 696 KB OK (n = 3, answer = NO)
14 Correct 2 ms 696 KB OK (n = 3, answer = YES)
15 Incorrect 2 ms 696 KB Contestant can not find answer, jury can
16 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 696 KB OK (n = 12, answer = YES)
2 Correct 2 ms 696 KB OK (n = 12, answer = YES)
3 Correct 2 ms 696 KB OK (n = 12, answer = NO)
4 Correct 3 ms 696 KB OK (n = 12, answer = NO)
5 Correct 3 ms 696 KB OK (n = 12, answer = YES)
6 Correct 3 ms 696 KB OK (n = 12, answer = YES)
7 Correct 2 ms 696 KB OK (n = 12, answer = YES)
8 Correct 2 ms 696 KB OK (n = 12, answer = YES)
9 Incorrect 3 ms 696 KB Contestant can not find answer, jury can
10 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 440 KB OK (n = 1, answer = YES)
4 Correct 3 ms 488 KB OK (n = 2, answer = YES)
5 Correct 2 ms 696 KB OK (n = 2, answer = YES)
6 Correct 2 ms 696 KB OK (n = 3, answer = YES)
7 Correct 2 ms 696 KB OK (n = 3, answer = YES)
8 Correct 2 ms 696 KB OK (n = 3, answer = YES)
9 Correct 2 ms 696 KB OK (n = 3, answer = YES)
10 Correct 2 ms 696 KB OK (n = 3, answer = YES)
11 Correct 2 ms 696 KB OK (n = 3, answer = YES)
12 Correct 2 ms 696 KB OK (n = 3, answer = YES)
13 Correct 2 ms 696 KB OK (n = 3, answer = NO)
14 Correct 2 ms 696 KB OK (n = 3, answer = YES)
15 Incorrect 2 ms 696 KB Contestant can not find answer, jury can
16 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 440 KB OK (n = 1, answer = YES)
4 Correct 3 ms 488 KB OK (n = 2, answer = YES)
5 Correct 2 ms 696 KB OK (n = 2, answer = YES)
6 Correct 2 ms 696 KB OK (n = 3, answer = YES)
7 Correct 2 ms 696 KB OK (n = 3, answer = YES)
8 Correct 2 ms 696 KB OK (n = 3, answer = YES)
9 Correct 2 ms 696 KB OK (n = 3, answer = YES)
10 Correct 2 ms 696 KB OK (n = 3, answer = YES)
11 Correct 2 ms 696 KB OK (n = 3, answer = YES)
12 Correct 2 ms 696 KB OK (n = 3, answer = YES)
13 Correct 2 ms 696 KB OK (n = 3, answer = NO)
14 Correct 2 ms 696 KB OK (n = 3, answer = YES)
15 Incorrect 2 ms 696 KB Contestant can not find answer, jury can
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 440 KB OK (n = 1, answer = YES)
4 Correct 3 ms 488 KB OK (n = 2, answer = YES)
5 Correct 2 ms 696 KB OK (n = 2, answer = YES)
6 Correct 2 ms 696 KB OK (n = 3, answer = YES)
7 Correct 2 ms 696 KB OK (n = 3, answer = YES)
8 Correct 2 ms 696 KB OK (n = 3, answer = YES)
9 Correct 2 ms 696 KB OK (n = 3, answer = YES)
10 Correct 2 ms 696 KB OK (n = 3, answer = YES)
11 Correct 2 ms 696 KB OK (n = 3, answer = YES)
12 Correct 2 ms 696 KB OK (n = 3, answer = YES)
13 Correct 2 ms 696 KB OK (n = 3, answer = NO)
14 Correct 2 ms 696 KB OK (n = 3, answer = YES)
15 Incorrect 2 ms 696 KB Contestant can not find answer, jury can
16 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 3 ms 376 KB OK (n = 1, answer = NO)
3 Correct 3 ms 440 KB OK (n = 1, answer = YES)
4 Correct 3 ms 488 KB OK (n = 2, answer = YES)
5 Correct 2 ms 696 KB OK (n = 2, answer = YES)
6 Correct 2 ms 696 KB OK (n = 3, answer = YES)
7 Correct 2 ms 696 KB OK (n = 3, answer = YES)
8 Correct 2 ms 696 KB OK (n = 3, answer = YES)
9 Correct 2 ms 696 KB OK (n = 3, answer = YES)
10 Correct 2 ms 696 KB OK (n = 3, answer = YES)
11 Correct 2 ms 696 KB OK (n = 3, answer = YES)
12 Correct 2 ms 696 KB OK (n = 3, answer = YES)
13 Correct 2 ms 696 KB OK (n = 3, answer = NO)
14 Correct 2 ms 696 KB OK (n = 3, answer = YES)
15 Incorrect 2 ms 696 KB Contestant can not find answer, jury can
16 Halted 0 ms 0 KB -