제출 #209407

#제출 시각아이디문제언어결과실행 시간메모리
209407AutoratchDetecting Molecules (IOI16_molecules)C++14
100 / 100
73 ms8416 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

deque<pair<long long,int> > q;
vector<pair<long long,int> > a;
long long sum,idx;

vector<int> find_subset(int x,int y,vector<int> b)
{
    for(int i = 0;i < b.size();i++) a.push_back({b[i],i});
    sort(a.begin(),a.end());
    while(true)
    {
        if(sum<x)
        {
            if(idx==a.size()) return vector<int>(0);
            q.push_back(a[idx]),sum+=a[idx].first;
            idx++;
        }
        else if(sum>y)
        {
            sum-=q.front().first;
            q.pop_front();
        }
        else
        {
            vector<int> ans;
            for(auto p : q) ans.push_back(p.second);
            return ans;
        }
    }
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < b.size();i++) a.push_back({b[i],i});
                   ~~^~~~~~~~~~
molecules.cpp:17:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(idx==a.size()) return vector<int>(0);
                ~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...