Submission #1323479

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323479		chandan_159	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	1 ms	332 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

// ====== Short types ======
#define ll int
#define ld long double
#define str string
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vll vector<ll>
#define vii vector<int>
#define vld vector<ld>
#define vs vector<string>
#define vch vector<char>
#define vpll vector<pll>
#define vpii vector<pii>
#define vvll vector<vll>
#define mll map<ll, ll>
#define msl map<string, ll>
#define mcl map<char, ll>
#define sll set<ll>
#define scl set<char>
#define ssl set<string>
#define mull multiset<ll>
#define mupll multiset<pll>
#define pqmax priority_queue<ll>                       // max heap
#define pqmin priority_queue<ll, vector<ll>, greater<ll>>  // min heap
#define pqmaxpll priority_queue<pll>                     // max heap of pairs
#define pqminpll priority_queue<pll, vector<pll>, greater<pll>> // min heap of pairs

// ====== Queues ======
#define qll queue<ll>
#define qpll queue<pll>

// ====== Common macros ======
#define pb push_back
#define ph push
#define fr front
#define pp pop()
#define tp top
#define ppb pop_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)((x).size())
#define mpr make_pair
#define bk back
#define rtn return
#define ctn continue
#define brk break

// ====== Algorithms ======
#define uniq(x) x.erase(unique(all(x)), x.end())   // works only after sorting
#define sortv(v) sort(all(v))
#define rsortv(v) sort(rall(v))
#define maxv(v) *max_element(all(v))
#define minv(v) *min_element(all(v))
#define sumv(v) accumulate(all(v), 0LL)
#define rev(v) reverse(all(v))
#define lb lower_bound
#define ub upper_bound

// ====== Loops ======
#define forr(i, n) for (ll i = 0; i < (n); i++)
#define rforr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define forab(i, a, b) for (ll i = (a); i <= (b); i++)
#define forba(i, a, b) for (ll i = (a); i >= (b); i--)

// ====== Input Shortcuts ======
#define cn(n) ll n; cin >> n;
#define cna(a, b) ll a, b; cin >> a >> b;
#define cna3(a, b, c) ll a, b, c; cin >> a >> b >> c;
#define cna4(a, b, c, d) ll a, b, c, d; cin >> a >> b >> c >> d;

// ====== String Shortcuts ======
#define cs(s) string s; cin >> s;
#define csa(a, b) string a, b; cin >> a >> b;
#define csa3(a, b, c) string a, b, c; cin >> a >> b >> c;
#define csa4(a, b, c, d) string a, b, c, d; cin >> a >> b >> c >> d;


// ====== IO helpers ======
#define fastio ios::sync_with_stdio(false); cin.tie(nullptr);
#define nl '\n'
#define ct cout
#define YES ct << "YES\n"
#define NO ct << "NO\n"
#define Yes ct << "Yes\n"
#define No ct << "No\n"
#define YN(x) ct << ((x) ? "YES\n" : "NO\n")
#define yn(x) ct << ((x) ? "Yes\n" : "No\n")

// ====== Debugging ======
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debugv(v) cerr << #v << ": "; for (auto _x : v) cerr << _x << " "; cerr << '\n'

// ====== Miscellaneous ======
#define ins insert
#define ers erase
#define cntv count
#define fnd find
#define bg begin
#define ed end


// ====== Input/Output Helpers ======
template<typename T> void cinv(vector<T> &v, ll n) { v.resize(n); forr(i, n) cin >> v[i]; }
template<typename T> void cinvv(vector<vector<T>> &v, ll n, ll m) { v.assign(n, vector<T>(m)); forr(i, n) forr(j, m) cin >> v[i][j]; }
template<typename T> void ctv(const vector<T> &v, char sep = ' ') { for (auto &x : v) ct << x << sep; ct << '\n'; }
template<typename T> void ctvv(const vector<vector<T>> &v) { for (auto &row : v) ctv(row); }



vector<int> find_subset(int u, int v, vector<int> w){
    ll n = sz(w);
    vpll a(n);
    forr(i , n){
        a[i] = {w[i] , i};
    }
    sortv(a);
    vll prf(n+1 , 0);
    forr(i , n){
        prf[i+1] = prf[i] + a[i].ff;
    }
    vll ans;
    forr(i , n){
        ll l = i + 1 , r = n , idx = -1;
        while(l <= r){
            ll mid = (l + r) /2;
            if(prf[mid] - prf[i] >= u){
                idx = mid;
                r = mid - 1;
            }
            else l = mid + 1;
        }
        if(idx != -1 && prf[idx] - prf[i] <= v){
            forab(j , i+1 , idx) ans.pb(a[j].ss);
            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: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31