# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101797 | baluteshih | Detecting Molecules (IOI16_molecules) | C++14 | 84 ms | 6472 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"
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define F first
#define S second
#define ET cout << "\n"
#define MP make_pair
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<int> ans;
vector<pll> v;
for(int i=0;i<w.size();++i)
v.pb(MP(w[i],i));
sort(ALL(v));
ll sum=0,r=0;
for(int i=0;i<v.size();sum-=v[i].F,++i)
{
while(r<v.size()&&v[r].F-v[i].F<=u-l&&sum+v[r].F<=u)
{
sum+=v[r].F,++r;
if(sum>=l)
{
for(int j=i;j<r;++j)
ans.pb(v[j].S);
return ans;
}
}
if(sum==0) break;
}
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... |