제출 #341408

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

molecules

#include <bits/stdc++.h>
#define pb push_back
#define vii vector<int>
#define task "LAZY"
#define pll pair<ll, ll>
#define pii pair< pll, ll >
#define fi first
#define se second

using namespace std;
using ll = int;
using ull = unsigned long long;
const int N = 1e6+5;
const ll mod = 1e9+7;
const ll base1 = 1313;
const ll base2 = 3113;
ll m, n, k, t, T, ans, u, v, tong;
pll a[N], b[N];
vector<ll> kq;
vector<int> find_subset(int l, int u, vector<int> w)
{
    n = w.size();
    for(int i = 1; i <= n; i ++)
    {
        a[i].fi = w[i-1];
        a[i].se = i;
    }
    sort(a+1, a+1+n);
    int j = 1;
    for(int i = 1; i <= n; i ++)
    {
        tong += a[i].fi;
        if(tong > u)tong -= a[j].fi, ++j;   
        if(tong >= l)
        {
            for(int id = j; id <= i; id ++)kq.pb(a[id].se);
            return kq;
        }
    }
    return kq;
}

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