제출 #341198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341198		YJU	Detecting Molecules (IOI16_molecules)	C++14	컴파일 에러	0 ms	0 KiB

molecules

#include<bits/stdc++.h>
#include"molecules.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e3+7;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

vector<int> find_subset(int l,int r,vector<int> w){
	vector<ll> lis;
	REP(i,SZ(w))lis.pb(i);
	sort(lis.begin(),lis.end(),[&](ll a,ll b){
		return (w[a]<w[b]);
	});
	ll sum=0,id=0,st;
	vector<ll> ans;
	REP(i,SZ(lis)){
		st=i;
		while(id<SZ(lis)&&sum<l)sum+=w[lis[id++]];
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
		sum-=w[lis[i]];
		st=i+1;
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
	}
	return vector<ll>(0);
}

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:38:11: error: could not convert 'ans' from 'vector<long long int>' to 'vector<int>'
   38 |    return ans;
      |           ^~~
      |           |
      |           vector<long long int>
molecules.cpp:44:11: error: could not convert 'ans' from 'vector<long long int>' to 'vector<int>'
   44 |    return ans;
      |           ^~~
      |           |
      |           vector<long long int>
molecules.cpp:47:9: error: could not convert 'std::vector<long long int>(0, std::allocator<long long int>())' from 'vector<long long int>' to 'vector<int>'
   47 |  return vector<ll>(0);
      |         ^~~~~~~~~~~~~
      |         |
      |         vector<long long int>