Submission #1323517

#TimeUsernameProblemLanguageResultExecution timeMemory
1323517chandan_159Detecting Molecules (IOI16_molecules)C++20
100 / 100
39 ms5212 KiB
#include "molecules.h"
#include <bits/stdc++.h>
// solved by bekagg
#define ll long long
#define ent '\n'
#define pb push_back
#define all(x) x.begin(),x.end()
#define PRaim_bek_abi ios_base::sync_with_stdio(0);cin.tie(0);

using namespace std;

const int N = 2e5+5;
const int MOD = 1e9+7;

ll pref[N];

vector<int> find_subset(int l, int u, vector<int> w){

    vector<pair<int , int> > v;
    vector<int>ans;

    for (int i = 0; i < w.size(); i++){
        v.pb({w[i] , i});
    }

    sort(all(v));

    for (int i = 0; i < w.size(); i++) pref[i + 1] = pref[i] + v[i].first;

    for (int i = 1; i <= w.size(); i++){
        int left = i , r = w.size() , p = -1;
        while(left <= r){
            int m = (left + r) / 2;

            if (pref[m] - pref[i - 1] >= l){
                p = m;
                r = m - 1;
            }
            else left = m + 1;
        }

        if (p != -1 and pref[p] - pref[i - 1] <= u){
            for (int j = i - 1; j < p; j++){
                ans.pb(v[j].second);
            }
            break;
        }
    }

    return ans;

}

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...