| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354611 | takoshanava | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
#define pb push_back
#define fs first
#define sc second
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> p;
for(int i = 0; i < w.size(); i++) p.pb({w[i], i});
sort(p.begin(),p.end());
int n = w.size();
long long sum = 0;
int l1 = 0, r = 0;
while(true){
if(sum >= l and sum <= u) break;
if(sum < l){
if(r == n) break;
sum += p[r].fs;
r++;
}else{
sum -= p[l1].fs;
l1++;
}
}
vector<int> ans;
if(!(sum >= l and sum <= u)) ans;
for(int i = l1; i <= r; i++) ans.pb(p[i].sc);
return ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
