#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define F first
#define S second
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define maxp 22
#define EPS (ld)(1e-18)
#define mod (int)(1e9+7)
#define N (int)(1e5+1)
vector<int> find_subset(int l, int r, vector<int> arr) {
int n=arr.size();
int i;
int num=arr[0];
int low = l/num;
if(l%num)
low++;
if(low>n)
return vector<int>(0);
vector<int> ans;
for(i=0;i<low;i++)
ans.push_back(i);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
5 ms |
256 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [302..304] but it is 351 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
5 ms |
256 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
5 ms |
256 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
5 ms |
256 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = NO) |
2 |
Incorrect |
5 ms |
256 KB |
sum of weights should be in [10..12] but it is 13 |
3 |
Halted |
0 ms |
0 KB |
- |