제출 #996658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996658		berWoW	무제 (POI11_rot)	C++14	63 / 100	286 ms	65536 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // namespace __gnu_pbds
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;

typedef __gnu_pbds::tree<
int,
__gnu_pbds::null_type,
less<int>,
__gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>
ordered_set;

#define MAX_N 212345

int n, cnt;
int inv[MAX_N];
ordered_set trunks[MAX_N];

//void read_trunk(int u) {
//    int p;
//    scanf("%d", &p);
//
//   if (p != 0) { trunks[u].insert(p); return; }
//
//    read_trunk(2 * u), read_trunk(2 * u + 1);
//}

int count_inv() {
    int p;
    scanf("%d", &p);
    if (p != 0) { trunks[p].insert(p); return p; }

    int l = count_inv(), r = count_inv();

    if (trunks[l].size() < trunks[r].size()) trunks[l].swap(trunks[r]);

    int inv_l_r = 0, inv_r_l = 0, i = 0;

    for (auto it = trunks[r].begin(); it != trunks[r].end(); it++) {
        trunks[l].insert(*it);
        int pos = trunks[l].order_of_key(*it);
        inv_l_r += trunks[l].size() - pos - 1;
        inv_r_l += pos - i++;
    }

    inv[l] = inv[l] + inv[r] + min(inv_l_r, inv_r_l);

    return l;
}

int main() {
    scanf("%d", &n);
    //read_trunk(1);
    printf("%d\n", inv[count_inv()]);
}

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

rot.cpp: In function 'int count_inv()':
rot.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |     scanf("%d", &p);
      |     ~~~~~^~~~~~~~~~
rot.cpp: In function 'int main()':
rot.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~

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