oj.uz

Submission #233646

# Submission time Handle Problem Language Result Execution time Memory
233646 2020-05-21T09:14:27 Z triple_fault Detecting Molecules (IOI16_molecules) C++14
9 / 100
 5 ms 384 KB 
#include "molecules.h"
#include <algorithm>

using namespace std;

#define ll long long

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    ll n = (ll)w.size();
    vector<ll> ps(n); vector<ll> vals(n);
    for (ll i = 0; i < n; ++i) vals[i] = (ll)w[i];
    ll L = (ll)l, R = (ll)u;
    sort(vals.begin(), vals.end());

    ps[0] = vals[0];
    for (ll i = 1; i < n; ++i) ps[i] = ps[i - 1] + vals[i];

    for (ll i = 0; i < n; ++i) {
        ll xprev = 0;
        if (i) xprev = ps[i - 1];

        ll xmin = xprev + L, xmax = xprev + R;

        ll lm = n, rm = n;
        ll left = i, right = n - 1;
        while (left <= right) {
            ll mid = (left + right) / 2;
            if (ps[mid] >= xmin) {
                lm = mid;
                right = mid - 1;
            } else left = mid + 1;
        }

        left = i, right = n - 1;
        while (left <= right) {
            ll mid = (left + right) / 2;
            if (ps[mid] >= (xmax + 1)) {
                rm = mid;
                right = mid - 1;
            } else left = mid + 1;
        }

        if (lm < n && (rm - lm) > 0) {
            ll fst = lm, lst = rm - 1;
            vector<int> ret;
            for (ll j = i; j <= fst; ++j) ret.push_back((int)j);
            return ret;
        }
    }
    return vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:44:26: warning: unused variable 'lst' [-Wunused-variable]
             ll fst = lm, lst = rm - 1;
                          ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 384 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 384 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 384 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB OK (n = 12, answer = YES)
2 Correct 4 ms 256 KB OK (n = 12, answer = YES)
3 Correct 5 ms 256 KB OK (n = 12, answer = NO)
4 Correct 4 ms 256 KB OK (n = 12, answer = NO)
5 Correct 4 ms 384 KB OK (n = 12, answer = YES)
6 Correct 4 ms 256 KB OK (n = 12, answer = YES)
7 Correct 4 ms 256 KB OK (n = 12, answer = YES)
8 Correct 4 ms 256 KB OK (n = 12, answer = YES)
9 Correct 4 ms 256 KB OK (n = 6, answer = YES)
10 Correct 4 ms 384 KB OK (n = 12, answer = YES)
11 Correct 5 ms 256 KB OK (n = 100, answer = NO)
12 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 73
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 384 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 384 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 384 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 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 4 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 384 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 4 ms 256 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 384 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 384 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 384 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 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 4 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 384 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 4 ms 256 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 384 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 384 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 384 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 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 4 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 384 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 4 ms 256 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 384 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 256 KB OK (n = 3, answer = YES)
7 Correct 5 ms 256 KB OK (n = 3, answer = YES)
8 Correct 4 ms 384 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 256 KB OK (n = 3, answer = YES)
12 Correct 4 ms 384 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 384 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 Correct 5 ms 384 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 5 ms 256 KB OK (n = 12, answer = NO)
23 Correct 4 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 384 KB OK (n = 12, answer = YES)
25 Correct 4 ms 256 KB OK (n = 12, answer = YES)
26 Correct 4 ms 256 KB OK (n = 12, answer = YES)
27 Correct 4 ms 256 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Incorrect 4 ms 256 KB sum of weights should be in [50..51] but it is 73
32 Halted 0 ms 0 KB -