oj.uz

답안 #243704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243704 2020-07-01T15:31:49 Z Kubin Detecting Molecules (IOI16_molecules) C++17
19 / 100
 5 ms 436 KB 
#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w)
{
    const size_t n = w.size();

    auto v = w;
    sort(w.begin(), w.end());
    int a = w[0];
    for(auto& x : w)
        x -= a;

    vector<int64_t> s(n + 1), z(n + 1);
    for(size_t i = 0; i < n; i++)
        s[i+1] = s[i] + w[i], z[i+1] = z[i] + w[n-i-1];

    vector<int> result;
    for(size_t k = 1; result.empty() and k <= n; k++)
    {
        for(size_t i = 0; i <= k; i++)
        {
            auto c = (int64_t)k * a + s[i] + z[k-i];
            if(l <= c and c <= u)
            {
                result.reserve(k);
                copy(w.begin(), w.begin() + i, back_inserter(result));
                copy(w.end() - (k-i), w.end(), back_inserter(result));
                break;
            }
        }
    }

    for(auto& x : result)
        x += a;

    vector<int> ind;
    for(size_t i = 0, j = 0; i < n and j < result.size(); i++)
        if(v[i] == result[j])
            ind.push_back(i), j++;

    return ind;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 384 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 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 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 436 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 384 KB OK (n = 3, answer = NO)
14 Correct 4 ms 128 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 128 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 384 KB OK (n = 100, answer = YES)
20 Correct 4 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 384 KB OK (n = 100, answer = NO)
33 Correct 4 ms 256 KB OK (n = 100, answer = YES)
34 Correct 5 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 256 KB OK (n = 100, answer = YES)
36 Correct 4 ms 256 KB OK (n = 100, answer = YES)
37 Correct 4 ms 256 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 5 ms 256 KB OK (n = 100, answer = YES)
41 Correct 5 ms 256 KB OK (n = 100, answer = YES)
42 Incorrect 5 ms 256 KB sum of weights should be in [100..110] but it is 16
43 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 384 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 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 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 436 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 384 KB OK (n = 3, answer = NO)
14 Correct 4 ms 128 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 128 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 384 KB OK (n = 100, answer = YES)
20 Correct 4 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 384 KB OK (n = 100, answer = NO)
33 Correct 4 ms 256 KB OK (n = 100, answer = YES)
34 Correct 5 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 256 KB OK (n = 100, answer = YES)
36 Correct 4 ms 256 KB OK (n = 100, answer = YES)
37 Correct 4 ms 256 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 5 ms 256 KB OK (n = 100, answer = YES)
41 Correct 5 ms 256 KB OK (n = 100, answer = YES)
42 Incorrect 5 ms 256 KB sum of weights should be in [100..110] but it is 16
43 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 384 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 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 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 436 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 384 KB OK (n = 3, answer = NO)
14 Correct 4 ms 128 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 128 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 384 KB OK (n = 100, answer = YES)
20 Correct 4 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 384 KB OK (n = 100, answer = NO)
33 Correct 4 ms 256 KB OK (n = 100, answer = YES)
34 Correct 5 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 256 KB OK (n = 100, answer = YES)
36 Correct 4 ms 256 KB OK (n = 100, answer = YES)
37 Correct 4 ms 256 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 5 ms 256 KB OK (n = 100, answer = YES)
41 Correct 5 ms 256 KB OK (n = 100, answer = YES)
42 Incorrect 5 ms 256 KB sum of weights should be in [100..110] but it is 16
43 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 384 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 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 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 5 ms 436 KB OK (n = 3, answer = YES)
11 Correct 4 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 384 KB OK (n = 3, answer = NO)
14 Correct 4 ms 128 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 5 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 128 KB OK (n = 3, answer = NO)
18 Correct 5 ms 384 KB OK (n = 100, answer = NO)
19 Correct 4 ms 384 KB OK (n = 100, answer = YES)
20 Correct 4 ms 256 KB OK (n = 12, answer = YES)
21 Correct 5 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 256 KB OK (n = 12, answer = NO)
23 Correct 5 ms 384 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 256 KB OK (n = 12, answer = YES)
28 Correct 5 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 256 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 256 KB OK (n = 100, answer = YES)
32 Correct 5 ms 384 KB OK (n = 100, answer = NO)
33 Correct 4 ms 256 KB OK (n = 100, answer = YES)
34 Correct 5 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 256 KB OK (n = 100, answer = YES)
36 Correct 4 ms 256 KB OK (n = 100, answer = YES)
37 Correct 4 ms 256 KB OK (n = 28, answer = YES)
38 Correct 5 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 384 KB OK (n = 90, answer = YES)
40 Correct 5 ms 256 KB OK (n = 100, answer = YES)
41 Correct 5 ms 256 KB OK (n = 100, answer = YES)
42 Incorrect 5 ms 256 KB sum of weights should be in [100..110] but it is 16
43 Halted 0 ms 0 KB -