151752025-02-14 19:17:06MrkzÖntözés (50 pont)cpp17Accepted 50/5081ms652 KiB
#include <iostream>
//#include <fstream>
using namespace std;
int x,A,y,B,Q,M;
int main()
{
    //ifstream f("kerdes.in");
    cin>>Q>>M;
    for(int i=1;i<=Q;i++){
        cin>>A>>x>>B>>y;
        /*int napsz=A, ora=x, ora2=0, vegora=y+((B-A)*24), ontozes=0;
        while(napsz<=B && ora<vegora){
            ora2=ora2+M;
            if(ora2>=24){
                napsz++;
                ora2=ora2-24;
            }
            if(ora<vegora-M)
            ontozes++;
            ora=ora+M;
        }*/
        int napsz=0, ontozes=x, vegora=y+((B-A)*24);
        while(ontozes<vegora)
            ontozes++;
        if((ontozes-x)%M!=0)
        cout<<(ontozes-x)/M<<endl;
        else
            cout<<(ontozes-x-1)/M<<endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/012ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/574ms560 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms364 KiB
11Accepted3/31ms316 KiB
12Accepted1/11ms316 KiB
13Accepted1/11ms316 KiB
14Accepted1/11ms316 KiB
15Accepted1/11ms316 KiB
16Accepted2/279ms564 KiB
17Accepted3/381ms508 KiB
18Accepted2/281ms508 KiB
19Accepted3/376ms564 KiB
20Accepted1/178ms460 KiB
21Accepted1/178ms652 KiB
22Accepted3/378ms564 KiB