| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1323197 | jahinahnaf | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
vector<int> ans;
int n = w.size();
vector<pair<int, int>> prefixSum(n);
for (int x = 0; auto &y : prefixSum)
{
y.first = x;
x++;
}
prefixSum[0].second = w[0];
for (int i = 1; i < n; i++)
{
prefixSum[i].second = w[i] + prefixSum[i - 1].second;
}
for (int i = 0; i < n; i++)
{
ans.push_back(prefixSum[i].second);
}
bool paisi = false;
int start = 0, end = 0;
for (int i = 0; i < n; i++)
{
if (i == 0)
{
if (prefixSum[i].second >= min(l, u) && prefixSum[i].second <= max(l, u))
{
paisi = true;
start = 0, end = i;
}
}
else
{
for (int j = i; j < n; j++)
{
if (prefixSum[j].second - prefixSum[i].second >= min(l, u) && prefixSum[j].second - prefixSum[i].second <= max(l, u))
{
paisi = true;
start = i + 1, end = j;
}
}
}
}
for (int i = start; i <= end; i++)
{
ans.push_back(i);
}
if (ans.size() > 0)
{
return ans;
}
return std::vector<int>(0);
}
컴파일 시 표준 에러 (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... | ||||
