제출 #51719

#제출 시각아이디문제언어결과실행 시간메모리
51719tincamateiDetecting Molecules (IOI16_molecules)C++14
9 / 100
3 ms604 KiB
#include<bits/stdc++.h>
#ifdef EVAL
#include "molecules.h"
#endif

using namespace std;

const int MAX_N = 200000;
long long _sp[1+MAX_N], *sp = _sp + 1;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n, lx, rx;
    vector<int> result;
    n = w.size();
    lx = 2, rx = 1;
    
    sort(w.begin(), w.end());
    
    for(int i = 0; i < n; ++i) {
        sp[i] = sp[i - 1] + w[i];
        for(int j = -1; j < i; ++j)
            if(l <= sp[i] - sp[j] && sp[i] - sp[j] <= u) {
                lx = j + 1;
                rx = i;
            }
    }
    
    for(; lx <= rx; ++lx)
        result.push_back(lx);
    return result;
}

#ifndef EVAL
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
#endif
#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...