145472025-01-15 07:07:14csdavidÁdám és Éva együttcpp17Wrong answer 27/5035ms1072 KiB
#include <iostream>
#include <vector>
using namespace std;
struct idoszak{
    int kezd, veg;
};

int main()
{
    vector<pair<int, int>> eredmeny;
    int na, ne, ido;
    cin >> ido;
    cin >> na;
    idoszak a[na];
    for(idoszak& it:a){
        cin >> it.kezd >> it.veg;
    }
    cin >> ne;
    idoszak e[ne];
    for(idoszak& it:e){
        cin >> it.kezd >> it.veg;
    }
    int i1=0, i2=0;
    while(i1<na&&i2<ne){
        int kezd, veg;
        //cout << "i1: " << i1 << "\ni2: " << i2 << "\n\n";
        if(a[i1].veg<e[i2].kezd){
            i1++;
        }
        else if(e[i2].veg<a[i1].kezd){
            i2++;
        }
        else{
            kezd=max(a[i1].kezd, e[i2].kezd);
            veg=min(a[i1].veg, e[i2].veg);
            if(kezd!=veg) eredmeny.push_back(make_pair(kezd, veg));
            if(a[i1].veg<e[i2].veg){
                i1++;
            }
            else if(a[i1].veg>e[i2].veg){
                i2++;
            }
            else{
                i1++;
                i2++;
            }
        }

    }
    cout << eredmeny.size() << '\n';
    /*for(pair<int, int>& it:eredmeny){
        cout << it.first << ' ' << it.second << '\n';
    }*/
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base27/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms512 KiB
3Partially correct1/21ms316 KiB
4Accepted2/21ms316 KiB
5Partially correct1/21ms316 KiB
6Accepted2/21ms316 KiB
7Partially correct1/21ms316 KiB
8Partially correct1/21ms316 KiB
9Partially correct1/21ms316 KiB
10Partially correct1/21ms316 KiB
11Partially correct1/21ms316 KiB
12Partially correct1/21ms316 KiB
13Partially correct1/21ms316 KiB
14Partially correct1/21ms316 KiB
15Partially correct1/21ms316 KiB
16Partially correct1/232ms992 KiB
17Partially correct2/332ms960 KiB
18Partially correct1/329ms896 KiB
19Partially correct2/430ms908 KiB
20Partially correct2/435ms1072 KiB
21Partially correct2/432ms1048 KiB
22Partially correct2/432ms1032 KiB