# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1137271 | rayan_bd | Detecting Molecules (IOI16_molecules) | C++20 | 39 ms | 5192 KiB |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define fi first
#define se second
vector<int> find_subset(int L,int R,vector<int> w){
int n=w.size();
vector<pair<int,int>> vec(n+1);
vector<ll> pref(n+1,0);
for(int i=1;i<=n;++i){
vec[i]={w[i-1],i};
}
sort(all(vec));
for(ll i=1;i<=n;++i) pref[i]=pref[i-1]+vec[i].fi;
vector<int> ans;
for(int i=1;i<=n;++i){
int st=1,en=i;
while(st<=en){
int mid=st+(en-st)/2;
if((pref[i]-pref[mid-1])<L){
en=mid-1;
}else if((pref[i]-pref[mid-1])>R){
st=mid+1;
}else{
for(int j=mid;j<=i;++j){
ans.pb(vec[j].se-1);
}
return ans;
}
}
}
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |