Codeforces Round #503 (by SIS, Div. 2)

https://codeforces.com/contest/1020

A

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cmath>
 4 #include <algorithm>
 5 #include <cstdio>
 6 #include <cstdlib>
 7 #include <string.h>
 8 using namespace std;
 9 int n,h,a,b,k;
10 int main()
11 {
12     scanf("%d%d%d%d%d",&n,&h,&a,&b,&k);
13     while(k--)
14     {
15         int ta,fa,tb,fb;long long ans=0;
16         scanf("%d%d%d%d",&ta,&fa,&tb,&fb);
17         if(ta==tb)
18             ans+=abs(fb-fa);
19         if(ta!=tb)
20         {
21             ans+=abs(tb-ta);
22             if(fa>=a and fa<=b)
23             {
24                 ans+=abs(fb-fa);
25             }
26             else
27             {
28                 if(abs(fa-a)<abs(fa-b))
29                 {
30                     ans+=abs(fa-a);
31                     ans+=abs(a-fb);
32                 }
33                 else
34                 {
35                     ans+=abs(fa-b);
36                     ans+=abs(b-fb);
37                 }
38             }
39         }
40         cout<<ans<<endl;
41     }
42     return 0;
43 }

View Code