oj.uz

답안 #233643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233643 2020-05-21T08:51:34 Z triple_fault Detecting Molecules (IOI16_molecules) C++14
0 / 100
 5 ms 384 KB 
#include "molecules.h"

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); ll vals[n];
    for (ll i = 0; i < n; ++i) vals[i] = (ll)w[i];
    ll L = (ll)l, R = (ll)u;

    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 i = fst; i <= lst; ++i) ret.push_back((int)i);
            return ret;
        }
    }
    return vector<int>(0);
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 4 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB sum of weights should be in [302..304] but it is 51
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 4 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 4 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 4 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 5 ms 256 KB OK (n = 1, answer = YES)
4 Incorrect 4 ms 256 KB sum of weights should be in [100..100] but it is 50
5 Halted 0 ms 0 KB -