제출 #286526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286526		infinite_iq	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	55 ms	5612 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 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#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
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef 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;
typedef pair<double,ll>pdi;
const ll inf=2e18;
const ll mod=1e9+7;
const ld Pi=acos(-1) ;
//#include "molecules.h"
int n ;
vpi v ;
vi find_subset ( int mn , int mx , vi w ) {
        n = w .size () ;
        int l = 0 , r = 0 , sum = 0 ;
        for ( int i = 0 ; i < n ; i ++ ) {
                v .pb ( { w [i] , i } ) ;
        }
        sort ( all ( v ) ) ;
        while ( r < n ) {
                sum += v [r] .fi;
                while ( sum > mx ) {
                        sum -= v [l] .fi;
                        l ++ ;
                }
                if ( mn <= sum && sum <= mx ) break ;
                r ++ ;
        }
        vi ans ;
        if ( r == n ) return ans ;
        for ( int i = l ; i <= r ; i ++ ) {
                ans .pb ( v [i] .se ) ;
        }
        return ans ;
}

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