Submission #138861

#TimeUsernameProblemLanguageResultExecution timeMemory
138861RiscadoADetecting Molecules (IOI16_molecules)C++14
100 / 100
62 ms5624 KiB
#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 = 0, best_y = 0;
        long long best_s = W[0].first;
        for (long long x = 0, y = 0, s = W[0].first, d; x < N && y < N;) {
                if (s > l)
                        s -= W[x++].first;
                else
                        s += W[++y].first;

                if (s >= l && (s < best_s || best_s < l)) {
                        best_x = x;
                        best_y = y;
                        best_s = s;
                }       
        }

        if (best_s < l || best_s > u)
                return {};

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

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:17:54: warning: unused variable 'd' [-Wunused-variable]
         for (long long x = 0, y = 0, s = W[0].first, d; x < N && y < N;) {
                                                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...