제출 #140400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
140400		MrBrionix	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	63 ms	7156 KiB

molecules

#include <cstdio>
#include <vector>
#include <cassert>
#include<bits/stdc++.h>
using namespace std;
//#include "molecules.h"
 
 
 
 
vector<int> find_subset(int l, int u, vector<int> w) {
    
    pair<long long,int> v[w.size()];
    long long L=l,U=u;
  
    for(int i=0;i<w.size();i++){
        v[i].first=w[i];
        v[i].second=i;    
    }
    
    sort(v,v+w.size());
    
    long long sx=0,dx=0,sum=v[0].first;
    vector<int> sol;
    
    while(dx!=(int(w.size())-1)){
    
        while(sum<L && (dx+1)<w.size()){
            dx++;
            sum+=v[dx].first;    
            //cout<<sx<<" "<<dx<<" "<<sum<<endl;
        }
        
        if(sum>=L && sum<=U)break;
        
        
        while(sum>U){
            sum-=v[sx].first;
            sx++;   
            //cout<<sx<<" "<<dx<<" "<<sum<<endl; 
        }
        
        if(sum>=L && sum<=U)break;       
    }
    
    
    
    if(sum>=L && sum<=U){
    for(int i=sx;i<=dx;i++){
        sol.push_back(v[i].second);    
    }
    
    return sol;
}
  
  
 
    return std::vector<int>(0);
}
/*
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}*/

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:16:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<w.size();i++){
                 ~^~~~~~~~~
molecules.cpp:28:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(sum<L && (dx+1)<w.size()){
                        ~~~~~~^~~~~~~~~

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