oj.uz

답안 #1115218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115218 2024-11-20T08:49:52 Z Zflop Detecting Molecules (IOI16_molecules) C++14
31 / 100
 2 ms 592 KB 
#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 5;

int dp[NMAX],from[NMAX];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    dp[0] = 1;
    for (int i = 0; i < u;++i) from[i] = -1;
    for (int i = 0; i < w.size();++i) {
        for (int j = u + 1; j >= 0;--j)
            if (dp[j] && !dp[j + w[i]]) {
                dp[j + w[i]] = 1;
                from[j + w[i]] = i;
            }
    }
    vector<int>v;
    int este = -1;
    for (int i = u; i >= l;--i)
        if (dp[i]) {
            este = i;
            break;
        }
    if (este == -1) return {};
    v.push_back(from[este]);
    int val = este - w[from[este]];
    while (val) {
        v.push_back(from[val]);
        val = val - w[from[val]];
    }
    return v;
}

Compilation message

molecules.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     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 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 504 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 504 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

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

Subtask #3
12.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 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 504 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 504 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 336 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 2 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)

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 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 504 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 504 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 336 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 2 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Runtime error 2 ms 592 KB Execution killed with signal 11
56 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 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 504 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 504 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 336 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 2 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Runtime error 2 ms 592 KB Execution killed with signal 11
56 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 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 336 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 504 KB OK (n = 3, answer = YES)
11 Correct 1 ms 504 KB OK (n = 3, answer = YES)
12 Correct 1 ms 504 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 336 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 336 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 336 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 512 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 2 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Runtime error 2 ms 592 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -