Submission #138853

#	Time	Username	Problem	Language	Result	Execution time	Memory
138853		RiscadoA	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	3 ms	376 KiB

molecules

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

const int MAX_N = 200000;
int N;
std::pair<int, int> W[MAX_N];

std::vector<int> find_subset(int l, int u, std::vector<int> w_in)
{
        N = (int)w_in.size();
        for (int i = 0; i < N; ++i)
                W[i] = std::make_pair(w_in[i], i);
        std::sort(std::begin(W), std::begin(W) + N);
        
        int best_x = -1, best_y = -1, best_d = MAX_N;
        for (int x = 0, y = 0, s = 0, d; x < N && y < N;) {
                if (s > l) {
                        s -= W[x].first;
                        ++x;
                }
                else {
                        ++y;
                        s += W[y].first;
                }
                
                d = s - l;
                if (d > 0 && d < best_d) {
                        best_x = x;
                        best_y = y;
                        best_d = d;
                }       
        }

        if (best_x == -1 || best_y == -1 || best_d + l > u)
                return {};

        std::vector<int> ret;
        for (int x = best_x; x < best_y; ++x)
                ret.push_back(W[x].second);
        return ret;
}

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