제출 #997382

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
997382	2024-06-12 08:20:42	Ghetto	Hiring (IOI09_hiring)	C++17	53 / 100	581 ms	65536 KiB

hiring

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ldouble = long double;
using pli = pair<ldouble, int>;
const int MAX_N = 5e5 + 5, MAX_S = 2e4 + 5;
int n, m;
int p[MAX_N], s[MAX_N];
pli a[MAX_N];
struct Node {
    int count, sum;
    Node operator+(Node other) { return {count + other.count, sum + other.sum}; };
};
Node st[4 * MAX_S];
void update(int i, int u = 1, int lo = 1, int hi = MAX_S) {
    if (i < lo || hi < i) return;
    if (lo == hi) { st[u] = {st[u].count + 1, st[u].sum + i}; return; };
    int mid = (lo + hi) / 2;
    update(i, 2 * u, lo, mid), update(i, 2 * u + 1, mid + 1, hi);
    st[u] = st[2 * u] + st[2 * u + 1];
}
Node query(int l, int r, int u = 1, int lo = 1, int hi = MAX_S) {
    if (r < lo || hi < l) return {0, 0};
    if (l <= lo && hi <= r) return st[u];
    int mid = (lo + hi) / 2;
    return query(l, r, 2 * u, lo, mid) + query(l, r, 2 * u + 1, mid + 1, hi);
}
int walk(ldouble x, int u = 1, int lo = 1, int hi = MAX_S) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 23 / 30
• Subtask 2: 12 / 28
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 0 / 6
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6