Submission #824107

#TimeUsernameProblemLanguageResultExecution timeMemory
824107SoulKnightDetecting Molecules (IOI16_molecules)C++17
100 / 100
49 ms8108 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ln '\n'

const int N = 2e5 + 5;
ll pfx[N], idx[N], n;
vector<ll> vec;
vector<int> ans;

vector<int> find_subset(int l, int u, std::vector<int> w) {
    n = w.size(); vec.resize(n+1);
    iota(idx, idx+n, 0);
    sort(idx, idx+n, [&](int x, int y){return w[x] < w[y];});
    for (int i = 1; i <= n; i++) vec[i] = w[idx[i-1]];

    for (int i = 1; i <= n; i++) pfx[i] = pfx[i-1] + vec[i];

    for (int i = 1; i <= n; i++){
        int j = upper_bound(pfx, pfx+n+1, pfx[i] - l) - pfx - 1;
        if (j == n+1) continue;
        if (l <= pfx[i] - pfx[j] && pfx[i] - pfx[j] <= u){
            for (j++; j <= i; j++) ans.push_back(idx[j-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...