Submission #468572

#TimeUsernameProblemLanguageResultExecution timeMemory
468572PiejanVDCDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms204 KiB
#include <molecules.h> #include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); int cnt=0; sort(w.begin(),w.end()); int left=0,right=0; while(right < n) { if(cnt + w[right] > u) break; cnt+=w[right]; right++; } if(right == 0) return {}; bool f=false; while(right <= n) { if(cnt >= l && cnt <= u) { f=true; break; } if(right == n) break; cnt+=w[right]; cnt-=w[left]; right++,left++; } vector<int>ans={}; if(f) { for(; left < right ; left++) ans.push_back(left); } return ans; } /*signed main() { int n,l,u; cin >> n >> l >> u; vector<int>w(n); for(auto &z : w) cin >> z; vector<int>v = find_subset(l,u,w); for(auto x : v) cout << x << " "; }*/
#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...