oj.uz

Submission #985053

# Submission time Handle Problem Language Result Execution time Memory
985053 2024-05-17T10:05:36 Z normankr07 Detecting Molecules (IOI16_molecules) C++17
0 / 100
 1 ms 348 KB 
#define taskname ""
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifndef LOCAL
#define cerr \
    if (0)   \
    cerr
#endif

const bool multitest = 0;

int n, l, u;
vector<int> w;

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
    for (int i = 1; i <= w.size(); i++)
    {
        if (l <= w[i - 1] && w[i - 1] <= u)
        {
            return vector<int>(i);
        }
    }
    vector<pair<int, int>> ww;
    for (int i = 1; i <= n; i++)
    {
        ww.push_back(make_pair(w[i - 1], i));
    }
    sort(ww.begin(), ww.end());
    ll sum = 0;
    while (ww.size() && ww.back().first > l)
    {
        ww.pop_back();
    }
    vector<int> idans;
    while (sum < l)
    {
        if (sum > u)
            break;
        sum += ww.back().first;
        idans.push_back(ww.back().second);
        ww.pop_back();
    }
    if (sum >= l && sum <= u)
    {
        sort(idans.begin(), idans.end());
        return idans;
    }
    while (sum > u)
    {
        sum -= w[idans.back() - 1];
        idans.pop_back();
    }
    int i = 0;
    while (sum < l)
    {
        sum += ww[i].first;
        idans.push_back(ww[i].second);
        i++;
    }
    if (sum < l || sum > u)
        return vector<int>();
    sort(idans.begin(), idans.end());
    return idans;
}

/*
void solve()
{
    cin >> n >> l >> u;
    w.assign(n, 0);
    for (auto &v : w)
        cin >> v;
    auto ans = find_subset(l, u, w);
    for (auto v : ans)
    {
        cout << v << ' ';
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
        freopen(taskname ".out", "w", stdout);
    }
    int tc = 1;
    if (multitest)
        cin >> tc;
    while (tc--)
    {
        solve();
        cout << '\n';
    }
}
*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int i = 1; i <= w.size(); i++)
      |                     ~~^~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -