Submission #1098978

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098978		crafticat	Boarding Passes (BOI22_passes)	C++17	30 / 100	2077 ms	6668 KiB

passes

#include <bits/stdc++.h>

#include <utility>

using ll = long long;
using namespace std;
#define F0R(i, n) for (ll i= 0; i < n;i++)
template<typename T>
using V = vector<T>;
using vi = V<ll>;
using vvi = V<vi>;
#define pb push_back
using pi = pair<ll, ll>;
#define all(x) begin(x), end(x)
#define f first
#define s second

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template <class T>
using Tree =
        tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

double add(vi x, Tree<int> &points) {
    long double expected = 0;

    F0R(i, x.size()) {
        int orgLEF = points.order_of_key(x[i]);
        int orgRIG = points.size() - orgLEF;
        double lef = orgLEF + (i / 2.0);
        double rig = orgRIG + (x.size() - i - 1) / 2.0;

        expected += min(lef, rig);
    }
    F0R(i, x.size()) {
        points.insert(x[i]);
    }

    return expected;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    string str; cin >> str;
    set<int> ind;
    vvi groups(26);
    F0R(i, str.size()) {
        int id = str[i] - 'A';
        groups[id].pb(i);
        ind.insert(id);
    }

    vi perm;
    for (auto x : ind)
        perm.pb(x);

    double ans = 1e18;
    do {
        Tree<int> points;
        double expected = 0;
        for (auto x : perm) {
            expected += add(groups[x], points);
        }
        ans = min(ans, expected);
    } while (std::next_permutation(all(perm)));

    cout << fixed << ans;
    return 0;
}

Compilation message (stderr)

passes.cpp: In function 'double add(vi, Tree<int>&)':
passes.cpp:7:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define F0R(i, n) for (ll i= 0; i < n;i++)
......
   28 |     F0R(i, x.size()) {
      |         ~~~~~~~~~~~                
passes.cpp:28:5: note: in expansion of macro 'F0R'
   28 |     F0R(i, x.size()) {
      |     ^~~
passes.cpp:7:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define F0R(i, n) for (ll i= 0; i < n;i++)
......
   36 |     F0R(i, x.size()) {
      |         ~~~~~~~~~~~                
passes.cpp:36:5: note: in expansion of macro 'F0R'
   36 |     F0R(i, x.size()) {
      |     ^~~
passes.cpp: In function 'int main()':
passes.cpp:7:35: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define F0R(i, n) for (ll i= 0; i < n;i++)
......
   49 |     F0R(i, str.size()) {
      |         ~~~~~~~~~~~~~              
passes.cpp:49:5: note: in expansion of macro 'F0R'
   49 |     F0R(i, str.size()) {
      |     ^~~

• Subtask 1: 5 / 5
• Subtask 2: 25 / 25
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40