# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963825 | 2024-04-15T18:49:13 Z | marinaluca | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 356 KB |
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> /**#pragma GCC optimize ("O4") #pragma GCC optimize ("fast-math") #pragma GCC optimize ("unroll-loops") **/ using namespace std; #include "molecules.h" /** #define ll long long #define XX first #define YY second #define pb push_back #define sz (x) int(x.size()) #define pf pop_front #define pob pop_back #define pff push_front **/ /*_____________defines---------------*/ /** typedef dl double; typedef ldb long double; typedef vii vector <int>; typedef pid pair <double, double>; typedef pii pair <int, int>; typedef ull unsigned long long; **/ vector <int> find_subset (const int l, const int u, const vector <int> w){ vector < pair <long long, long long>> ans; vector <int> v; for (long long i = 0; i < w.size(); ++ i){ ans.push_back({w[i], i}); } sort (ans.begin(), ans.end()); for (long long i = 0, sum = 0, cnt = 0; i < w.size(); ++ i){ sum += ans[i].first; while (sum > u){ sum -= ans[i].first; ++ cnt; } if (sum >= l){ for (long long idx = cnt; idx <= i; ++ idx){ v.push_back(ans[idx].second); } break; } } return v; } /** signed main(void){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); return 0 ^ 0; } **/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 356 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 344 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 356 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 344 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 0 ms | 344 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 356 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 344 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 0 ms | 344 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 356 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 344 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 0 ms | 344 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 348 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 348 KB | OK (n = 2, answer = YES) |
6 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 356 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 344 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 0 ms | 344 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |