Submission #1150908

#	Time	Username	Problem	Language	Result	Execution time	Memory
1150908		danglayloi1	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	584 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
const int nx=2e5+5;
vector<int> find_subset(int l, int u, vector<int> a)
{
    vector<int> res;
    int n=a.size();
    ll sum=0;
    vector<pair<ll, int>> b;
    b.resize(n);
    for(int i = 0; i < n; i++)
        b[i]={a[i], i};
    int pos=-1;
    for(int i = 0; i < n; i++)
        if(a[i]>=l && a[i]<=u)
            pos=i;
    if(pos!=-1)
    {
        res.clear();
        res.emplace_back(pos);
        return res;
    }
    sort(b.begin(), b.end());
    if(b[0].fi>u)
    {
        res.clear();
        return res;
    }
    for(int i = 0; i < n; i++)
        if(sum+b[i].fi<l) sum+=b[i].fi, res.emplace_back(b[i].se);
    int lim=n, j=res.size()-1;
    while(sum<l || sum>u)
    {
        ll tmp=sum-a[res[j]]+b[lim-1].fi;
        sum=tmp, res[j]=b[lim-1].se;
        lim--;
        j--;
        if(j<0) break;
    }
    bool ok[nx];
    for(int i = 0; i < n; i++)
        ok[i]=0;
    for(int i:res) ok[i]=1;
    for(int i = 0; i < n; i++)
    {
        if(ok[b[i].se]) continue;
        if(sum+b[i].fi<=u) sum+=b[i].fi, res.emplace_back(b[i].se), ok[b[i].se]=1;
    }
    if(sum>=l && sum<=u)
        return res;
    res.clear();
    return res;
}
// int main()
// {
//     vector<int> a=find_subset(10, 10, {1, 2, 3, 4});
//     for(int i:a) cout<<i<<' ';
// }

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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