# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1169651 | nathlol2 | Detecting Molecules (IOI16_molecules) | C++20 | 33 ms | 3656 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> g(n);
for(int i = 0;i<n;i++){
g[i] = {w[i], i};
}
long long int s = 0;
sort(g.begin(), g.end());
vector<int> ans;
for(int i = 0, j = 0;i<n;i++){
s += g[i].F;
while(s > u){
s -= g[j].F;
j++;
}
if(s >= l){
for(int a = j;a<=i;a++){
ans.push_back(g[a].S);
}
break;
}
}
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... |