# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1263202 | silentloop | Detecting Molecules (IOI16_molecules) | C++20 | 1096 ms | 5816 KiB |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(x) (x).begin(), (x).end()
#define sz(x) int((x).size())
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int>ans;
vector<pair<ll,ll>>v;
vector<ll>pref;
ll x, k;
int i, j;
for(i=0; i<sz(w); i++)
v.pb({w[i],i});
sort(all(v));
pref.resize(sz(v),0);
pref[0]=v[0].fst;
for(i=1; i<sz(v); i++)
{
pref[i]=pref[i-1]+v[i].fst;
}
for(i=0; i<sz(v); i++)
{
for(j=i; j<sz(v); j++)
{
x=pref[j];
if(i>0)
x=x-pref[i-1];
if(l<=x&&x<=u)
{
for(k=i; k<=j; k++)
{
ans.pb(v[k].snd);
}
return ans;
}
}
}
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... |