제출 #786958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786958		hariaakas646	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	212 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long int li;
typedef unsigned long int uli;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;

vi find_subset(int l, int u, vi w)
{
    int n = w.size();
    sort(all(w));
    vi out = {};
    int v = w[0];
    if (v > u)
    {
        return out;
    }
    out.pb(w[0]);
    int id = 1;
    while (id < n && v < l)
    {
        v += w[id];
        out.pb(w[id]);
        id++;
    }
    if (v < l)
    {
        out = {};
        return out;
    }
    else
    {
        return out;
    }
}

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