제출 #1115239

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

molecules

#pragma once
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int NMAX = (int)1e3 * 2;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<pair<int,int>>p;
    for (int i = 0; i < w.size();++i)
        p.push_back({w[i],i});
    sort(p.begin(),p.end());
    vector<int>v;
    int s = 0;
    for (int i = w.size() - 1; i >= 0;--i) {
        if (s >= l && s <= u) return v;
        if (s + p[i].first <= u) {
            v.push_back(p[i].second);
            s += p[i].first;
        }
    }
    if (s < l) return {};
    return v;
}

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

molecules.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     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