제출 #1037040

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

molecules

//                          بسم الله الرحمن الرحيم
#include "bits/stdc++.h"

using namespace std;

#define ll long long
//#define int long long
#define pb push_back
#define pob pop_back
//#define pb push
#define endl '\n'
#define ld long double
/*#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops,avx,avx2,ssse3,tune-native")*/
#define applejuice ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);

const ll mod=1e9+7;
const ll inf=1e18;
const ll mxsz=204;
const ld pi=acos(-1.0);

vector<int>find_subset(int l,int u,vector<int>w){
    int n=w.size();
    vector<pair<int,int>>a;
    for (int i=0;i<n;i++){
        a.pb({w[i],i});
    }
    sort(a.begin(),a.end());
    ll sum=0;
    vector<int>ans;
    /*for (int i=0,j=0;j<n;j++){
        sum+=a[j].first;
        while (sum>u){
            sum-=a[i++].first;
        }
        if (sum>=l){
            for (int k=i;k<=j;k++){
                ans.pb(a[k].second);
            }
            break;
        }
    }*/
    int j=0;
    for (int i=0;i<n;i++){
        sum+=a[i].first;
        if (sum>u) {
            while (sum > u) {
                sum -= a[j].first;
                j++;
            }
        }
        if (sum>=l){
            for (int l=j;l<=i;l++){
                ans.pb(a[l].second);
            }
        }
    }
    return ans;
}

/*
signed main(){
    applejuice;

    int l,u;
    cin>>l>>u;
    vector<int> w(4);
    for (int i=0;i<4;i++)cin>>w[i];
    vector<int>ans;
    ans=find(l,u,w);
    for (auto x:ans)cout<<x<<" ";

    return 0;
}*/

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