Submission #424168

#	Time	Username	Problem	Language	Result	Execution time	Memory
424168		Blistering_Barnacles	Detecting Molecules (IOI16_molecules)	C++11	0 / 100	10 ms	13352 KiB

molecules

#include "molecules.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[105][100005] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
pll a[555555] ;
vector<int> find_subset(int l, int u, std::vector<int> w) {
    n = sz(w) ;
    vi res  = {0};
    for(ll i = 1 ; i <= n ; i++){
        a[i] = {w[i - 1] , i} ;
    }
    sort(a + 1 , a + n + 1) ;
    deque < pll > se ;
    ll sum = 0 ;
    for(ll i = 1 ; i <= n ; i++){
        if(l <= sum && sum <= u){
            B ;
        }
        else if(sum + a[i].F <= u){
            se.pb({a[i].F , a[i].S}) ;
            sum += a[i].F ;
        }
        else {
            while(!se.empty() && sum + a[i].F > u){
                pll op = se.front() ;
                se.pop_front() ;
                sum -= op.F ;
            }
            sum += a[i].F ;
            se.pb({a[i].F , a[i].S}) ;
        }
    }
    if(l <= sum && sum <= u){
        res.clear() ;
        while(!se.empty()){
            pll op = se.front() ;
            res.pb(op.S) ;
            se.pop_front() ;
        }
    }
    sort(all(res)) ;
    R res ;
}

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