oj.uz

Submission #299355

# Submission time Handle Problem Language Result Execution time Memory
299355 2020-09-14T18:54:43 Z APROHACK Detecting Molecules (IOI16_molecules) C++14
9 / 100
 1 ms 384 KB 
#include "molecules.h"
#include <bits/stdc++.h>
#define PB push_back
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int>respuesta;
	sort(w.begin(), w.end());
	long long sum=0, n=w.size();
	
	for(int i = 0 ; i < n ; i ++){
		sum+=w[i];
		if(sum>=l&&sum<=u){
			for(int j = 0 ; j <= i ; j ++)respuesta.PB(j);
			return respuesta;
		}
		if(sum>u)return respuesta;
	}
    //return std::vector<int>respuesta;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 384 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 1 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 384 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 1 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 384 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 1 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 384 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 1 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 1 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 1 ms 384 KB OK (n = 3, answer = YES)
12 Correct 1 ms 384 KB OK (n = 3, answer = YES)
13 Correct 1 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 1 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Incorrect 0 ms 256 KB Contestant can not find answer, jury can
21 Halted 0 ms 0 KB -