Submission #20,714

20714

2026-01-08 18:10:23

cpp17

Accepted 50/50

85ms

1376 KiB

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int Q, M;
    cin >> Q >> M;
    vector <int> A(Q+1), B(Q+1), x(Q+1), y(Q+1);
    for (int i = 1; i <= Q; i++) {
            cin >> A[i] >> x[i] >> B[i] >> y[i];
    }

    for (int i = 1; i <= Q; i++) {
        int kulonbseg = (B[i]-A[i]-1)*24+24-x[i]+y[i];
        if (kulonbseg%M == 0) { cout << kulonbseg/M-1 << endl; }else cout << kulonbseg/M << endl;
    }

    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	500 KiB
		2	Accepted	0/0	10ms	508 KiB
		3	Accepted	5/5	1ms	316 KiB
		4	Accepted	5/5	72ms	1076 KiB
		5	Accepted	3/3	1ms	316 KiB
		6	Accepted	3/3	1ms	316 KiB
		7	Accepted	3/3	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	1ms	396 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	1/1	1ms	508 KiB
		13	Accepted	1/1	1ms	400 KiB
		14	Accepted	1/1	1ms	316 KiB
		15	Accepted	1/1	1ms	316 KiB
		16	Accepted	2/2	79ms	1012 KiB
		17	Accepted	3/3	79ms	868 KiB
		18	Accepted	2/2	85ms	1376 KiB
		19	Accepted	3/3	72ms	820 KiB
		20	Accepted	1/1	81ms	820 KiB
		21	Accepted	1/1	79ms	1012 KiB
		22	Accepted	3/3	81ms	1332 KiB