제출 #1001719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1001719		vjudge1	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	33 ms	5576 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll int
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
vl find_subset(ll l, ll u, vl w) {
    vl ans;
    vector<pll>vect;
    for(ll i = 0; i < w.size(); i++)
        vect.pb({w[i], i});
    sort(all(vect));
    ll tl = 0, tr = 0, sum = 0;
    while(tl < vect.size())
    {
        while(tr < vect.size() && sum + vect[tr].f <= u)
        {
            sum += vect[tr].f;
            tr++;
        }
        if(l <= sum && sum <= u)
        {
            for(ll j = tl; j < tr; j++)
                ans.pb(vect[j].s);
            return ans;
        }
        sum -= vect[tl].f;
        tl++;
    }
    return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(ll i = 0; i < w.size(); i++)
      |                   ~~^~~~~~~~~~
molecules.cpp:24:14: 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 |     while(tl < vect.size())
      |           ~~~^~~~~~~~~~~~~
molecules.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         while(tr < vect.size() && sum + vect[tr].f <= u)
      |               ~~~^~~~~~~~~~~~~

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