# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51739 | MatheusLealV | Detecting Molecules (IOI16_molecules) | C++17 | 101 ms | 7196 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 f first
#define s second
#define N 200050
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
ll pref[N], st = -1, en = -1;
vector< pii > v;
inline ll srange(int l, int r) {
return pref[r] - (l > 0 ? pref[l - 1] : 0);
}
vector<int> find_subset(int l, int u, vector<int> w)
{
for(int i = 0; i < w.size(); i++) v.push_back({w[i], i});
sort(v.begin(), v.end());
for(int i = 0; i < v.size(); i++)
{
pref[i] = (i > 0 ? pref[i - 1] : 0);
pref[i] += v[i].f;
}
int pt = 0;
for(int i = 0; i < v.size(); i++)
{
pt = max(i, pt);
while(pt < v.size() and srange(i, pt) <= u)
{
if(l <= srange(i, pt) and srange(i, pt) <= u) st = i, en = pt;
pt ++;
}
}
if(st == -1) return {};
vector<int> ans;
for(int i = st; i <= en; i++) ans.push_back(v[i].s);
return ans;
}
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... |