제출 #1127213

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1127213		fzyzzz_z	Gift Exchange (JOI24_ho_t4)	C++20	0 / 100	0 ms	324 KiB

Main

#include <bits/stdc++.h>
using namespace std; 


int32_t main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0); 

    // each corresponds with a segment
    // for each segment, find left and right s.t. overlap
    // i.e.
    // sweep rightwards 
    // get maximum val in segtree
    // for that segment, set it to i 
    // now we know the lb and rb 
    // range set range getmax 

    // now, say we have requriement Li < i < Ri 
    // this invalidates all queries with left bound from (Li, i] and rb [i, Ri) 
    // we can store this with segtree st[i] => minimum r required for l = i 
    // process requirements in increasing r 
    // use lazy range set 
    // range set point max  


    return 0; 
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12