제출 #298006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
298006		Azimjon	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	62 ms	5496 KiB

molecules

// name = molecules_sk_greedy_1_n.cpp, type = cpp.g++11

#include "molecules.h"
/** Author: Sergey Kopeliovich ([email protected]) */

// idea : answer is a segment of sorted weights
// time = O(n)

#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

#define forn(i, n) for (int i = 0; i < (int)(n); i++)

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

// return value: result if solution exists and empty vector otherwise
vector<int> find_subset( int L, int U, vector<int> w ) {
        int n = w.size();
        vector<pii> wp(n);
        forn(i, n)
                wp[i] = pii(w[i], i);
        sort(wp.begin(), wp.end());
        int r = 0;
        ll sum = 0;
        forn(l, n) {
                while (r < n && sum < L)
                        sum += wp[r++].first;
                if (L <= sum && sum <= U) {
                        vector<int> res;
                        for (; l < r; l++)
                                res.push_back(wp[l].second);
                        return res;
                }
                sum -= wp[l].first;
        }
        return vector<int>();
}

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