Submission #546878

#	Time	Username	Problem	Language	Result	Execution time	Memory
546878		fvogel499	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1093 ms	2584 KiB

molecules

/*
 * File created on 04/07/2022 at 22:12:14.
 * Link to problem: 
 * Description: 
 * Time complexity: O()
 * Space complexity: O()
 * Status: ---
 * Copyright: Ⓒ 2022 Francois Vogel
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>

using namespace std;
using namespace __gnu_pbds;

#define pii pair<int, int>
#define f first
#define s second

#define vi vector<int>
#define all(x) x.begin(), x.end()
#define size(x) (int)((x).size())
#define pb push_back
#define ins insert
#define cls clear

// #define int ll
#define ll long long
#define ld long double

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int siz = 5e5+40;

vi find_subset(int start, int end, vi b) {
    bitset<siz> knapsack;
    knapsack.reset();
    knapsack.flip(0);
    int ori [siz];
    for (int i = 0; i < siz; i++) ori[i] = -1;
    for (int i = 0; i < size(b); i++) {
        bitset<siz> pre = knapsack<<b[i];
        bitset<siz> loc = (pre^knapsack)&pre;
        knapsack |= pre;
        while (loc.any()) {
            int pos = loc._Find_first();
            assert(ori[pos] == -1);
            ori[pos] = i;
            loc.flip(pos);
        }
    }
    vi res;
    for (int i = start; i <= end; i++) if (ori[i] != -1) {
        int x = i;
        while (x > 0) {
            res.pb(ori[x]);
            x -= b[ori[x]];
        }
        break;
    }
    return res;
}

// signed main() {
//     cin.tie(0);
//     ios_base::sync_with_stdio(0);

//     int n, l, u;
//     cin >> n >> l >> u;
//     vi b(n);
//     for (int i = 0; i < n; i++) cin >> b[i];
//     vi res = find_subset(l, u, b);
//     for (int i : res) cout << i << ' ';

//     cout.flush();
//     int d = 0;
//     d++;
// }

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