27972023-01-25 12:23:30Error42Videójátékcpp11Accepted 100/100188ms8660 KiB
// Code of Martin Nagy (CWM), only debugged by me

#include <iostream>
#include <vector>
using namespace std;
//#define int long long
int T;

// last minute in which the character wasn't bored
//
// special value: if equal to Me.end, means that we got bored and stopped playing
int lastPlayedGlobal;
struct interval {
    int beginning;
    int end;
};
char intersectionType(interval Me, interval Hano) {
    // intersecting and Me.beginning <= Hano.beginning
    if (Me.beginning <= Hano.beginning && Me.end >= Hano.beginning) return 'M';
    // intersecting and Me.beginning > Hano.begin
    if (Me.beginning >= Hano.beginning && Hano.end >= Me.beginning) return 'H';
    // no intersection
    return 'N'; 
}
int calcPlayTime(interval Me, interval Hano) {
    char iType = intersectionType(Me, Hano);
    if (iType == 'N') return 0;
    if (iType == 'H') return min(Hano.end, Me.end) - Me.beginning + 1;
    if (iType == 'M') {
        if (
            lastPlayedGlobal + T + 1 >= Hano.beginning 
            && /* handle special value: */ lastPlayedGlobal != Me.end
        ) {
            return min(Hano.end, Me.end) - Hano.beginning + 1;
        }
        else {
            lastPlayedGlobal = Me.end;
            return 0;
        }
    }
}
signed main()
{
    cin >> T;
    int meIntervalCount, hanoIntervalCount;
    cin >> meIntervalCount;
    vector<interval> meIntervals;
    vector<interval> hanoIntervals;
    for (size_t i = 0; i < meIntervalCount; i++)
    {
        int a, b;
        cin >> a >> b;
        meIntervals.push_back({ a,b });
    }
    cin >> hanoIntervalCount;
    for (size_t i = 0; i < hanoIntervalCount; i++)
    {
        int a, b;
        cin >> a >> b;
        hanoIntervals.push_back({ a,b });
    }
    int hanoIntervalIndex = 0;
    int meIntervalIndex = 0;
    lastPlayedGlobal = meIntervals[0].beginning - 1;
    int MaxPlayTime = 0;
    while (true) {
        MaxPlayTime += calcPlayTime(meIntervals[meIntervalIndex], hanoIntervals[hanoIntervalIndex]);
        if (meIntervals[meIntervalIndex].end >= hanoIntervals[hanoIntervalIndex].end) {
            // Hano's planned break ended strictly earlier

            // special value handled: always Hano.end < Me.end
            if (lastPlayedGlobal < hanoIntervals[hanoIntervalIndex].end)lastPlayedGlobal = hanoIntervals[hanoIntervalIndex].end;
            hanoIntervalIndex++;
            if (hanoIntervalIndex == hanoIntervalCount) {
                cout << MaxPlayTime << "\n";
                return 0;
            }
        }
        else {
            meIntervalIndex++;
            if (meIntervalIndex == meIntervalCount) {
                cout << MaxPlayTime << "\n";
                return 0;
            }
            lastPlayedGlobal = meIntervals[meIntervalIndex].beginning - 1;
        }
    }
}

// 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
1Accepted3ms1812 KiB
2Accepted2ms2060 KiB
subtask210/10
3Accepted2ms2208 KiB
4Accepted2ms2604 KiB
5Accepted2ms2736 KiB
6Accepted2ms2796 KiB
7Accepted2ms2920 KiB
8Accepted2ms2964 KiB
9Accepted2ms2844 KiB
10Accepted2ms2996 KiB
11Accepted2ms3188 KiB
subtask320/20
12Accepted2ms3160 KiB
13Accepted2ms3156 KiB
14Accepted2ms3284 KiB
15Accepted2ms3164 KiB
16Accepted2ms3164 KiB
17Accepted3ms3436 KiB
18Accepted3ms3300 KiB
19Accepted4ms3404 KiB
20Accepted3ms3300 KiB
21Accepted3ms3532 KiB
22Accepted2ms3600 KiB
subtask430/30
23Accepted14ms4028 KiB
24Accepted50ms5008 KiB
25Accepted123ms8100 KiB
26Accepted136ms8200 KiB
27Accepted137ms8152 KiB
28Accepted54ms5624 KiB
29Accepted10ms3972 KiB
30Accepted10ms4340 KiB
31Accepted6ms4192 KiB
subtask540/40
32Accepted16ms4484 KiB
33Accepted61ms5580 KiB
34Accepted115ms6988 KiB
35Accepted164ms8552 KiB
36Accepted188ms8660 KiB
37Accepted185ms8476 KiB
38Accepted94ms6532 KiB
39Accepted114ms8156 KiB
40Accepted28ms5320 KiB
41Accepted43ms5520 KiB