제출 #921332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921332		H1H	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	600 KiB

molecules

#include<bits/stdc++.h>
#define T "Task"
using namespace std;


vector<int> find_subset(int l, int u, vector<int> w){
    vector<pair<int, int>> a;
    for(int i = 0; i < w.size(); ++i){
        a.push_back({w[i], i});
    }
    sort(a.begin(), a.end(), [](pair<int,int> a1, pair<int,int> a2){
        return a1.first > a2.first;
    });
    vector<int> ans;
    long long sum_val = 0;
    int id = 0;

    while(true){
        if(id == a.size())break;
        sum_val += a[id].first;
        ans.push_back(a[id].second);
        if(sum_val >= l && sum_val <= u){
            return ans;
        }
        if(sum_val > u){
            sum_val -= a[ans[0]].first;
            ans[0] = a[a.size()-1].second;
            sum_val += a[ans[0]].first;
            if(!(sum_val >= l && sum_val <= u) || id == a.size()-1){
                ans.clear();
            }
            return ans;
        }
        id += 1;
    }
    ans.clear();
    return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i = 0; i < w.size(); ++i){
      |                    ~~^~~~~~~~~~
molecules.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |         if(id == a.size())break;
      |            ~~~^~~~~~~~~~~
molecules.cpp:29:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             if(!(sum_val >= l && sum_val <= u) || id == a.size()-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