Submission #556262

#	Time	Username	Problem	Language	Result	Execution time	Memory
556262		Talha_Taki	Detecting Molecules (IOI16_molecules)	C++17	10 / 100	1 ms	340 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector <int> ret;

    int n = w.size();

    vector <pii> W(n);
    for(int i = 0; i < n; ++i) {
        W[i] = {w[i], i};
    }
    sort(W.begin(), W.end());


    bool flag = true;
    for(int i = 0; flag && i < n; ++i) {
        for(int j = i+1; flag && j < n; ++j) {
            ll sum = 0;
            for(int k = i; k <= j; ++k) {
                sum += W[k].first;
            }
            if (l <= sum && sum <= u) {
                flag = false;
                for(int k = i; k <= j; ++k) {
                    ret.push_back(W[k].second);
                }
            }
        }
    }


    return ret;
}

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