제출 #1063445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1063445		nvujica	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	24 ms	6368 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 1e4 + 10;

int n;
ll pref[maxn];
ll suf[maxn];
vector <pair<int, int> > w2;

vector<int> find_subset(int l, int u, vector<int> w) {
    n = w.size();

    for(int i = 0; i < n; i++){
        w2.push_back({w[i], i});
    }

    sort(w2.begin(), w2.end());

    pref[0] = w2[0].fi;
    suf[n - 1] = w2[n - 1].fi;

    for(int i = 1; i < n; i++){
        pref[i] = pref[i - 1] + w2[i].fi;
    }

    for(int i = n - 2; i >= 0; i--){
        suf[i] = suf[i + 1] +w2[i].fi;
    }

    vector <int> v;

    for(int k = 1; k <= n; k++){
        // cout << k << " " << pref[k - 1] << endl;

        if(pref[k - 1] <= u && suf[n - k] >= l){
            // cout << k << endl;

            int sum = pref[k - 1];
            int x = 0;

            while(sum < l){
                sum -= w2[x].fi;
                sum += w2[n - x - 1].fi;
                x++;
            }

            for(int i = x; i < k; i++) v.push_back(w2[i].se);
            for(int i = n - x; i < n; i++) v.push_back(w2[i].se);
            return v;
        }
    }

    return v;
}

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