168382025-05-13 20:42:50BencuTelefonközpontcpp17Time limit exceeded 40/100587ms1016 KiB
#include <iostream>
#include <fstream>

using namespace std;
int a[200001];

int main()
{
    int m, n, q;
    ifstream f("be.in");
    cin >> m >> n >> q;
    for (int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        for (int j = x; j <= y; j++) a[j]++;
    }
    //for (int i = 1; i <= m; i++) cout << a[i] << " ";
    //cout << endl;
    for (int t = 1; t <= q; t++) {
        int x, y;
        cin >> x >> y;
        int ma = a[x];
        for (int i = x + 1; i <= y; i++) {
            if (a[i] > ma) ma = a[i];
        }
        cout << ma << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted2ms316 KiB
4Accepted2ms316 KiB
5Accepted2ms316 KiB
6Accepted2ms508 KiB
7Accepted2ms764 KiB
8Accepted2ms316 KiB
9Accepted2ms316 KiB
subtask320/20
10Accepted2ms316 KiB
11Accepted2ms316 KiB
12Accepted2ms316 KiB
13Accepted2ms508 KiB
14Accepted2ms764 KiB
15Accepted2ms316 KiB
16Accepted2ms316 KiB
17Accepted28ms436 KiB
18Accepted32ms508 KiB
19Accepted19ms440 KiB
20Accepted19ms352 KiB
21Accepted20ms316 KiB
22Accepted24ms764 KiB
23Accepted28ms424 KiB
subtask40/60
24Accepted2ms316 KiB
25Accepted2ms316 KiB
26Accepted2ms316 KiB
27Accepted2ms508 KiB
28Accepted2ms764 KiB
29Accepted2ms316 KiB
30Accepted2ms316 KiB
31Accepted28ms436 KiB
32Accepted32ms508 KiB
33Accepted19ms440 KiB
34Accepted19ms352 KiB
35Accepted20ms316 KiB
36Accepted24ms764 KiB
37Accepted28ms424 KiB
38Time limit exceeded579ms1012 KiB
39Time limit exceeded579ms856 KiB
40Time limit exceeded578ms1008 KiB
41Time limit exceeded579ms820 KiB
42Time limit exceeded587ms1016 KiB
43Time limit exceeded587ms820 KiB
44Time limit exceeded587ms820 KiB