제출 #83416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83416		Tusk	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	84 ms	31536 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

vector<pii> V;
vector<int> ans;

vector<int> find_subset(int l, int u, vector<int> w) {
	for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
	sort(V.begin(), V.end());
	int L = 0, R = 0;
	long long sum = 0;
	while(L < w.size()) {
		while(R < w.size() && sum < l) sum += (long long)V[R++].x;
		if(l <= sum && sum <= u) {
			for(int i = L; i < R; i++) ans.emplace_back(V[i].y);
			return ans;
		}
		sum -= (long long)V[L++].x;
	}
	return {};
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
                 ~~^~~~~~~~~~
molecules.cpp:18:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(L < w.size()) {
        ~~^~~~~~~~~~
molecules.cpp:19:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(R < w.size() && sum < l) sum += (long long)V[R++].x;
         ~~^~~~~~~~~~

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