Submission #672655

#TimeUsernameProblemLanguageResultExecution timeMemory
672655mseebacherDetecting Molecules (IOI16_molecules)C++17
100 / 100
45 ms6176 KiB
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pair<int,int>> zwischen; for(int i = 0;i<n;i++){ zwischen.push_back({w[i],i}); } sort(zwischen.begin(),zwischen.end()); int left = 0; long long sum = 0; for(int r = 0;r<n;r++){ sum += zwischen[r].first; if(sum > u){ sum -= zwischen[left].first; left++; } if(sum >= l){ vector<int> erg; for(int i = left;i<=r;i++){ erg.push_back(zwischen[i].second); } return erg; } } 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...