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