제출 #998701

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

molecules

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

const int N = 5e5 + 5;

std::vector<int> find_subset(int l, int r, std::vector<int> w) {
    int n = w.size();
    long long sum = 0;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) a[i] = make_pair(w[i], i);
    sort(a.begin(), a.end());
    for (int lx = 0, rx = 0; rx < w.size(); rx++) {
        sum += w[rx];
        while (sum > r) {
            sum -= w[lx++];
        }
        if (sum >= l) {
            vector<int> ans;
            for (int i = lx; i <= rx; i++) ans.emplace_back(a[i].second);
            return ans;
        }
    }
    return {};
}

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

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

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