CodeForces-Solutions/2004B.cpp at main · garvit018/CodeForces-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
<<<<<<< HEAD
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int l, r, L, R;
        cin >> l >> r >> L >> R;
        ll mini = min(r, R);
        ll maxi = max(l, L);
        // agar mini kam hua maxi se toh wo ek saath kabhi honge hi nhi toh sirf 1 door lock krna rhega
        // kyuki wo doors khol ke udhar toh jaa hi skte hai
        if (mini < maxi)
        {
            cout << 1 << endl;
            continue;
        }

        ll count = mini - maxi; // itne toh minimum honge hi

        if (l < maxi || L < maxi)
        {
            count++;
        }
        if (r > mini || R > mini)
        {
            count++;
        }
        cout << count << endl;
    }
    return 0;
=======
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int l, r, L, R;
        cin >> l >> r >> L >> R;
        ll mini = min(r, R);
        ll maxi = max(l, L);
        // agar mini kam hua maxi se toh wo ek saath kabhi honge hi nhi toh sirf 1 door lock krna rhega
        // kyuki wo doors khol ke udhar toh jaa hi skte hai
        if (mini < maxi)
        {
            cout << 1 << endl;
            continue;
        }

        ll count = mini - maxi; // itne toh minimum honge hi

        if (l < maxi || L < maxi)
        {
            count++;
        }
        if (r > mini || R > mini)
        {
            count++;
        }
        cout << count << endl;
    }
    return 0;
>>>>>>> 4bb7f1e9c9149de1c5c4e3b2a9a463945e04b545
}