| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344213 | sdan | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 4124 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
const int N = 1e4+1;
vector<int> find_subset(int l, int r, vector<int> w) {
int n = w.size(); vector<pair<int, int>> a;
for(int i = 0; i < n; ++i) a.pb({w[i], i});
sort(a.begin(), a.end());
long long sum = 0, u = 0, v = 0;
while(v < n && sum + a[v].f <= r)
sum += a[v++].f;
while(v < n && sum < l)
sum += a[v++].f,
sum -= a[u++].f;
if(sum < l || sum > r) return {};
vector<int> s;
for(int i = u; i < v; ++i) s.pb(a[i].s);
return s;
}| # | 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... | ||||
