제출 #122292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122292		turbat	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	2 ms	384 KiB

molecules

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


vector<int> find_subset(int l, int u, vector<int> w) {
    vector <int> ans;
    vector <pair <int, int> > v;
    for (int i = 0;i < w.size();i++)
    	v.push_back({w[i], i});
    sort(v.begin(), v.end());
    int s = 0, curr = 0;
    for (int i = 0;i < v.size();i++){
    	while (curr < v.size() && s + v[curr].first <= l)
    		s += v[curr++].first;
    	if (s >= l && s <= u){
    		for (int j = i;j < curr;j++)
    			ans.push_back(v[j].second);
    		return ans;
    	}
    	s -= v[curr].first;
    }
    return vector<int>(0);
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0;i < w.size();i++)
                    ~~^~~~~~~~~~
molecules.cpp:13:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0;i < v.size();i++){
                    ~~^~~~~~~~~~
molecules.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      while (curr < v.size() && s + v[curr].first <= l)
             ~~~~~^~~~~~~~~~

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