Submission #982566

#TimeUsernameProblemLanguageResultExecution timeMemory
982566MarwenElarbiDetecting Molecules (IOI16_molecules)C++17
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> //#include "molecules.h" using namespace std; //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #define fi first #define se second #define ll long long #define pb push_back mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); std::vector<int> find_subset(int l, int u, std::vector<int> w){ int ans=0; int n=w.size(); vector<int> res; bool test=false; for (int i = 0; i < n-1; ++i) { ans+=w[i]; res.pb(i); if(ans+w[n-1]>=l&&ans+w[n-1]<=u){ test=true; res.pb(n-1); return res; }else if(ans+w[n-1]-w[0]>=l&&ans+w[n-1]-w[0]<=u){ reverse(res.begin(),res.end()); res.pop_back(); res.pb(n-1); return res; } } return res; } /*int main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n, l, u; assert(3 == scanf("%d %d %d", &n, &l, &u)); std::vector<int> w(n); for (int i = 0; i < n; i++) assert(1 == scanf("%d", &w[i])); std::vector<int> result = find_subset(l, u, w); printf("%d\n", (int)result.size()); for (int i = 0; i < (int)result.size(); i++) printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]); }*/

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:10: warning: variable 'test' set but not used [-Wunused-but-set-variable]
   15 |     bool test=false;
      |          ^~~~
#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...