제출 #1138645

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138645		tnknguyen_	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	328 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

#define endl '\n' 
#define ll long long 
#define len(s) (int)s.size() 
// #define int long long 

#define pii pair<int, int>
#define fi first
#define se second
#define MASK(k) (1LL << (k))

vector<int> find_subset(int l, int u, vector<int> w){
    ll sum = 0;
    int i = 0, j = 0;
    bool ok = 0;
    sort(w.begin(), w.end());
    for(; i<len(w); ++i){
        while(sum < l && j<len(w)){
            sum += w[j];
            ++j;
        }
        if(l <= sum && sum <= u){
            ok = 1;
            break;
        }
        sum -= w[i];
    }
    vector<int> ans;
    if(ok) for(int x=i; x<j; ++x) ans.push_back(x);
    return ans;
}

// int32_t main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     cout.tie(0);

//     freopen("main.inp","r",stdin);
//     freopen("main.out","w",stdout);

//     vector<int> v = find_subset(10, 20, {15, 17, 16, 18});
//     for(int x : v) cout << x << ' ';

//     return 0;
// }

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

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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