Submission #1280109

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280109		cnastea	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	37 ms	4784 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second

vector<int> find_subset(int l, int r, vector<int> w){
    int n = w.size(); vector<int> x;
    vector<pair<int, int>> a(n); for(int i = 0; i < n; i++) a[i] = {w[i], i};
    sort(a.begin(), a.end());
    long long p = a[0].f, q = 0, c = 0, k;
    for(int i = 1; i < n; i++){
        if(p > r && q < l) {c = 1; break;}
        p += a[i].f; q += a[n-i].f;
    }
    if(p < l) c = 1;
    if(c) return x;
    set<int> s; p = 0; q = n-1;
    for(int i = 0; i < n; i++){
        p += a[i].f; if(p > r) {p -= a[i].f; break;}
        s.insert(i);
    }
    if(p >= l) {
        int m = s.size();
        for(int i = 0; i < m; i++) {x.push_back(a[*s.begin()].s); s.erase(s.begin());}
        return x;
    }
    for(int i = 0; i < n; i++){
        if(!s.size() || q < 0) break;
        p -= a[*s.begin()].f;
        s.erase(s.begin()); s.insert(q);
        p += a[q].f; q--;
        if(p >= l) break;
    }
    int m = s.size();
    for(int i = 0; i < m; i++) {x.push_back(a[*s.begin()].s); s.erase(s.begin());}
    return x;
}

Compilation message (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: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31