제출 #1116781

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116781		vjudge1	Segments (IZhO18_segments)	C++17	0 / 100	5065 ms	10480 KiB

segments

#include <bits/stdc++.h>
  
using namespace std;
  
#define int long long
#define pb push_back
#define sz(x) x.size()
#define F first
#define S second
#define nl '\n'
  
const int N = 2e5 + 1;
int q, t, lans = 0;
multiset< pair<int, int> >s;
map<int, pair<int, int>>mp;
set< int >st;

signed main() 
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >>q >>t;
    for( int i = 1; i <= q; ++i )
        st.insert( i );
    while( q-- )
    {
        int type, l, r, k, id;
        cin >>type;
        if( type == 1 )
        {
            cin >>l >>r;
            l = (l ^ (t * lans));
            r = (r ^ (t * lans));
            if( l > r )
                swap(l, r);
            s.insert({l, r});
            id = *st.begin();
            st.erase( id );
            mp[id] = {l, r};
        }
        else if( type == 2 )
        {
            cin >>id;
            l = mp[id].F;
            r = mp[id].S;
            s.erase({l, r});
            st.insert( id );
        }
        else
        {
            cin >>l >>r >>k;
            l = (l ^ (t * lans));
            r = (r ^ (t * lans));
            if( l > r )
                swap(l, r);
            int res = 0;
            for( auto [l1, r1]: s )
            {
                if( l1 > r || l > r1 )
                    continue;
                int l2 = max(l, l1);
                int r2 = min(r, r1);
                res += (r2 - l2 + 1 >= k);
            }
            cout <<res <<nl;
            lans = res;
        }
    }
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 15
• Subtask 3: 0 / 16
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 25