126462024-12-27 14:54:26PappMatyasÁruszállítás (75 pont)cpp17Time limit exceeded 21/75398ms2360 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, m, A[100000], B[100000], mini = 1000001, maxi, ans = 0, sma = 0;
    bool repeat = true;
    cin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        cin >> A[i] >> B[i];
    }
    while(repeat)
    {
        for(int i = 0; i < m; i++)
        {
            if(A[i] < mini && A[i] > sma)
            {
                mini = A[i];
                maxi = B[i];
            }
            else
            {
                if(A[i] == mini)
                {
                    if(B[i] > maxi)
                    {
                        maxi = B[i];
                    }
                }
            }
        }
        if(sma == maxi)
        {
            repeat = false;
            ans+=(n-maxi);
        }
        else
        {
            ans+= mini - sma;
            sma = maxi;
            mini = 1000001;
        }

    }
    ans--;
    cout << ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base21/75
1Accepted0/01ms500 KiB
2Time limit exceeded0/0384ms2360 KiB
3Accepted3/31ms320 KiB
4Accepted3/31ms320 KiB
5Accepted3/31ms320 KiB
6Wrong answer0/31ms320 KiB
7Wrong answer0/31ms320 KiB
8Wrong answer0/41ms544 KiB
9Wrong answer0/41ms412 KiB
10Wrong answer0/41ms352 KiB
11Wrong answer0/41ms412 KiB
12Wrong answer0/41ms320 KiB
13Wrong answer0/454ms540 KiB
14Wrong answer0/4142ms568 KiB
15Wrong answer0/454ms516 KiB
16Accepted4/46ms572 KiB
17Accepted4/46ms580 KiB
18Accepted4/47ms568 KiB
19Wrong answer0/490ms580 KiB
20Wrong answer0/4141ms612 KiB
21Time limit exceeded0/4382ms2104 KiB
22Time limit exceeded0/4398ms2232 KiB