229092026-01-16 08:21:03MrkzÖntözés (50 pont)cpp17Wrong answer 14/5085ms648 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int Q, M;
    cin >> Q >> M;
    for (int i = 0; i < Q; i++)
    {
        int A, x, B, y;
        cin >> A >> x >> B >> y;

        long long ora_A = 24 - x + 1;
        long long ora_B = y;
        long long teljes_napok = B - A - 1;
        long long teljes_orak = teljes_napok * 24;
        int ossz_orak = ora_A + teljes_orak + ora_B;
        long long minimalis_locsolas;
        int szaraz_orak = ossz_orak - 2;
        if (M == 1)
        {
            minimalis_locsolas = szaraz_orak;
        }
        else
        {
            long long szaraz_max;
            szaraz_max = M;
            long long res = (szaraz_orak + szaraz_max - 1) / szaraz_max;
            minimalis_locsolas = max(0LL, res - 1);
        }
        cout << minimalis_locsolas << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/013ms316 KiB
3Accepted5/51ms500 KiB
4Accepted5/576ms452 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms508 KiB
7Wrong answer0/32ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/32ms316 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms320 KiB
12Accepted1/11ms508 KiB
13Accepted1/11ms376 KiB
14Accepted1/11ms316 KiB
15Accepted1/11ms316 KiB
16Wrong answer0/282ms444 KiB
17Wrong answer0/381ms500 KiB
18Wrong answer0/281ms616 KiB
19Wrong answer0/381ms428 KiB
20Wrong answer0/179ms580 KiB
21Wrong answer0/178ms648 KiB
22Wrong answer0/385ms564 KiB