29912023-02-07 12:52:16bzsofiaVideójátékcpp11Wrong answer 10/100186ms10336 KiB
// Videogames.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct adat
{
    long long beg, ends;
};

long long i, n, m, t, j, sum;

bool comp (adat a, adat b)
{
    if (a.beg==b.beg) return a.ends<b.ends;
    return a.beg<b.beg;
}

int main()
{
    cin >> t >> n;
    vector <adat> x(n + 1);

    for (i = 1; i <= n; ++i)
    {
        cin >> x[i].beg >> x[i].ends;
    }

    cin >> m;
    vector <adat> y(m + 1);
    for (i = 1; i <= m; ++i)
    {
        cin >> y[i].beg >> y[i].ends;
    }

    i=1;
    j=1;
    while (i<=n && j<=m)
    {
        if (x[i].ends<y[j].beg) ++i;
        else if (y[j].ends<x[i].beg) ++j;
        else if (x[i].ends==y[j].ends && x[i].beg==y[j].ends)
        {
            ++i;
            ++j;
            sum+=x[i].ends-x[i].beg+1;
        }else if (x[i].beg<y[j].beg)
        {
            if (y[j].beg-x[i].beg<=t)
            {
                if (y[j].ends>x[i].ends)
                {
                    if (x[i].ends==y[j].beg)
                    {
                        sum+=1;
                        ++i;
                    }
                    else
                    {
                        sum+=x[i].ends-y[j].beg+1;
                        ++i;
                    }
                }else if (y[j].ends==x[i].ends)
                {
                    sum+=y[j].ends-y[j].beg+1;
                    ++i;
                    ++j;
                }else
                {
                    sum+=y[j].ends-y[j].beg+1;
                    x[i].beg=y[j].ends+1;
                    ++j;
                }
            }
            else
            {
                if (y[j].ends<=x[i].ends) ++j;
                ++i;
            }
        }else if (x[i].beg==y[j].beg)
        {
            if (x[i].ends<y[j].ends)
            {
                sum+=x[i].ends-x[i].beg+1;
                ++i;
            }else
            {
                sum+=y[j].ends-y[j].beg+1;
                x[i].beg=y[j].ends+1;
                ++j;
            }
        }
        else
        {
            if (x[i].beg==y[j].ends)
            {
                sum+=1;
                ++x[i].beg;
                ++j;
            }
            else if (x[i].ends<y[j].ends)
            {
                sum+=x[i].ends-x[i].beg+1;
                ++i;
            }else if (x[i].ends == y[j].ends)
            {
                sum+=x[i].ends-x[i].beg+1;
                ++i;
                ++j;
            }else
            {
                sum+=y[j].ends-x[i].beg+1;
                x[i].beg=y[j].ends+1;
                ++j;
            }
        }
    }

    cout << sum;

    return 0;
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started:
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted3ms1816 KiB
2Accepted3ms2004 KiB
subtask210/10
3Accepted3ms2216 KiB
4Accepted3ms2456 KiB
5Accepted3ms2672 KiB
6Accepted3ms2752 KiB
7Accepted3ms2968 KiB
8Accepted3ms3220 KiB
9Accepted3ms3300 KiB
10Accepted3ms3308 KiB
11Accepted3ms3392 KiB
subtask30/20
12Accepted3ms3636 KiB
13Accepted3ms3480 KiB
14Accepted3ms3624 KiB
15Accepted3ms3696 KiB
16Accepted3ms3692 KiB
17Accepted3ms3836 KiB
18Accepted4ms3924 KiB
19Accepted4ms3816 KiB
20Wrong answer3ms3888 KiB
21Wrong answer4ms3936 KiB
22Accepted3ms4000 KiB
subtask40/30
23Accepted14ms4392 KiB
24Accepted50ms5872 KiB
25Accepted123ms9380 KiB
26Accepted136ms10032 KiB
27Accepted137ms10032 KiB
28Accepted54ms6408 KiB
29Accepted10ms4360 KiB
30Accepted10ms4328 KiB
31Wrong answer7ms4100 KiB
subtask50/40
32Accepted17ms4396 KiB
33Accepted63ms6412 KiB
34Accepted115ms8056 KiB
35Accepted163ms9492 KiB
36Accepted186ms10156 KiB
37Accepted186ms10336 KiB
38Accepted94ms8000 KiB
39Accepted114ms8472 KiB
40Wrong answer28ms4828 KiB
41Wrong answer43ms5744 KiB