제출 #995655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
995655		mindiyak	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	36 ms	5720 KiB

molecules

#include "molecules.h"

#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
vector<int> find_subset(int l, int u, vector<int> w) {
    int N = w.size();
    ll sum = 0,start = 0;
    vi ans;
    vpi arr(N);
    FOR(i,0,N)arr[i] = {w[i],i};
    sort(arr.begin(),arr.end());

    FOR(i,0,N){
        sum += arr[i].F;
        while(sum > u){
            sum -= arr[start].F;
            start++;
        }
        if(sum <= u and sum >= l){
            FOR(j,start,i+1)ans.pb(arr[j].S);
            return ans;
        }
    }

    return vi(0);
}

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