제출 #1001808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001808		vjudge1	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1096 ms	348 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define pf push_front
#define pi pair<int,int>
#define vi vector<int>


vi find_subset(int l, int u, vi w){
   
    int n= w.size();
   
    vector<pi>hold;
    for(int i =0 ; i<n; i++){
        hold.pb({w[i],i});
        
    }
    ll sum  =0;
    int j = 0;
    int i = 0;
    sort(hold.begin(), hold.end());
   
    while(j<=i &&i <=n && j<n ){
       // cout <<j<<"  "<<i<< " " << sum <<" "<<l<<" "<< u << endl;
        if(sum>=l && sum<=u){
            
           
            vi ans;
            int cnt = 0;
            for(int k = j ; k < i; k++){
                ans.pb(hold[k].s);
                cnt++;
            }
            sort(ans.begin(),ans.end());
            return ans;
           // return ans;
        }
        else if(sum <l){
            //cout << i << " "<< j << " "<< sum <<endl;
            while(sum<l&& i <n ){
                sum+=hold[i].f;                
                i++; 
            }
            //cout << i << " exit "<< j << " "<< sum <<endl;
        }
        else {
             while(sum>u&& j <n ){
                //  cout << j << " "<< hol endl;
                  sum-=hold[j].f;
                 j++;  
            }
        }
    }
    vi rv;
    return rv;
    
    
}


/*
int main(){
    int n,l,u;
    cin >> n >> l >> u;
    vi we;
    int val;
    for(int i = 0; i <n; i++){
        cin >>val;
        we.pb(val);
      
    }
   
   vi ans =find_subset(l,u,we);
   for(int i : ans){
       cout << i << " ";
   }
}
*/

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