oj.uz

Submission #961724

# Submission time Handle Problem Language Result Execution time Memory
961724 2024-04-12T11:13:44 Z ErJ Detecting Molecules (IOI16_molecules) C++17
19 / 100
 1 ms 544 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> w1) {
    ll n = w1.size();
    vp w(n);
    rep(i, n) {
        w[i] = { w1[i], i };
    }
    sort(w.begin(), w.end());
    vi pref(n), suff(n);
    pref[0] = w[0].first;
    suff[0] = w[n - 1].first;
    rep(i, n - 1) {
        pref[i + 1] = pref[i] + w[i + 1].first;
        suff[i + 1] = suff[i] + w[n - i - 2].first;
    }
    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(w[*it].second);
                    it++;
                }
            }
            else {
                for (int j = i; j >= 0; j--) {
                    akt -= w[j].first;
                    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].first > hledam) {
                            right = mid;
                        }
                        else {
                            left = mid;
                        }
                    }
                    akt += w[left].first;
                    ans.insert(left);
                    if (l <= akt && akt <= r) {
                        auto it = ans.begin();
                        for (ll j = 0; j < ans.size(); j++) {
                            result.push_back(w[*it].second);
                            it++;
                        }
                        break;
                    }
                }
            }
            break;
        }
    }
    return result;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:37:34: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |                 for (ll j = 0; j < ans.size(); j++) {
      |                                ~~^~~~~~~~~~~~
molecules.cpp:62:42: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |                         for (ll j = 0; j < ans.size(); j++) {
      |                                        ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 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 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 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)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB OK (n = 12, answer = YES)
2 Correct 0 ms 348 KB OK (n = 12, answer = YES)
3 Correct 1 ms 348 KB OK (n = 12, answer = NO)
4 Correct 0 ms 344 KB OK (n = 12, answer = NO)
5 Correct 1 ms 348 KB OK (n = 12, answer = YES)
6 Correct 0 ms 348 KB OK (n = 12, answer = YES)
7 Correct 0 ms 440 KB OK (n = 12, answer = YES)
8 Correct 0 ms 344 KB OK (n = 12, answer = YES)
9 Correct 0 ms 348 KB OK (n = 6, answer = YES)
10 Correct 0 ms 348 KB OK (n = 12, answer = YES)
11 Correct 0 ms 344 KB OK (n = 100, answer = NO)
12 Correct 0 ms 348 KB OK (n = 100, answer = YES)
13 Correct 0 ms 348 KB OK (n = 100, answer = NO)
14 Correct 0 ms 344 KB OK (n = 100, answer = YES)
15 Correct 0 ms 432 KB OK (n = 100, answer = YES)
16 Correct 1 ms 544 KB OK (n = 100, answer = YES)
17 Correct 1 ms 348 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 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 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 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 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 344 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 KB OK (n = 12, answer = YES)
27 Correct 0 ms 344 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 344 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 344 KB OK (n = 100, answer = YES)
34 Correct 0 ms 432 KB OK (n = 100, answer = YES)
35 Correct 1 ms 544 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 344 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Incorrect 1 ms 348 KB sum of weights should be in [990..1000] but it is 818
44 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 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 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 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 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 344 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 KB OK (n = 12, answer = YES)
27 Correct 0 ms 344 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 344 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 344 KB OK (n = 100, answer = YES)
34 Correct 0 ms 432 KB OK (n = 100, answer = YES)
35 Correct 1 ms 544 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 344 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Incorrect 1 ms 348 KB sum of weights should be in [990..1000] but it is 818
44 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 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 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 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 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 344 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 KB OK (n = 12, answer = YES)
27 Correct 0 ms 344 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 344 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 344 KB OK (n = 100, answer = YES)
34 Correct 0 ms 432 KB OK (n = 100, answer = YES)
35 Correct 1 ms 544 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 344 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Incorrect 1 ms 348 KB sum of weights should be in [990..1000] but it is 818
44 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 344 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 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 344 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 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 Correct 0 ms 348 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 1 ms 348 KB OK (n = 12, answer = NO)
23 Correct 0 ms 344 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 0 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 440 KB OK (n = 12, answer = YES)
27 Correct 0 ms 344 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 0 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 344 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 344 KB OK (n = 100, answer = YES)
34 Correct 0 ms 432 KB OK (n = 100, answer = YES)
35 Correct 1 ms 544 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 344 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 0 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Incorrect 1 ms 348 KB sum of weights should be in [990..1000] but it is 818
44 Halted 0 ms 0 KB -