제출 #875762

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
875762		TahirAliyev	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	47 ms	6180 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>
#define ll long long 

vector<pii> v;

std::vector<int> find_subset(int l, int u, std::vector<int> w){
    for(int i = 0; i < w.size(); i++){
        v.push_back({w[i], i});
    }
    sort(v.begin(), v.end());
    int p1 = 0, p2 = 0;
    ll sum = v[0].first;
    bool pos = true;
    while(p1 <= p2){
        if(l <= sum && sum <= u){
            break;
        }
        if(sum > u){
            if(p1 == v.size() - 1){
                pos = false;
                break;
            }
            sum -= v[p1].first;
            p1++;
        }
        else{
            if(p2 == v.size() - 1){
                pos = false;
                break;
            }
            p2++;
            sum += v[p2].first;
        }
    }
    if(!pos){
        return vector<int>();
    }
    vector<int> id;
    for(int i = p1; i <= p2; i++){
        id.push_back(v[i].second);
    }
    sort(id.begin(), id.end());
    return id;
}

컴파일 시 표준 에러 (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:24:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             if(p1 == v.size() - 1){
      |                ~~~^~~~~~~~~~~~~~~
molecules.cpp:32:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             if(p2 == v.size() - 1){
      |                ~~~^~~~~~~~~~~~~~~

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