| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1282737 | enzy | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 428 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int r, vector<int> w){
int sum=0, at=0, qtd=0, tam=w.size();
vector<int>v;
for(int a : w) v.push_back(a);
for(int a : w) v.push_back(a);
for(int i=0;i<v.size();i++){
sum+=v[i];
qtd++;
while(sum>r||qtd>tam){
sum-=v[at];
at++;
qtd--;
}
if(l<=sum&&sum<=r){
vector<int>resp;
for(int j=at;j<=i;j++) resp.push_back(j%tam);
return resp;
}
}
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... | ||||
