Submission #320632

#TimeUsernameProblemLanguageResultExecution timeMemory
320632Aryan_RainaDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms384 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef pair<int, int> pi; #define F first #define S second #define PB push_back #define MP make_pair #define pop_front(v) v.erase(v.begin()) #define REP(i, a, b) for (int i=a; i<=b; i++) #define REPn(i, a, b) for (int i=a; i>=b; i--) #define FOR(i, n) REP(i, 0, n-1) #define FORn(j, n) REPn(j, n-1, 0) #define all(v) (v).begin(), (v).end() #define allR(v) (v).rbegin(), (v).rend() vi find_subset(int l, int u, vi w) { int n=w.size(); vector<pi> v(n); FOR(i,n) v[i]={w[i],i}; sort(all(v)); int sum=0; FOR(i, n) { sum=0; vi ans={}; REP(j, i, n-1) { sum+=v[j].F; ans.PB(j); if (sum>=l&&sum<=u) return ans; if (sum>u) break; } } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...