Submission #1165646

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1165646	2025-03-12 07:26:06	KG07	Meetings (IOI18_meetings)	C++20	100 / 100	2007 ms	325052 KiB

meetings

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 "meetings.h"
#include <bits/stdc++.h>
using namespace std;
struct segment_tree{
    int L[800000], R[800000], n;
    int t[2100000], T[2100000], root;
    long long a[2100000], b[2100000], c[2100000], A[2100000], B[2100000], C[2100000], S[800000];
    vector<pair<int, pair<int, int>>> Q[800000];
    stack<int> s;
    queue<int> q;
    void init(int N, int M, vector<int> H, vector<int> X, vector<int> Y){
        n = N;
        for(int i = 0; i < N; i++)q.push(H[i]);
        create_tree(1, 1, N);
        for(int i = 0; i < N; i++){
            while(!s.empty() && H[s.top()] < H[i]){
                int h = s.top();
                s.pop();
                if(!s.empty() && H[s.top()] < H[i])R[s.top()+1] = h+1;
                else L[i+1] = h+1;
            }
            s.push(i);
        }
        while(!s.empty()){
            int h = s.top();
            s.pop();
            if(!s.empty())R[s.top()+1] = h+1;
            else root = h+1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 17 / 17
• Subtask 4: 24 / 24
• Subtask 5: 40 / 40