제출 #1115319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115319		komasan	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	336 KiB

molecules

#include<bits/stdc++.h>

using namespace std;

using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;

#define fi first
#define se second

template<class A, class B> inline bool maximize(A& x, B y) {
    if (x < y) {
        x = y;
        return true;
    } else
        return false;
};

template<class A, class B> inline bool minimize(A& x, B y) {
    if (x > y) {
        x = y;
        return true;
    } else
        return false;
};

vector<int> find_subset(int l, int r, vector<int> a) {
    vector<pair<int, int>> p;
    for (int i = 0; i < (int)a.size(); i++)
        p.push_back(make_pair(a[i], i + 1));

    sort(p.begin(), p.end());

    int sum = 0, j = 0;
    for (int i = 0; i < (int)p.size(); i++) {
        sum += p[i].fi;

        while (sum > r)
            sum -= p[j++].fi;
        
        if (sum >= l) {
            vector<int> ans;
            for (int k = j; k <= i; k++)
                ans.push_back(p[k].se);

            sort(ans.begin(), ans.end());

            return ans;
        }
    }

    return {};
}

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