Submission #1208501

#TimeUsernameProblemLanguageResultExecution timeMemory
1208501omsincoconutDetecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms328 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; vector<int> find_subset(int l, int u, vector<int> w) { int n = w.size(); vector<pair<ll, int>> wi(n); ll sum_all = 0; for (int i = 0; i < n; i++) { wi[i] = make_pair((ll)w[i], i); sum_all += w[i]; } sort(wi.begin(), wi.end()); if (u < wi[0].first || u > sum_all) return vector<int>(); ll cur_sum = 0; int idx1 = n-1; while (cur_sum < l) { cur_sum += wi[idx1].first; idx1--; } int idx2 = 0; while (cur_sum > u) { cur_sum += wi[idx2].first - wi[n-idx2-1].first; idx2++; } vector<int> ans; for (int i = 0; i < idx2; i++) ans.push_back(wi[i].second); for (int i = idx1+1; i < n-idx2; i++) ans.push_back(wi[i].second); if (idx1+1 <= idx2-1) return vector<int>(); 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...