제출 #545579

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545579		Zhora_004	Inside information (BOI21_servers)	C++17	10 / 100	72 ms	4624 KiB

servers

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define itn int
#define sacnf scanf
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
const ll mod = 1e9 + 7;
const int N = 1e5 + 1, inf = 1e9;



int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin >> n >> k;
    vector<int> up(n + 1), down(n + 1);
    for (int i = 1; i <= n; i++) up[i] = down[i] = i;
    for (int i = 0; i < n + k - 1; i++)
    {
        char s;
        cin >> s;
        if (s == 'S')
        {
            int u, v;
            cin >> u >> v;
            if (u > v) swap(u, v);
            up[v] = up[u];
            down[u] = down[v];
        }
        else if (s == 'Q')
        {
            int u, v;
            cin >> u >> v;
            if (u >= v && up[u] <= v) cout << "yes\n";
            else if (u < v && down[u] >= v) cout << "yes\n";
            else cout << "no\n";
        }
        else
        {
            int u;
            cin >> u;
            int l = 0, r = u;
            while (l + 1 < r)
            {
                int m = (l + r) >> 1;
                if (down[m] >= u) r = m;
                else l = m;
            }
            int a = r;
            l = u, r = n + 1;
            while (l + 1 < r)
            {
                int m = (l + r) >> 1;
                if (up[m] <= u) l = m;
                else r = m;
            }
            cout << l - a + 1 << "\n";
        }
    }

    return 0;
}

• Subtask 1: 0 / 2.5
• Subtask 2: 0 / 2.5
• Subtask 3: 0 / 2.5
• Subtask 4: 0 / 2.5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 12.5
• Subtask 10: 0 / 12.5
• Subtask 11: 0 / 17.5
• Subtask 12: 0 / 17.5