Submission #252288

#	Time	Username	Problem	Language	Result	Execution time	Memory
252288		paradox	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	65 ms	6256 KiB

molecules

#include "molecules.h"

#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
using namespace std;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define vi vector<int>
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
 
typedef long long ll;
typedef short inth;
 
const int N = 1e4;
const int M = N + 7;
const int MOD = 1e9 + 7;
const ll INF = 1e16 + 17;

bool dp[M];

int par[M];

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = sz(w);
    vector<pii> a;

    for (int i = 0; i < n; ++i) {
        a.pb(mp(w[i], i));
    }

    sort(all(a));
    reverse(all(a));
    ll pref = 0;

    vector<int> ans;

    for (int i = 0; i < n; ++i) {
        pref += a[i].fi;
        if (pref >= l) {
            int dif = 0;
            while (pref > u && n - dif - 1 > i && dif <= i) {
                pref -= a[dif].fi;
                pref += a[n - 1 - dif].fi;
                ++dif;
            }
            if (pref <= u) {
                for (int j = dif; j <= i; ++j)
                    ans.pb(a[j].se);
                for (int j = n - dif; j < n; ++j)
                    ans.pb(a[j].se);
            }
            break;
        }
        
    }
    
    sort(all(ans));
    return ans;
}

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