Submission #1165531

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1165531	2025-03-12 02:49:04	HappyCapybara	Robots (IOI13_robots)	C++20	100 / 100	797 ms	57136 KiB

robots

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 "robots.h"
#include<bits/stdc++.h>
using namespace std;
int t;
vector<pair<int,int>> st;
void update(int pos, int val, int node=1, int tl=0, int tr=t-1){
    if (tl == tr){
        st[node] = {val, 1};
        return;
    }
    int tm = (tl+tr)/2;
    if (pos <= tm) update(pos, val, node*2, tl, tm);
    else update(pos, val, node*2+1, tm+1, tr);
    st[node] = {max(st[node*2].first, st[node*2+1].first), st[node*2].second+st[node*2+1].second};
}
int query(int val, int node=1, int tl=0, int tr=t-1){
    if (st[node].first < val) return 0;
    if (tl == tr) return st[node].second;
    if (st[node*2+1].first < val) return query(val, node*2, tl, (tl+tr)/2);
    else return st[node*2].second + query(val, node*2+1, (tl+tr)/2+1, tr);
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){
    t = T;
    st.resize(4*T, {0, 0});
    vector<int> x, y;
    vector<pair<int,int>> w, s;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10