oj.uz

답안 #1102135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102135 2024-10-17T14:24:44 Z akzytr Detecting Molecules (IOI16_molecules) C++17
9 / 100
 1 ms 440 KB 
#include "molecules.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

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

	int sum = 0;
	for(int i = 0; i < w.size(); i++) {
		sum += w[i];
		if(sum >= l && sum <= u) {
            for(int j =0; j <= i; j++){
                result.push_back(j);
            }
            break;
		}
	}
	return result;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for(int i = 0; i < w.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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