Submission #282571

#	Time	Username	Problem	Language	Result	Execution time	Memory
282571		BeanZ	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	65 ms	6252 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;
#define ll int
#define endl '\n'
const int N = 10005;
const int mod = 1e9 + 7;
vector<ll> find_subset(ll l, ll u, vector<ll> w){
        vector<ll> res;
        vector<pair<ll, ll>> a;
        for (int i = 0; i < w.size(); i++){
                a.push_back({w[i], i});
        }
        sort(a.begin(), a.end());
        ll lf = 0;
        long long sum = 0;
        for (int i = 0; i < a.size(); i++){
                sum = sum + a[i].first;
                while (sum > u){
                        sum -= a[lf].first;
                        lf++;
                }
                if (sum >= l){
                        for (int j = lf; j <= i; j++){
                                res.push_back(a[j].second);
                        }
                        break;
                }
        }
        return res;
}
/*
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
}
*/

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for (int i = 0; i < w.size(); i++){
      |                         ~~^~~~~~~~~~
molecules.cpp:18:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for (int i = 0; i < a.size(); i++){
      |                         ~~^~~~~~~~~~

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