# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600225 | Fidan | Detecting Molecules (IOI16_molecules) | C++17 | 1087 ms | 4416 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
vector<int> find_subset(int l, int u, vector<int> w1) {
vector<ll> cvb;
ll n=w1.size(), i, j, c1=-1, c2=-1;
vector<pair<ll, ll>> w;
w.push_back({0, 0});
for(i=0; i<n; i++){
w.push_back({w1[i], i+1});
}
sort(w.begin(), w.end());
vector<ll> v(n+1, 0);
for(i=1; i<=n; i++){
v[i]=v[i-1]+w[i].first;
}
for(i=0; i<n; i++){
for(j=1; j<=n; j++){
if(v[j]-v[i]>=l && v[j]-v[i]<=u){
c1=i+1, c2=j;
}
}
# | 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... |