# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1191691 | simona1230 | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
int p[500001];
int n;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
n=w.size();
p[0]=w[0];
for(int i=1;i<n;i++)
p[i]=p[i-1]+w[i];
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
int s=p[j]-p[i]+w[i];
if(s>=l&&s<=u)
{
vector<int> ans;
for(int x=i;x<=j;x++)
ans.push_back(x);
return ans;
}
}
}
return {};
}
컴파일 시 표준 에러 (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... |