Submission #1001867

#TimeUsernameProblemLanguageResultExecution timeMemory
1001867vjudge1Detecting Molecules (IOI16_molecules)C++17
100 / 100
51 ms6352 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define f first #define s second #define pb push_back #define pf push_front #define pi pair<int,int> #define vi vector<int> vi find_subset(int l, int u, vi w){ int n= w.size(); vector<pi>hold; for(int i =0 ; i<n; i++){ hold.pb({w[i],i}); } ll sum =0; int j = 0; sort(hold.begin(), hold.end()); for(int i =0; i < n; i++){ sum+=hold[i].f; while(sum>u&&j <n ){ sum-=hold[j].f; j++; } if(sum>=l && sum<=u){ vi ans; int cnt = 0; // cout << j << " " << i << endl; for(int k = j ; k <= i; k++){ ans.pb(hold[k].s); cnt++; } sort(ans.begin(),ans.end()); return ans; } } vi rv; return rv; }
#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...