Submission #683966

#TimeUsernameProblemLanguageResultExecution timeMemory
683966JuanDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms340 KiB
#include<bits/stdc++.h> using namespace std; vector<int> find_subset(int L, int R, vector<int> w){ int pref = 0, suff = 0, n = w.size(); int r; vector<int> ans; bool found = false; for(int i = 0; i < n; i++){ pref+=w[i], suff+=w[n-1-i]; if(pref<=R && suff>=L){ found = true, r = R; break; } } if(!found) return ans; int l=0, sum=pref; while(true){ if(sum>=L && sum<=R){ for(int i = l; i <= r; i++) ans.push_back(i); break; } sum += w[++r] - w[l++]; } 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...