# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164585 | Aza | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
//AzaLE (Azamat Alisherov)
#include <bits/stdc++.h>
#include "molecules.h"
#define F first
#define S second
#define size(x) (int)x.size()
#define all(x) x.begin(),x.end()
using namespace std;
vector <int> find_subset(int x, int y, vector<int> v){
int n = size(v);
vector <pair<int, int>> g;
for(int i = 0; i < n; i++)g.push_back({v[i], i});
int sum = 0;
vector <int> ans;
for(int l = 0, r = 0; r < n; r++){
sum += g[r].F;
while(sum > y){sum -= g[l].F; l++;}
if(sum >= x){
for(int j = l; j <= r; j++)ans.push_back(g[j].S);
break;
}
}
return ans;
}
/*
*/
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... |