제출 #492113

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

molecules

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <string>
#include <list>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<int, pi> ppi;

vector<int> find_subset(int l, int u, std::vector<int> w) {
    int sum = 0;
    vi ans;

    vector<pi> s(w.size());

    for (int i = 0; i < w.size(); i++)
    {
        s[i] = pi(w[i], i);
    }
    

    sort(s.begin(), s.end());

    for (int i = w.size()-1; i >= 0; i--)
    {
        if (sum + s[i].first > u) continue;
        sum += s[i].first;
        ans.push_back(s[i].second);
        if (sum >= l) break;
    }
    
    if (sum < l || sum > u) return vi(0);
    else return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i = 0; i < w.size(); i++)
      |                     ~~^~~~~~~~~~

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