Submission #59221232

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;

using S = ll;
using F = ll;

const S INF = 8e18;
const F ID = 8e18;

S op(S a, S b){ return std::max(a, b); }
S e(){ return -INF; }
S mapping(F f, S x){ return (f == ID ? x : f); }
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }

int main(){
	ll w,n;cin>>w>>n;
	vector<ll>v(w);
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
	rep(i,n){
		int L,R;cin>>L>>R;
		L--;
		ll max_h=seg.prod(L,R);
		seg.apply(L,R,max_h+1);
		cout<<max_h+1<<endl;
	}
}

Submission Info

Submission Time
Task 029 - Long Bricks（★5）
User Rho17
Language C++ 20 (gcc 12.2)
Score 5
Code Size 666 Byte
Status AC
Exec Time 471 ms
Memory 19384 KiB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 1 / 1 1 / 1 3 / 3
Status
AC × 4
AC × 12
AC × 22
AC × 31
Set Name Test Cases
Sample subtask01_01_sample_01.txt, subtask01_01_sample_02.txt, subtask01_01_sample_03.txt, subtask02_01_sample_04.txt
Subtask1 subtask01_01_sample_01.txt, subtask01_01_sample_02.txt, subtask01_01_sample_03.txt, subtask01_02_max_01.txt, subtask01_03_random_01.txt, subtask01_03_random_02.txt, subtask01_03_random_03.txt, subtask01_03_random_04.txt, subtask01_03_random_05.txt, subtask01_04_special_01.txt, subtask01_04_special_02.txt, subtask01_04_special_03.txt
Subtask2 subtask01_01_sample_01.txt, subtask01_01_sample_02.txt, subtask01_01_sample_03.txt, subtask01_02_max_01.txt, subtask01_03_random_01.txt, subtask01_03_random_02.txt, subtask01_03_random_03.txt, subtask01_03_random_04.txt, subtask01_03_random_05.txt, subtask01_04_special_01.txt, subtask01_04_special_02.txt, subtask01_04_special_03.txt, subtask02_01_sample_04.txt, subtask02_02_max_02.txt, subtask02_05_random_01.txt, subtask02_05_random_02.txt, subtask02_05_random_03.txt, subtask02_05_random_04.txt, subtask02_05_random_05.txt, subtask02_06_special_01.txt, subtask02_06_special_02.txt, subtask02_06_special_03.txt
Subtask3 subtask01_01_sample_01.txt, subtask01_01_sample_02.txt, subtask01_01_sample_03.txt, subtask01_02_max_01.txt, subtask01_03_random_01.txt, subtask01_03_random_02.txt, subtask01_03_random_03.txt, subtask01_03_random_04.txt, subtask01_03_random_05.txt, subtask01_04_special_01.txt, subtask01_04_special_02.txt, subtask01_04_special_03.txt, subtask02_01_sample_04.txt, subtask02_02_max_02.txt, subtask02_05_random_01.txt, subtask02_05_random_02.txt, subtask02_05_random_03.txt, subtask02_05_random_04.txt, subtask02_05_random_05.txt, subtask02_06_special_01.txt, subtask02_06_special_02.txt, subtask02_06_special_03.txt, subtask03_02_max_03.txt, subtask03_07_random_01.txt, subtask03_07_random_02.txt, subtask03_07_random_03.txt, subtask03_08_special_01.txt, subtask03_08_special_02.txt, subtask03_08_special_03.txt, subtask03_08_special_04.txt, subtask03_08_special_05.txt
Case Name Status Exec Time Memory
subtask01_01_sample_01.txt AC 1 ms 3540 KiB
subtask01_01_sample_02.txt AC 1 ms 3600 KiB
subtask01_01_sample_03.txt AC 1 ms 3524 KiB
subtask01_02_max_01.txt AC 13 ms 3736 KiB
subtask01_03_random_01.txt AC 11 ms 3784 KiB
subtask01_03_random_02.txt AC 4 ms 3688 KiB
subtask01_03_random_03.txt AC 15 ms 3644 KiB
subtask01_03_random_04.txt AC 15 ms 3812 KiB
subtask01_03_random_05.txt AC 16 ms 3844 KiB
subtask01_04_special_01.txt AC 14 ms 3728 KiB
subtask01_04_special_02.txt AC 15 ms 3724 KiB
subtask01_04_special_03.txt AC 14 ms 3660 KiB
subtask02_01_sample_04.txt AC 8 ms 19312 KiB
subtask02_02_max_02.txt AC 21 ms 19308 KiB
subtask02_05_random_01.txt AC 18 ms 11084 KiB
subtask02_05_random_02.txt AC 22 ms 17716 KiB
subtask02_05_random_03.txt AC 25 ms 19212 KiB
subtask02_05_random_04.txt AC 23 ms 18784 KiB
subtask02_05_random_05.txt AC 20 ms 11308 KiB
subtask02_06_special_01.txt AC 24 ms 19384 KiB
subtask02_06_special_02.txt AC 24 ms 19308 KiB
subtask02_06_special_03.txt AC 22 ms 19308 KiB
subtask03_02_max_03.txt AC 362 ms 19272 KiB
subtask03_07_random_01.txt AC 467 ms 19228 KiB
subtask03_07_random_02.txt AC 429 ms 11260 KiB
subtask03_07_random_03.txt AC 424 ms 18832 KiB
subtask03_08_special_01.txt AC 412 ms 19232 KiB
subtask03_08_special_02.txt AC 430 ms 19380 KiB
subtask03_08_special_03.txt AC 141 ms 19312 KiB
subtask03_08_special_04.txt AC 435 ms 19308 KiB
subtask03_08_special_05.txt AC 471 ms 19228 KiB