Submission #1172523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172523		h1440	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	39 ms	3400 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fore(i,a,b) for(lli i = (a), abcdxd = (b); i < abcdxd; i++)
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ENDL '\n'
#define sz(s) lli((s).size())
#define pb push_back
using namespace std;
typedef int lli;
// typedef long long LLI;
typedef pair<lli, lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
typedef long double ld;
#define deb(x) cout << #x << ": " << x << endl;
#define BIGLLI __int128

std::vector<int> find_subset(int l, int r, std::vector<int> w) {
    lli n = sz(w);
    vii v(n+1, ii{0, -1}); fore(i,0,n){
        v[i].f = w[i];
        v[i].s = i;
    }
    sort(all(v)); fore(i,1,n+1) v[i].f += v[i-1].f;
    fore(k,1,n+1){
        lli pos = k;
        for (lli pot = n; pot > 0; pot>>=1)
            while ((pos + pot) <= n and (v[pos + pot].f - v[k-1].f) <= r) pos+=pot;
        if (l <= (v[pos].f - v[k-1].f) and (v[pos].f - v[k-1].f) <= r){
            vi ans;
            fore(i,k,pos+1) ans.pb(v[i].s);
            return ans;
        }
    }
    return {};
}

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
      |         ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 0 / 31