제출 #52055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52055		tincamatei	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	89 ms	30212 KiB

molecules

#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<pair<int, int> > w2;
    vector<int> result;
    n = w.size();
    lx = 2, rx = 1;
    
    for(int i = 0; i < n; ++i)
        w2.push_back(make_pair(w[i], i));
    
    sort(w2.begin(), w2.end());
    
    for(int i = 0; i < n; ++i)
        w[i] = w2[i].first;
    
    for(int i = 0; i < n; ++i) {
        int st = -1, dr = i;
        sp[i] = sp[i - 1] + w[i];
        while(dr - st > 1) {
        	int mid = (st + dr) / 2;
            if(sp[i] - sp[mid] >= l)
                st = mid;
            else
                dr = mid;
        }
        if(l <= sp[i] - sp[st] && sp[i] - sp[st] <= u)
            lx = st, rx = i;
    }
    
    for(lx = lx + 1; lx <= rx; ++lx)
        result.push_back(w2[lx].second);
    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

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