Submission #1211269

#TimeUsernameProblemLanguageResultExecution timeMemory
1211269madamadam3Detecting Molecules (IOI16_molecules)C++20
100 / 100
34 ms5312 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; // const int MAX_SUM = 500'000; // using bset = bitset<MAX_SUM+1>; int n, l, u; vector<int> o, w; vector<int> find_subset(int L, int U, vector<int> W) { w = W; n = w.size(); l = L; u = U; o.resize(n); iota(o.begin(), o.end(), 0); sort(o.begin(), o.end(), [&](int a, int b) {return w[a] < w[b];}); deque<int> as; long long cur_sum = 0; for (int i = 0; i < n; i++) { if (cur_sum < l) { cur_sum += w[o[i]]; as.push_back(o[i]); } while (cur_sum > u) { cur_sum -= w[as.front()]; as.pop_front(); } } vector<int> ans; for (auto &el : as) ans.push_back(el); if (cur_sum < l || cur_sum > u) ans.clear(); return ans; }

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...