# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063445 | nvujica | Detecting Molecules (IOI16_molecules) | C++14 | 24 ms | 6368 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
#define fi first
#define se second
using namespace std;
const int maxn = 1e4 + 10;
int n;
ll pref[maxn];
ll suf[maxn];
vector <pair<int, int> > w2;
vector<int> find_subset(int l, int u, vector<int> w) {
n = w.size();
for(int i = 0; i < n; i++){
w2.push_back({w[i], i});
}
sort(w2.begin(), w2.end());
pref[0] = w2[0].fi;
suf[n - 1] = w2[n - 1].fi;
for(int i = 1; i < n; i++){
pref[i] = pref[i - 1] + w2[i].fi;
}
# | 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... |