제출 #309035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309035		nikatamliani	Interval Collection (CCO20_day2problem2)	C++14	3 / 25	7058 ms	788 KiB

Main

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
int main() {
    int q;
    cin >> q;
    multiset < pair < int, int > > m;
    for(int i = 1; i <= q; ++i) {
        int l, r;
        char t;
        cin >> t >> l >> r;
        if(t == 'R') {
            m.erase(m.find({l, r}));
        } else {
            m.insert({l, r});
        }
        int ans = 1e9, best = 1e9;
        for(auto xp0 : m) {
            for(auto xp1 : m) {
                auto p0 = xp0, p1 = xp1;
                if(p0.y < p1.y) swap(p0, p1);
                int X = max(0, p1.y - p0.x);
                int Y = p0.y - min(p0.x, p1.x);
                if(ans == X) {
                    best = min(best, Y);
                }
                if(ans > X) {
                    ans = X;
                    best = Y;
                }
            }
        }
        cout << best << '\n';
    }
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 7
• Subtask 4: 0 / 4
• Subtask 5: 0 / 3