Submission #425847

#TimeUsernameProblemLanguageResultExecution timeMemory
425847vincentpikachu20Detecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms204 KiB
#include "molecules.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<signed> find_subset(signed l, signed u, vector<signed> w) {
    int n = w.size();
    u = min(u,accumulate(w.begin(), w.end(), 0));
    sort(w.begin(), w.end());
    int k = (l+w[0]-1)/w[0];
    if(k > n || k*w[0] > u) return vector<signed>();
    else return vector<signed>(k,w[0]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...