제출 #204353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204353		awlintqaa	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	71 ms	7304 KiB

molecules

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "molecules.h"
int n;
pll a[200009];
vi solve(int l,int r){
        vi ret;
        for( int i =l ;i<=r;i++)ret.pb(a[i].se);
        return ret;
}
vi find_subset(int l, int u,vi w) {
        ll n = w.size();
        for(int i=0;i<n;i++)a[i]={w[i],i};
        sort(a,a+n);
        ll R = 0 , sum = 0;
        for(ll L =0 ;L < n ; L++){
                while ( R<n && sum+a[R].fi <= u){
                        sum += a[R].fi;
                        R++;
                }
                if ( sum >= l && sum<=u ){
                        return solve(L,R-1);
                }
                sum-=a[L].fi;
        }
        return std::vector<int>(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