# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162358 | tsengang | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
const int mod = 998244353;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
vector<int>find_subset(int l, int u, vector<int>w){
int n = w.size();
vector<pair<int,int>>p(n);
for(int i = 0 ; i < n; i++){
p[i].ss = i;
p[i].ff = w[i];
}
sort(all(p));
ll cur = 0;
vector<int> ans;
ll j = 0;
while(j < n and cur + p[j].ff <= u){
cur+=p[j].ff;
j++;
}
if(j == 0)ertunt ans;
if(cur >= l){
for(int i = 0 ; i < j; i++)ans.pb(p[i].ss);
ertunt ans;
}
int lst = n-1;
int i = 0;
while(lst >= j){
if(cur >= l)break;
cur+= p[lst].ff - p[i].ff;
ans.pb(p[lst].ss);
i++;
lst--;
}
if(cur >= l){
for(; i < j; i++)ans.pb(p[i].ss);
ertunt ans;
}
else{
vector<int>c;
ertunt c;
}
}
Compilation message (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... |