제출 #1309851

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1309851		shirokito	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	2 ms	348 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

#define all(a) (a).begin(), (a).end()

using ll = long long;

const int N = 5e5 + 5;

mt19937 rng(363636);

pair<int, int> v[N];

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();

    for (int i = 0; i < n; i++) {
        v[i] = {w[i], i};
    }

    sort(v, v + n);

    if (v[0].first >= l && v[0].first <= u) {
        return vector<int> {0};
    }

    if (v[n - 1].first >= l && v[n - 1].first <= u) {
        return vector<int> {n - 1};
    }

    if (v[0].first > u) {
        return vector<int> {};
    }

    int B = (n <= 2000 ? n : sqrtl(n));

    for (int _ = 0; _ <= 100; _++) {
        for (int L = 0; L < n; L += B) {
            int R = min(n - 1, L + B - 1);
            shuffle(v + L, v + R + 1, rng);
        }

        vector<int> ans;
        ll cur = 0;

        for (int i = 0; i < n; i++) {
            cur += v[i].first;
            ans.push_back(v[i].second);

            if (cur >= l && cur <= u) {
                return ans;
            }
        }   
    }

    return vector<int> {};
}

#ifdef LOCAL

void solve() {
    int n, l, u; cin >> n >> l >> u;
    vector<int> w(n); for (int &x: w) cin >> x;

    auto ans = find_subset(l, u, w);

    for (int x: ans) cout << x << ' ';
    cout << '\n';
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);

    int T = 1; // cin >> T;
    while (T--) {
        solve();
    }
}

#endif

컴파일 시 표준 에러 (stderr) 메시지

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31