제출 #935789

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

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>

vector<int> ans(int l, int r, vector<pll> w) {
    vector<int> a;
    for (int i = l; i < r; i++) {
        a.push_back(w[i].second);
    }
    return a;
}

vector<int> find_subset(int lb, int ub, vector<int> w) {
    int n = w.size();
    vector<pll> arr(n);
    for (int i = 0; i < n; i++) {
        arr[i].first = w[i];
        arr[i].second = i;
    }
    sort(arr.begin(), arr.end());
    int l = 0, r = 0;
    ll currSum = 0;
    while (r < n) {
        while (currSum < lb && r < n) {
            currSum += arr[r++].first;
        }
        while (currSum > ub && l < r) {
            currSum -= arr[l++].first;
        }
        if (currSum >= lb && currSum <= ub) {
            return ans(l, r, arr);
        }
        if (r < n) currSum += arr[r++].first;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:16:22: warning: control reaches end of non-void function [-Wreturn-type]
   16 |     vector<pll> arr(n);
      |                      ^

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