# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718712 | n1k | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
#define ll long long
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<array<int, 2>> v;
for(int i = 0; i < sz(w); i++){
v.push_back({w[i], i});
}
sort(all(v));
sort(all(w));
ll ps = 0, ss = 0;
for(int i = 0; i < sz(w); i++){
ps += w[i];
ss += w[sz(w) - i - 1];
if(ps <= u && ss >= l){
cout << "ps: " << ps << endl;
cout << "ss: " << ss << endl;
int l1 = 0, r1 = i;
int l2 = sz(w) - i - 1, r2 = sz(w) - 1;
set<int> ans;
for(int j = l1; j <= r1; j++){
ans.insert(v[j][1]);
}
for(int j = l1; j <= r1; j++){
if(l <= ps && ps <= u){
cout << "j: " << j << endl;
return vector(all(ans));
}
ps -= w[j];
ps += w[l2 + j];
ans.erase(v[j][1]);
ans.insert(v[l2 + j][1]);
}
if(l <= ps && ps <= u){
return vector<int>(all(ans));
}
}
}
return std::vector<int>(0);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |