# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872507 | Zero | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 600 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>
#define ll long long
#include "molecules.h"
#define pb push_back
using namespace std;
vector<int> find_subset(int l, int u, vector<int> a){
ll n = a.size();
vector<int> v;
ll s = 0;
for(ll i=0; i < n; i ++){
if(a[i]>=l && a[i] <= u){
v.pb(i);
return v;
}
}
bool jj = true;
s = a[0];
ll i = 0, j = 0;
while(j < n){
if(s >= l && s <= u){
v.pb(i);v.pb(j);
break;
}
if(s < l) j ++, s += a[j];
else s -= a[i], i ++;
}
return v;
}
// signed main(){
// int l,u; cin >> l >> u;
// vector<int> a(4);
// for(auto &i : a) cin >> i;
// vector<int> y = find_subset(l,u,a);
// for(auto i : y) cout << i << " ";
// return 0;
// }
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... |