Submission #1180595

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180595		TudorMa	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	37 ms	4136 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fi first
#define sc second
#define pb push_back

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
template<typename type>
using ordered_set = tree<type, null_type, less<type>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 5, mod = 1e9 + 7, inf = 2e9;
const int dl[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1};
const int ddl[] = {-1, -1, -1, 0, 1, 1, 1, 0}, ddc[] = {-1, 0, 1, 1, 1, 0, -1, -1};

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
int rng(int lo = 1, int hi = INT_MAX) {
    uniform_int_distribution<int> rnd(lo, hi);
    return rnd(gen);
}

struct mint {
    int val;
    mint(int32_t x = 0) {
        val = x % mod;
    }
    mint(long long x) {
        val = x % mod;
    }
    mint operator+(mint x) {
        return val + x.val;
    }
    mint operator-(mint x) {
        return val - x.val + mod;
    }
    mint operator*(mint x) {
        return 1LL * val * x.val;
    }
    void operator+=(mint x) {
        val = (*this + x).val;
    }
    void operator-=(mint x) {
        val = (*this - x).val;
    }
    void operator*=(mint x) {
        val = (*this * x).val;
    }
    friend auto operator>>(istream& in, mint &x) -> istream& {
        in >> x.val;
        x.val %= mod;
        return in;
    }
    friend auto operator<<(ostream& out, mint const &x) -> ostream& {
        out << x.val;
        return out;
    }
};

vector<int> find_subset(int l, int u, vector<int> w) {
    ll s = 0;
    vector<pair<int, int>> dece;
    for(int i=0; i<w.size(); i++)
        dece.pb({w[i], i});
    sort(dece.begin(), dece.end());
    int pl = 0, pr = -1;
    while(pl < dece.size()) {
        while(pr < int(dece.size()) - 1 && s < l)
            s += dece[++pr].fi;
        if(s >= l && s <= u) {
            vector<int> ans;
            for(int i=pl; i<=pr; i++)
                ans.pb(dece[i].sc);
            sort(ans.begin(), ans.end());
            return ans;
        }

        s -= dece[pl++].fi;
    }

    vector<int> ans;
    return ans;
}

/*int32_t main()
{
    cin.tie(nullptr)->sync_with_stdio(0);
    
    vector<int> ohio;
    ohio.pb(15);
    ohio.pb(17);
    ohio.pb(16);
    ohio.pb(18);
    vector<int> skibidi = find_subset(10, 15, ohio);
    for(auto x : skibidi)
        cout << x << ' ';
    return 0;
}*/

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: 31 / 31