| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1300975 | yusifm | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 340 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int>find_subset(int left,int right,vector<int>nums)
{
vector<int>prefs(nums.size()+1,0),ans;
for(int i=0;i<nums.size();i++)
{
prefs[i+1]=prefs[i]+nums[i];
}
for(int i=0;i<nums.size()-1;i++)
{
for(int j=i+1;j<nums.size();j++)
{
if(prefs[j+1]-prefs[i]>=left && prefs[j+1]-prefs[i]<=right)
{
for(int k=i;k<=j;k++)
{
ans.push_back(nums[k]);
}
break;
}
}
if(ans.size()!=0)
{
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... | ||||
