# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173457 | kadir | Detecting Molecules (IOI16_molecules) | C++20 | 1099 ms | 320 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
#define ll long long
#define ss second
#define ff first
#define pb push_back
const ll mxn=1e6+5;
const ll mod=998244353;
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w) {
int n=w.size();
sort(w.begin(),w.end());
vector<int> v;
int sum=0,idx=0,k=0;
while(true) {
for(int i=idx; i<n; i++) {
sum+=w[i];
v.pb(w[i]);
if(sum>u) {
sum-=w[i]; idx=i-1; v.pop_back();
if(sum<l) {
sum=0; idx=k+1; k++; v.clear();
}
}
if(sum>l&&sum<u) {
sum=0; break;
}
}
}
return v;
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... |