Submission #1020361

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020361		adaawf	Untitled (POI11_rot)	C++17	36 / 100	1077 ms	65536 KiB

Main

#include <iostream>
#include <vector>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int c = 1, a[400005];
vector<int> g[400005];
ordered_set s[400005];
void trya() {
    int h = c, k;
    cin >> k;
    if (k == 0) {
        c++;
        int k = c, l;
        trya();
        c++;
        l = c;
        trya();
        g[h].push_back(k);
        g[h].push_back(l);
    }
    else a[h] = k;
}
long long int dfs(int x) {
    if (g[x].size() == 0) {
        s[x].insert(a[x]);
        return 0;
    }
    long long int res = 0, c = 0, h = 1;
    for (int w : g[x]) {
        c += dfs(w);
        h *= s[w].size();
        int flag = 0;
        if (s[w].size() > s[x].size()) {
            swap(s[w], s[x]);
            flag = 1;
        }
        for (int v : s[w]) {
            if (flag == 1) {
                res += s[x].order_of_key(v);
                //cout << 123 << " " << x << " " << s[x].order_of_key(v) << " " << res << endl;
            }
            else {
                res += s[x].size() - s[x].order_of_key(v);
                //cout << 123 << " " << x << " " << s[x].order_of_key(v) << " " << res << endl;
            }
        }
        for (int v : s[w]) {
            s[x].insert(v);
        }
    }
    /*cout << x << " " << min(res, h - res) + c << endl;
    for (int w : s[x]) {
        cout << w << " ";
    }
    cout << endl;*/
    return min(res, h - res) + c;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    trya();
    cout << dfs(1);
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10