Submission #851905

#	Time	Username	Problem	Language	Result	Execution time	Memory
851905		vjudge1	Osumnjičeni (COCI21_osumnjiceni)	C++17	0 / 110	1061 ms	34908 KiB

Main

//author:
#include <bits/stdc++.h>
using namespace std;
#define int long long
using i64 = long long;

const int MAXN = 2e5 + 5;

#define ONLINE_JUDGE

void solve() {
    int n;
    cin >> n;

    vector <pair <int, int>> vec(n +1);
    for(int i = 1; i <= n; i++) {
        cin >> vec[i].first >> vec[i].second;
    }

    map <int, int> mp;
    for(int i = 1; i <= n; i++)
        mp[vec[i].first] = mp[vec[i].second] = 0;

    int cnt = 1;
    for(auto &[a, b] : mp)
        b = cnt++;

    for(int i = 1; i <= n; i++)
        vec[i].first = mp[vec[i].first], vec[i].second = mp[vec[i].second];

    int q;
    cin >> q;
    for(int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;

        vector <int> pref(2 * MAXN);
        for(int i = l; i <= r; i++) {
            pref[vec[i].first]++;
            pref[vec[i].second +1]--;
        }

        vector <int> arr = pref;
        for(int i = 1; i <= cnt + 4; i++)
            arr[i] += arr[i -1];
        
        cout << *max_element(arr.begin(), arr.end()) << "\n";
    }
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    while(t--)
        solve();

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 50