Submission #1036551

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1036551	2024-07-27 13:48:22	kunzaZa183	Hiring (IOI09_hiring)	C++17	2 / 100	487 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
const double db = 1e-5;
const int maxn = 500001;
int orig[maxn], quality[maxn];
double seg[maxn * 4], adjusted[maxn];
int segppl[maxn * 4];
void update(int curin, int curl, int curr, int in, double val, int ppl) {
  if (in < curl || curr < in) return;
  if (curl == curr) {
    seg[curin] = val;
    segppl[curin] = ppl;
    return;
  }
  update(curin * 2 + 1, curl, (curl + curr) / 2, in, val, ppl);
  update(curin * 2 + 2, (curl + curr) / 2 + 1, curr, in, val, ppl);
  seg[curin] = seg[curin * 2 + 1] + seg[curin * 2 + 2];
  segppl[curin] = segppl[curin * 2 + 1] + segppl[curin * 2 + 2];
}
struct kun {
  int orderin, rightmost, sumprice, numofppl;
  kun() {
    orderin = 0, rightmost = -1, sumprice = 0, numofppl = 0;
  }
};
void query(int curin, int curl, int curr, double val, kun& tmp) {
  if (val >= seg[curin] - db) {
    tmp.rightmost = max(tmp.rightmost, curr);
    tmp.sumprice += seg[curin];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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