# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365555 | iliccmarko | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 364 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>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL
const int N = 2e5 + 5;
pair<int, int> a[N];
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<int> res;
int ind = 0;
for(int x : w)
{
a[ind].first = x;
a[ind].second = ind++;
}
sort(a, a+ind);
int n = ind;
int ans = 0;
for(int i = 0;i<n;i++)
{
if(a[i].first>=l&&a[i].first<=u)
{
ans = 1;
res.pb(a[i].second);
break;
}
}
if(ans) return res;
for(int i = 0;i<n-1;i++)
{
if(a[i].first+a[n-1].first>=l&&a[i].first+a[n-1].first<=u)
{
res.pb(a[i].second);
res.pb(a[n-1].second);
ans = 1;
break;
}
}
return res;
}
Compilation message (stderr)
# | 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... |