Submission #237125

#	Time	Username	Problem	Language	Result	Execution time	Memory
237125		uacoder123	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	12 ms	512 KiB

molecules

 #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <ii,lli> iii;
typedef vector <lli> vi;

vector<int> find_subset(int l,int r,vector<int> arr1)
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
    lli n=arr1.size(),l1=0,r1=0;
    cin>>n>>l>>r;
    vector<ii> arr(n);
    for(lli i=0;i<n;++i)
    {
      arr[i].F=arr1[i];
      arr[i].S=i;
    }
    sort(all(arr));
    vector<ii> p(n+1);
    p[0]=mp(0,0); 
    for(lli i=1;i<=n;++i)
    {
      p[i]=mp(p[i-1].F+arr[i-1].F,i);
    }
    for(lli i=0;i<n;++i)
    {
      auto it = lower_bound(all(p),mp(p[i].F+l,0*1LL));
      if((*it).F-p[i].F>=l&&(*it).F-p[i].F<=r)
      {
        l1=p[i].S;
        r1=(*it).S;
        break;
      }
    }
    vector<int> v(r1-l1);
    for(lli i=l1+1;i<=r1;++i)
      v[i]=arr[i].S;
  return(v);
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31