제출 #557039

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

molecules

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

vector<int> find_subset(int l, int u, vector<int> W) {
    vector<long long> w;
    for (auto it : W) w.push_back(it);
    long long now = w[0];
    int pl=0, pr=0;
    while (pl < w.size() && pr < w.size() && (now < l || now > u)) {
        if (now < l) {
            if (pr+1 < w.size()) now += w[++pr];
            else break;
        }
        if (now > u) {
            if (pl < w.size()) now -= w[pl++];
            else break;
        }
    }
    vector<int> ret;
    if (l <= now && now <= u) {
        for (int i=pl; i<=pr; i++) ret.push_back(i);
    }
    return ret;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     while (pl < w.size() && pr < w.size() && (now < l || now > u)) {
      |            ~~~^~~~~~~~~~
molecules.cpp:10:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     while (pl < w.size() && pr < w.size() && (now < l || now > u)) {
      |                             ~~~^~~~~~~~~~
molecules.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |             if (pr+1 < w.size()) now += w[++pr];
      |                 ~~~~~^~~~~~~~~~
molecules.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |             if (pl < w.size()) now -= w[pl++];
      |                 ~~~^~~~~~~~~~

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