# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1151267 | vyaduct | Detecting Molecules (IOI16_molecules) | C++20 | 49 ms | 4424 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define pb push_back
#define ll long long
vt<int> find_subset(int l, int u, vt<int> w) {
int n = sz(w);
vt<int> ind(n);
for (int i=0;i<n;i++) ind[i] = i;
sort(all(ind), [&](int x, int y){
return w[x] < w[y];
});
sort(all(w));
vt<ll> pref(n+1, 0);
for (int i=0;i<n;i++) pref[i+1] = pref[i] + w[i];
vt<int> curr;
for (int i=0;i<n;i++){
int lb=i, rb=n-1;
lb--;
while(lb<rb){
int mb = lb + (rb-lb+1)/2;
if (pref[mb+1] - pref[i] <= u){
lb = mb;
} else {
rb = mb-1;
}
}
if (lb == i-1) continue;
if (pref[lb+1]-pref[i] >= l){
for (int iter=i;iter<=lb;iter++){
curr.pb(ind[iter]);
}
return curr;
}
}
return vt<int>(0);
}
컴파일 시 표준 에러 (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... |