Submission #811047

#TimeUsernameProblemLanguageResultExecution timeMemory
811047manhlinh1501Detecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms212 KiB
/// @author : Hoang Manh Linh
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define pii pair<int, int>
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define lb(a, x) lower_bound(all(a), x) - a.begin()

int n;
int l, r;

vector<int> find_subset(int l, int r, vector<int> a) {
    int n = a.size();
    vector<i64> sum(n);
    vector<pii> res;

    for(int i = 0; i < n; i++)
        res.eb(a[i], i);

    sum.front() = res.front().first;

    for(int i = 1; i < n; i++)
        sum[i] = sum[i - 1] + res[i].first;

    vector<int> ans;

    for(int i = 0; i < n; i++) {
        int pos = lb(sum, sum[i] - res[i].first + l);

        if(pos >= n)
            continue;

        if(sum[pos] - sum[i] + res[i].first <= r) {
            for(int j = i; j <= pos; j++)
                ans.eb(res[j].second + 1);

            break;
        }
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...