제출 #301627

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
301627	2020-09-18 05:31:51	maximath_1	식물 비교 (IOI20_plants)	C++11	49 / 100	1668 ms	30704 KiB

plants

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 "plants.h"
#include <vector>
#include <iostream>
using namespace std;
#define ll long long
const ll inf = 1e18;
int n, arr[200005];
vector<int> r;
pair<ll, int> st[200005 * 4][2];
void build(int nd, int cl, int cr, int tp){
  st[nd][tp] = {0, cl};
  if(cl != cr){
    build(nd * 2, cl, (cl + cr) / 2, tp);
    build(nd * 2 + 1, (cl + cr) / 2 + 1, cr, tp);
  }
}
ll lz[200005 * 4][2];
void prop(int nd, int cl, int cr, int tp){
  if(lz[nd][tp]){
    st[nd][tp].first += lz[nd][tp];
    if(cl != cr){
      lz[nd * 2][tp] += lz[nd][tp];
      lz[nd * 2 + 1][tp] += lz[nd][tp];
    }
    lz[nd][tp] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25