제출 #1001660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001660		hacizadal	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	41 ms	7364 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
ll p[200005];


std::vector<int> find_subset(int k, int u, std::vector<int> w) {
    vector<pair<int, int>>v;
    for (int i = 0; i<w.size(); i++){
        v.push_back({w[i], i});
    }
    sort(v.begin(), v.end());
    for (ll i = 0; i<v.size(); i++){
        p[i+1] = p[i] + v[i].first;
    }
    vector<int>f;
    for (ll i = 0; i<v.size(); i++){
        ll l = i, r = v.size()-1;
        while (l <= r){
            ll m = (l + r)/2;
            if (p[m+1] - p[i] >= k and p[m+1] - p[i] <= u and v[m].first - v[i].first <= (u - k)){
                for (ll j = i; j<=m; j++){
                    f.push_back(v[j].second);
                }
                sort(f.begin(), f.end());
                return f;
            }
            else if (p[m+1] - p[i] < k){
                l = m + 1;
            }
            else {
                r = m - 1;
            }
        }
    }
    return f;
}

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

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

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