Submission #699521

#	Time	Username	Problem	Language	Result	Execution time	Memory
699521		Alihan_8	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	43 ms	7212 KiB

molecules

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
vector <int> find_subset(int l, int r, vector <int> w){
    int n = (int)w.size();
    vector <pair<long long,int>> p(n);
    for ( int i = 0; i < n; i++ ) p[i] = {w[i], i};
    sort(all(p));
    vector <int> res;
    long long tl = 0, tr = 0, sum = 0;
    while ( tl < n ){
        while ( tr < n and sum < l ) sum += p[tr++].first;
        if ( sum < l ) break;
        if ( sum <= r ){
            for ( int j = tl; j < tr; j++ ) res.pb(p[j].second);
            break;
        }
        sum -= p[tl++].first;
    }
    return res;
}

Compilation message (stderr)

molecules.cpp: In function 'void IO(std::string)':
molecules.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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