oj.uz

답안 #233847

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233847 2020-05-21T22:00:44 Z jam_xd_ Detecting Molecules (IOI16_molecules) C++17
9 / 100
 5 ms 384 KB 
#include "molecules.h"
#include "bits/stdc++.h"

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {

int gg = w[0], funcionaaa = w.size(), sum = 0;
bool afirmo;

vector<int>covid;
vector<pair<int,int> >nada(funcionaaa);

for (int i=0;i<funcionaaa;i++){
        nada[i].first = w[i];
        nada[i].second = i;
    }
   //sort(nada.begin(), nada.end());  //no sirve si todos son iguales :v



for(int i=0;i<funcionaaa;i++){
	if(sum + nada[i].first <= u){
		sum = sum + nada[i].first;
		covid.push_back(nada[i].second);
	}
	if(sum >= l){
		return covid;
	}
}
covid.clear();
return covid;
}
//:v  ??
//wEy Ya :"v aiuda xd   SOLO QUIERO 9 PUNTOS >:V

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:5: warning: unused variable 'gg' [-Wunused-variable]
 int gg = w[0], funcionaaa = w.size(), sum = 0;
     ^~
molecules.cpp:9:6: warning: unused variable 'afirmo' [-Wunused-variable]
 bool afirmo;
      ^~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 5 ms 384 KB OK (n = 1, answer = NO)
3 Correct 4 ms 384 KB OK (n = 1, answer = YES)
4 Correct 5 ms 384 KB OK (n = 2, answer = YES)
5 Correct 5 ms 384 KB OK (n = 2, answer = YES)
6 Correct 4 ms 256 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 5 ms 384 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 5 ms 256 KB OK (n = 3, answer = YES)
13 Correct 4 ms 256 KB OK (n = 3, answer = NO)
14 Correct 4 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 4 ms 256 KB OK (n = 100, answer = NO)
19 Correct 4 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Contestant can not find answer, jury can
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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