제출 #544545

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
544545	2022-04-02 09:32:07	benson1029	Team Contest (JOI22_team)	C++14	100 / 100	700 ms	17988 KiB

team

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;
int n;
vector<int> v[150005];
vector< pair<int,int> > a[3];
int seg1[600005], seg2[600005];
int mp[3][150005];
void seg1_upd(int x, int l, int r, int ll, int rr, int val) {
  if(ll <= l && r <= rr) {
    seg1[x] = max(seg1[x], val);
  } else if(ll > r || rr < l) {
    return;
  } else {
    seg1_upd(x*2, l, (l+r)/2, ll, rr, val);
    seg1_upd(x*2+1, (l+r)/2+1, r, ll, rr, val);
  }
}
void seg2_upd(int x, int l, int r, int ll, int rr, int val) {
  if(seg2[x] == 0) seg2[x] = 1e9;
  if(ll <= l && r <= rr) {
    seg2[x] = min(seg2[x], val);
  } else if(ll > r || rr < l) {
    return;
  } else {
    seg2_upd(x*2, l, (l+r)/2, ll, rr, val);
    seg2_upd(x*2+1, (l+r)/2+1, r, ll, rr, val);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 27 / 27