제출 #370461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370461		amano_hina	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	2 ms	2048 KiB

molecules

#include<bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    pair<int,int> p[200005];
    long long  n=w.size();
    for(int i=0;i<n;i++)
    {
        p[i].first=w[i];
        p[i].second=i;
    }
    sort(w.begin(),w.end());
    vector<int> ans;
    long long mn=0,mx=0,cnt;
    bool d=1;
    for(long long i=0;i<n;i++)
    {
        mn=mn+w[i];
        mx=mx+w[n-1-i];
        if(mn>=l&&mn<=u)
        {
            for(long long j=0;j<=i;j++)
            {
                ans.push_back(p[j].second);
            }
            break;
        }
        else if(mx>=l&&mx<=u)
        {
            for(long long j=n-1;j>=n-1-i;j--)
            {
                ans.push_back(p[j].second);
            }
            break;
        }
        else if(mn<l&&u<mx)
        {
            cout<<i<<'\n';
            cnt=mn;
            for(long long j=i;j>=0;j--)
            {
                cnt=cnt-w[j]+w[n-1-(i-j)];
                if(cnt>=l&&cnt<=u)
                {
                    for(long long k=0;k<j;k++)
                    {
                        ans.push_back(p[k].second);
                    }
                    for(long long k=n-1;k>=n-1-(i-j);k--)
                    {
                        ans.push_back(p[k].second);
                    }
                    break;

                }
            }
            break;
        }
    }
    return ans;


}
/*int main()
{
    int l,u,x;
    cin>>l>>u;
    vector<int> w;
    vector<int> out;
    while(cin>>x)
    {
        w.push_back(x);
    }
    out=find_subset(l, u, w);
    for(int i=0;i<out.size();i++)
    {
        cout<<out[i]<<" ";
    }

}*/

컴파일 시 표준 에러 (stderr) 메시지

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:10: warning: unused variable 'd' [-Wunused-variable]
   14 |     bool d=1;
      |          ^

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