# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1248918 | avohado | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4132 KiB |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define maxn 200005
#define f first
#define s second
#define ll long long
#define pb(x) push_back(x)
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(make_pair(w[i], i));
}
sort(v.begin(), v.end());
long long s1=0, r=0;
for(int i=0; i<w.size(); i++){
while(r<w.size()&&s1<l){
s1+=v[r].f;r++;
}
if(s1<l)break;
if(s1<=u){
for(int j=i; j<r; j++){
ans.push_back(v[j].s);
}
sort(ans.begin(), ans.end());
return ans;
}
s1-=v[i].f;
}
return{};
}
컴파일 시 표준 에러 (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... |