149312025-02-08 14:36:47szjÁdám és Éva együttcpp17Accepted 50/5070ms1200 KiB
#include <bits/stdc++.h>

using namespace std;
struct majom
{
    int k, v;
};
int main()
{
    int n1, n2, i, j=0;
    cin >> n1 >> n1;
    majom a[n1], e, f;
    vector<majom>vec;
    for(i=0; i<n1; i++)cin >> a[i].k >> a[i].v;
    cin >> n2 >> e.k >> e.v;
    i=0;
    while(i<n1 && j<n2)
    {
        if(e.k > a[i].v)i++;
        else if(e.v < a[i].k)
        {
            cin >> e.k >> e.v;
            j++;
        }
        else
        {
            f.k = max(a[i].k,e.k);
            f.v = min(a[i].v,e.v);
            if(f.k!=f.v)vec.push_back(f);
            if(a[i].v<e.v)i++;
            else if(a[i].v>e.v)
            {
                cin >> e.k >> e.v;
                j++;
            }
            else
            {
                cin >> e.k >> e.v;
                j++;
                i++;
            }
        }
    }
    cout << vec.size() << endl;
    for(i=0; i<vec.size(); i++)cout << vec[i].k << ' ' << vec[i].v << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms536 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms316 KiB
12Accepted2/21ms316 KiB
13Accepted2/21ms508 KiB
14Accepted2/21ms316 KiB
15Accepted2/21ms316 KiB
16Accepted2/265ms1076 KiB
17Accepted3/368ms1172 KiB
18Accepted3/363ms1044 KiB
19Accepted4/465ms1024 KiB
20Accepted4/470ms1200 KiB
21Accepted4/468ms1200 KiB
22Accepted4/468ms1172 KiB