# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961712 | 2024-04-12T11:00:30 Z | ErJ | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 600 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define vi vector<ll> #define pp pair<ll, ll> #define inf 1000000000000000; #define vvi vector<vi> #define vp vector<pp> #define rep(i, n) for(int i = 0; i < n; i++) #define mod 1000000007 vector<int> result; vector<int> find_subset(int l, int r, vector<int> w) { sort(w.begin(), w.end()); ll n = w.size(); vi pref(n), suff(n); pref[0] = w[0]; suff[0] = w[n - 1]; rep(i, n - 1) { pref[i + 1] = pref[i] + w[i + 1]; suff[i + 1] = suff[i] + w[n - i - 2]; } set<ll> ans; result.clear(); rep(i, n) { ans.insert(i); if (pref[i] <= r && suff[i] >= l) { result.clear(); ll akt = pref[i]; if (pref[i] >= l) { auto it = ans.begin(); for (ll j = 0; j < ans.size(); j++) { result.push_back(*it); it++; } } else { for (int j = i; j >= 0; j--) { akt -= w[j]; ans.erase(j); ll left = i; ll right = n - (i - j); ll hledam = r - akt; while (right > left + 1) { ll mid = (right + left) / 2; if (w[mid] > hledam) { right = mid; } else { left = mid; } } akt += w[left]; ans.insert(left); if (l <= akt && akt <= r) { auto it = ans.begin(); for (ll j = 0; j < ans.size(); j++) { result.push_back(*it); it++; } } } } break; } } return result; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | OK (n = 1, answer = NO) |
2 | Correct | 1 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 344 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 ms | 344 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 | 432 KB | OK (n = 3, answer = YES) |
8 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 348 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 432 KB | Integer 29 violates the range [0, 12] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | OK (n = 1, answer = NO) |
2 | Correct | 1 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 344 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 ms | 344 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 | 432 KB | OK (n = 3, answer = YES) |
8 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 432 KB | Integer 29 violates the range [0, 12] |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | OK (n = 1, answer = NO) |
2 | Correct | 1 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 344 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 ms | 344 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 | 432 KB | OK (n = 3, answer = YES) |
8 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 432 KB | Integer 29 violates the range [0, 12] |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | OK (n = 1, answer = NO) |
2 | Correct | 1 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 344 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 ms | 344 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 | 432 KB | OK (n = 3, answer = YES) |
8 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 432 KB | Integer 29 violates the range [0, 12] |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 600 KB | OK (n = 1, answer = NO) |
2 | Correct | 1 ms | 348 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 344 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 ms | 344 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 | 432 KB | OK (n = 3, answer = YES) |
8 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
12 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 344 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 348 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 348 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 348 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 348 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 348 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 348 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 432 KB | Integer 29 violates the range [0, 12] |
21 | Halted | 0 ms | 0 KB | - |