제출 #680362

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define f0(i, n) for(int i = 0; i < n; i++)
#define f1(i, n) for(int i = 1; i <= n; i++)

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<pair<int, int>> vp;
    f0(i, w.size()) {
        vp.push_back({w[i], i});
    }
    sort(vp.begin(), vp.end());

    long long sum = 0, n = w.size();
    vector<int> ans;
    for (long long i = 0; i < w.size(); i++) {
        if (sum + vp[i].first <= u) {
            sum += vp[i].first;
            ans.push_back(vp[i].second);
        } else {
            if(sum >= l) {
                return ans;
            } else {
                int nn = ans.size();
                f1(i, nn) {
                    sum -= vp[nn - i].first;
                    sum += vp[n - i].first;
                    ans[nn - i] = vp[n - i].second;
                    if(sum >= l) {
                        return ans;
                    }
                }
                return vector<int>(0);
            }
            break;
        }
    }

    return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:5:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define f0(i, n) for(int i = 0; i < n; i++)
......
   10 |     f0(i, w.size()) {
      |        ~~~~~~~~~~~                 
molecules.cpp:10:5: note: in expansion of macro 'f0'
   10 |     f0(i, w.size()) {
      |     ^~
molecules.cpp:17:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (long long i = 0; i < w.size(); i++) {
      |                           ~~^~~~~~~~~~

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