# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396322 | iulia13 | Detecting Molecules (IOI16_molecules) | C++14 | 45 ms | 6748 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 <iostream>
#include <algorithm>
#include "molecules.h"
#include <vector>
using namespace std;
#define ll long long
const int nmax = 2e5 + 5;
struct ura{
ll x;
int ind;
};
ura v[nmax];
bool cmp(ura a, ura b)
{
if (a.x > b.x)
return false;
return true;
}
vector <int> ans;
vector <int> find_subset(int l, int r, vector <int> a)
{
int n = a.size(), i, j;
for (i = 1; i <= n; i++)
{
v[i].x = a[i - 1];
v[i].ind = i - 1;
}
sort(v + 1, v + n + 1, cmp);
for (i = 1; i <= n; i++)
v[i].x += v[i - 1].x;
# | 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... |