Submission #798274

#	Time	Username	Problem	Language	Result	Execution time	Memory
798274		Liudas	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1058 ms	912 KiB

molecules

#include <bits/stdc++.h>

using namespace std;
vector<int> find_subset(int L, int R, vector<int> M){
    map<int, queue<int>> places;
    int N = M.size();
    for(int i = 0; i < N; i ++){
        places[M[i]].push(i);
    }
    map<int, int> sums;
    sums[0] = 0;
    vector<int> ord(N);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int a, int b){return M[a] < M[b];});
    for(int i : ord){
        map<int, int> sums1;
        for(auto [l ,r] : sums){
            if(sums.find(l + M[i]) == sums.end() && l + M[i] <= R)
            sums1[l + M[i]] = i;
        }
        for(auto [l, r] : sums1){
            sums[l] = r;
            if(L <= l && l <= R){
                i = N;
                break;
            }
        }
    }
    vector<int> p;
    for(int i = L; i <= R; i ++){
        if(sums.find(i) != sums.end()){
            int t = i;
            while(t){
                p.push_back(sums[t]);
                t -= M[sums[t]];
            }
            return p;
        }
    }
    return p;
}

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