# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063024 | nvujica | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
#define ll long long
using namespace std;
const int maxn = 1e4 + 10;
int n;
ll pref[maxn];
ll suf[maxn];
vector<int> find_subset(int l, int u, vector<int> w) {
n = w.size();
sort(w.begin(), w.end());
pref[0] = w[0];
suf[n - 1] = w[n - 1];
for(int i = 1; i < n; i++){
pref[i] = pref[i - 1] + w[i];
}
for(int i = n - 2; i >= 0; i--){
suf[i] = suf[i + 1] + w[i];
}
vector <int> v;
# | 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... |