oj.uz

Submission #108208

# Submission time Handle Problem Language Result Execution time Memory
108208 2019-04-28T05:40:39 Z tictaccat Detecting Molecules (IOI16_molecules) C++14
9 / 100
 3 ms 384 KB 
#include "molecules.h"

#include <bits/stdc++.h>

using namespace std;

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

    int n = w.size();

    vector<int> res;
    int s = 0, k = 0;

    while (s + w[0] <= u && k < n) {
        s += w[0];
        res.push_back(k++);
    }

    if (s >= l) return res;

    return std::vector<int>();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

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