202182026-01-05 14:18:02BikficcÁdám és Éva együttcpp17Wrong answer 8/5065ms1212 KiB
#include <iostream>
#include <vector>
using namespace std;
  struct idoszak
    {
        int k, v;
    };
int main()
{
    int an,en, p;
    cin >> p;
    cin >> an;
    vector <idoszak> a(an);
    for (int i=0; i<an; i++)
    {
        cin >> a[i].k >> a[i].v;
    }
    cin >> en;
    vector <idoszak> e(en);
    for (int i=0; i<en; i++)
    {
        cin >> e[i].k >> e[i].v;
    }
    vector <idoszak> kozos;
    int i=0, j=0, kezd, veg;
    while (i<an && j<en)
    {
        kezd=(e[i].k>a[j].k ? e[i].k : a[j].k);
        veg=(e[i].v<a[j].v ? e[i].v : a[j].v);
        if (kezd < veg)
        {
            kozos.push_back({kezd,veg});
        }
        if (e[i].v<a[j].v)
        {
            i++;
        }
        else
        {
            j++;
        }
    }
    cout << kozos.size() << endl;
    for (auto x: kozos)
    {
     cout << x.k << " " << x.v << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base8/50
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/21ms316 KiB
13Wrong answer0/21ms316 KiB
14Wrong answer0/21ms316 KiB
15Wrong answer0/21ms316 KiB
16Wrong answer0/257ms1092 KiB
17Wrong answer0/359ms1208 KiB
18Wrong answer0/354ms1072 KiB
19Wrong answer0/457ms1188 KiB
20Wrong answer0/465ms1212 KiB
21Wrong answer0/459ms1076 KiB
22Wrong answer0/461ms1088 KiB