| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 82857 | SecretAgent007 | Detecting Molecules (IOI16_molecules) | C++17 | 2 ms | 508 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;
vector<int> find_subset(int l, int r, vector<int> w){
int n = w.size();
vector< pair<int, int> > toS(0);
for(int i = 0; i < w.size(); i++){
toS.push_back(make_pair(w[i],i));
}
sort(toS.begin(), toS.end());
int le = 0;
int ri = 0;
long long sum = toS[0].first;
while(1){
cout << le << ' ' << ri << ' ' << sum << endl;
if(sum <= r && sum >= l){
vector<int> ans(0);
for(int i = le; i <= ri ; i++){
ans.push_back(toS[i].second);
}
sort(ans.begin(), ans.end());
return ans;
}else if(sum > r){
if(le < ri){
sum-=toS[le].first;
le++;
}else break;
}else if(sum < l){
if(ri+1 < n) sum+= toS[ri+1].first;
else break;
ri++;
}
}
vector<int> ans(0);
return ans;
}
/*
signed main(){
int a, b, c;
cin >> a >> b >> c;
vector<int> v(0);
for(int i = 0; i < a; i++){
int d;
cin >> d;
v.push_back(d);
}
v = find_subset(b,c,v);
cout << v.size() << endl;
for(int i = 0; i < v.size(); i++){
cout << v[i] << ' ';
}
cout << endl;
}
*/
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... | ||||
