153262025-02-18 11:38:40gyarturÖntözés (50 pont)cpp17Accepted 50/5035ms1076 KiB
#include <iostream>

using namespace std;

struct Kerdes{
    int a, x;
    int b, y;
};

Kerdes kerdesek[30000];

int TeljesIdokoz(Kerdes k){
    int idokoz = (k.b-k.a)*24;
    idokoz += k.y-k.x;
    return idokoz;
}

int main(){
    int q, m;
    cin>>q>>m;
    for(int i = 0; i < q; i++){
        cin>>kerdesek[i].a>>kerdesek[i].x>>kerdesek[i].b>>kerdesek[i].y;
    }
    for(int i = 0; i < q; i++){
        cout<<(TeljesIdokoz(kerdesek[i])-1)/m<<'\n';
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/06ms508 KiB
3Accepted5/51ms508 KiB
4Accepted5/535ms1076 KiB
5Accepted3/31ms500 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms392 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted1/11ms408 KiB
13Accepted1/11ms508 KiB
14Accepted1/11ms316 KiB
15Accepted1/11ms316 KiB
16Accepted2/235ms992 KiB
17Accepted3/335ms892 KiB
18Accepted2/235ms952 KiB
19Accepted3/335ms816 KiB
20Accepted1/135ms820 KiB
21Accepted1/135ms820 KiB
22Accepted3/335ms820 KiB