제출 #987448

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

molecules

#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define pq priority_queue
#define pl pair<ll,ll>

#include "molecules.h"

using namespace std;

constexpr int debug = 0;

vector<int> find_subset(int l, int u, vector<int> w){
    vector<int> ans;
    ll sum = 0;
    ll poc, kon;
    poc = 0, kon = -1;
    sort(w.rbegin(), w.rend());
    
    
    while(kon < w.size() || kon < 0){
        kon++;
        sum += w[kon];
        
        //cout << poc << ' ' << kon << ' ' << sum << '\n';
        
        while((sum > u) && (poc <= kon)){
            sum -= w[poc];
            poc++;
        }
        
        if((sum >= l) && (sum <= u)){
            while(poc <= kon){
                ans.pb(w[poc]);
                poc++;
            }
            return ans;
        }
    }
    
    return ans;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:24:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     while(kon < w.size() || kon < 0){
      |           ~~~~^~~~~~~~~~

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