# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537180 | andrei_boaca | Detecting Molecules (IOI16_molecules) | C++14 | 982 ms | 6004 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 <bits/stdc++.h>
#include "molecules.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
int n;
struct date
{
ll val,poz;
} v[200005];
bool comp(date a, date b)
{
return a.val<b.val;
}
vector<int> find_subset(int l,int u,vector<int> w)
{
n=w.size();
for(int i=0;i<w.size();i++)
if(w[i]>=l&&w[i]<=u)
return {i};
for(int i=0;i<w.size();i++)
v[i+1]={w[i],i};
sort(v+1,v+n+1,comp);
for(int i=1;i<=n;i++)
{
ll suma=0;
ll dr=0;
for(int j=i;j<=n;j++)
{
suma+=v[j].val;
if(suma>=l)
{
dr=j;
break;
}
}
if(suma<=u)
{
vector<int> vals;
for(int j=i;j<=dr;j++)
vals.push_back(v[j].poz);
return vals;
}
/*for(int j=i;j<=n;j++)
if(suma-v[j].val>=l&&suma-v[j].val<=u)
{
vector<int> vals;
for(int k=i;k<=dr;k++)
if(k!=j)
vals.push_back(v[k].poz);
return vals;
}*/
}
return {};
}
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... |