Submission #683978

#TimeUsernameProblemLanguageResultExecution timeMemory
683978JuanDetecting Molecules (IOI16_molecules)C++17
69 / 100
40 ms4040 KiB
#include<bits/stdc++.h> using namespace std; #define pii pair<int, int> #define ff first #define ss second vector<int> find_subset(int L, int R, vector<int> w){ int n = w.size(); vector<pii> arr; for(int i = 0; i < n; i++) arr.push_back({w[i], i}); sort(arr.begin(), arr.end()); vector<int> ans; int l=0, r=1, sum=arr[0].ff; if(sum>=L && sum<=R) {ans.push_back(arr[0].ss); return ans;} while(r<n){ if(sum<L) sum += arr[r++].ff; if(sum>R) sum -= arr[l++].ff; if(sum>=L && sum<=R){ for(int i = l; i < r; i++) ans.push_back(arr[i].ss); break; } } return ans; }
#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...