#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();
bool check=1;
for(int i=1;i<n;i++){
if(w[i]!=w[i-1]){
check=0;
break;
}
}
if(check){
int val=w[0];
if(val*n<l)return vector<int>(0);
else {
vector<int>res;
for(int i=0;i<(l+val-1)/val;i++){
res.push_back(i);
}
return res;
}
}
return vector<int>(0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |