제출 #229259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229259		nickmet2004	Detecting Molecules (IOI16_molecules)	C++11	0 / 100	5 ms	256 KiB

molecules

#include<bits/stdc++.h>
#include<molecules.h>

#define ll long long

using namespace std;

set<pair<ll,ll> >s;
vector<int> find_subset(int l , int u , vector<int> w){
    s.insert({w[0] , 0});
    ll cur = w[0];
    int n = w.size();
    for(int i = 1; i < n; ++i){
        s.insert({w[i] + cur , i});
        cur += w[i];
    }
    int ansi = -1 , ansj = -1;
        for(auto it = s.begin(); it != s.end(); ++it){
        ll pr = it->first;
        int i = it->second;
        auto E = s.lower_bound({pr - l , -1});
        if(E->second < i){
            if(pr - E->first >= l && pr - E->first <= u){
                ansi = E->first; ansj = i;
                break;
            }
        }
        --E;
        if(pr - E->first >= l && pr - E->first <= u){
            ansi = E->second; ansj = i;
            break;
        }
    }ansi++;
    vector<int> result;
    if(ansi == -1 && ansj == -1) return result;
    for(int i = ansi; i <= ansj; ++i){
        result.emplace_back(w[i]);
    }
    return result;
}
/*
set<pair<ll,ll> >s;
int main (){
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll n , l , r;
    cin >> n >> l >> r;
    int cur; cin >> cur;
    s.insert({cur , 0});
    for(int i = 1; i < n; ++i){
        ll x;
        cin >> x;
        s.insert({x + cur , i});
        cur += x;
    }
    int ansi = -1 , ansj = -1;
        for(auto it = s.begin(); it != s.end(); ++it){
        ll pr = it->first;
        int i = it->second;
        auto E = s.lower_bound({pr - l , -1});
        if(E->second < i){
            if(pr - E->first >= l && pr - E->first <= r){
                ansi = E->first; ansj = i;
                break;
            }
        }
        --E;
        if(pr - E->first >= l && pr - E->first <= r){
            ansi = E->second; ansj = i;
            break;
        }
    }ansi++;
    cout << ansi << " " << ansj << endl;
}
*/

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