Submission #1020452

#TimeUsernameProblemLanguageResultExecution timeMemory
1020452vjudge1Detecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms600 KiB
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const int maxn = 2e5+12;

ll pref[maxn];
int n;

vector<int> find_subset(int L, int R, vector<int> w){
    n = w.size();
    sort(w.begin(), w.end());
    for(int i=1;i<=n;i++){
        pref[i] = pref[i-1] + w[i-1];
    }
    pref[n+1] = pref[n];
    for(int i=n+1;i>=1;i--){
        int pos = 0;
        for(int l=0, r=i-1;l<=r;){
            int mid = l + r >> 1;
            if(pref[mid] + pref[n] - pref[i-1] >= L){
                pos = mid;
                r = mid-1;
            }
            else l = mid+1;
        }
        if(pref[pos] + pref[n] - pref[i-1] >= L && pref[pos] + pref[n] - pref[i-1] <= R){
            vector<int> ans;
            for(int i=0;i<pos;i++){
                ans.push_back(i);
            }
            for(int j=i;j<=n;j++){
                ans.push_back(j-1);
            }
            return ans;
        }
    }
    return {};
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |             int mid = l + r >> 1;
      |                       ~~^~~
#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...