제출 #1023716

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

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define pi pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define show(x); cerr << #x << " is " << x << nl;
#define show2(x,y); cerr << #x << " is " << x << " " << #y << " is " << y << nl;
#define show3(x,y,z); cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << nl;
#define showall(x); cerr << #x << " is "; for (auto i : x) {cerr << i << " ";} cerr << nl;

vector<int> find_subset(int l, int u, vector<int> w){
	ll n = w.size();
	vector<pi> num(n, mp(0, 0));
	for (ll i=0; i<w.size(); i++) num[i] = mp(w[i], i);
	sort(num.begin(), num.end());
	ll sum = 0, start = 0;
	while(start<n && sum<l){
		sum += num[start].ff;
		start++;
	}
	if (start==1) return {num[0].ss};
	else if (sum<l) return {};
	ll front=-1, back=-1;
	if(sum>=l && sum<=u){
		front = 0;
		back = start-1;
	}
	else{
		ll size = start-1; // 0 to start-2
		sum -= num[start-1].ff;
		for (ll i=start-1; i<n; i++){
			sum -= num[i-size].ff;
			sum += num[i].ff;
			if(sum>=l && sum<=u){
				front = i-size+1;
				back = i;
				break;
			}
		}
	}
	vector<int> v;
	if(front==-1 && back==-1) return v;
	for (ll i=front; i<=back; i++){
		v.push_back(num[i].ss);
	}
	return v;
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:17:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for (ll i=0; i<w.size(); i++) num[i] = mp(w[i], i);
      |               ~^~~~~~~~~

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