제출 #683992

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683992		thegamercoder19	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	212 KiB

molecules

#include "molecules.h"
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    ll n = w.size();
    V<pair<ll, ll>> wp;
    FOR(ll, i, 0, n, 1)wp.push_back({ w[i],i });
    sort(all(wp));
    set<int> ans;
    ll i = 0, j = 0, s = 0;
    WH(j < n)
    {
        if (s < l)s += wp[j].first, ans.insert(wp[j].second), j++;
        if (s > u)s -= wp[i].first, ans.erase(wp[i].first), i++;
        if (s >= l && s <= u) break;
    }
    if (s >= l && s <= u) return V<int>(ans.begin(), ans.end());
    else return {};
    
           
}

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