| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145251 | mat_v | Detecting Molecules (IOI16_molecules) | C++14 | 72 ms | 10464 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <cassert>
#include <bits/stdc++.h>
#include "molecules.h"
#define maxn 200005
#define pb push_back
#define xx first
#define yy second
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;
int n;
ll pref[maxn];
ll suff[maxn];
int a,b;
bool dobar(ll x){
    if(x >=a && x<=b)return 1;
    return 0;
}
vector<pii>v;
vector<int>uradi(int x, int y){
    vector<int>rezz;
    for(int i=0; i<x; i++)rezz.pb(v[i].yy);
    for(int i=n-1; i>=n-y; i--)rezz.pb(v[i].yy);
    return rezz;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    n = w.size();
    for(int i=0; i<n; i++)v.pb({w[i], i});;
    sort(v.begin(), v.end());
    ll tren = 0;
    a = l;
    b = u;
    for(int i=0; i<n; i++){
        tren += v[i].xx;
        pref[i + 1] = tren;
    }
    if(dobar(pref[n])){
        vector<int> rez;
        for(int i=0; i<n; i++)rez.push_back(i);
        return rez;
    }
    vector<int>rez;
    if(pref[n] < l)return rez;
    tren = 0;
    for(int i=n; i>=1; i--){
        tren += v[i - 1].xx;
        suff[n - i + 1] = tren;
    }
    bool ima = 0;
    int le=0,de=0;
    while(pref[le] < l)le++;
    if(dobar(pref[le])){
        ima = 1;
        return uradi(le,de);
    }
    for(int i=1; i<=n; i++){
        de = i;
        if(suff[de] >= l){
            if(dobar(suff[de]))return uradi(0,de);
            return rez;
        }
        ll sum = pref[le] + suff[de];
        while(pref[le] + suff[de] >= l)le--;
        le++;
        if(dobar(pref[le] + suff[de]))return uradi(max(le,0),de);
    }
    return rez;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
