বুধবার, ১৫ জুন, ২০১৬

EASY CF 279 A Spiral






Code : -


  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
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
/****************************************

@_@
Cat Got Bored *_*
#_#
*****************************************/

#include <bits/stdc++.h>


#define loop(i,s,e) for(int i = s;i<=e;i++) //including end point

#define pb(a) push_back(a)

#define sqr(x) ((x)*(x))

#define CIN ios_base::sync_with_stdio(0); cin.tie(0);

#define ll long long

#define ull unsigned long long

#define SZ(a) int(a.size())

#define read() freopen("input.txt", "r", stdin)

#define write() freopen("output.txt", "w", stdout)


#define ms(a,b) memset(a, b, sizeof(a))

#define all(v) v.begin(), v.end()

#define PI acos(-1.0)

#define pf printf

#define sfi(a) scanf("%d",&a);

#define sfii(a,b) scanf("%d %d",&a,&b);

#define sfl(a) scanf("%lld",&a);

#define sfll(a,b) scanf("%lld %lld",&a,&b);

#define sful(a) scanf("%llu",&a);

#define sfulul(a,b) scanf("%llu %llu",&a,&b);

#define sful2(a,b) scanf("%llu %llu",&a,&b); // A little different

#define sfc(a) scanf("%c",&a);

#define sfs(a) scanf("%s",a);


#define mp make_pair

#define paii pair<int, int>

#define padd pair<dd, dd>

#define pall pair<ll, ll>

#define fs first

#define sc second

#define CASE(t) printf("Case %d: ",++t) // t initialized 0

#define cCASE(t) cout<<"Case "<<++t<<": ";

#define INF 1000000000   //10e9

#define EPS 1e-9

#define flc fflush(stdout); //For interactive programs , flush while using pf (that's why __c )

using namespace std;
/*
IDEA:
Simulating a spiral is tricky .I simulated this earlier and
had to handle many tricky cases.
Now,I have come up with much easier solution with
only 4 cases .
See the figure in my blog to understand.

*/

int main()
{
    int x,y;
    sfii(x,y);

    int max_layer; //Which layer I'm in actually
    int layer = max(abs(x),abs(y));

    int xp = 1 , xn = 2 , yp = 3 , yn = 4;
    if(x>0 && ( (y>=0 && abs(x)>=abs(y)) || (y<0 && (abs(x) - abs(y))>=2))) // less symmetric side
    {
        max_layer = xp;
    }
    else if(x<0 && (abs(x)>=abs(y))) //much more symmetric side
    {                             //taking advantage of extra handling to make symmetric
        max_layer = xn;
    }
    else if(y>0 && (abs(y)>=abs(x))) // another symmetric side
    {
        max_layer = yp;
    }
    else //less symmetric  side
    {
        max_layer = yn;
    }
    int ans;





    //Another approach


    if(x==0 && y==0)
    {
        ans = 0; //special case
    }
    else if(x>0 && y<=0 && x==abs(y)+1) // another special case
    {
        ans = (layer-1)*4;
    }
    else if(x<0 && y>=0 && abs(x)==y)
    {
        ans = (layer-1)*4 + 2; // safety
    }
    else if(x>0 && y>0 && (x==y))
    {
        ans = (layer-1)*4 + 1;
    }
    else if(x<0 && y<0 && x==y)
    {
        ans = (layer-1)*4 +3;
    }
    else if(max_layer==xp)
    {
        ans = (layer-1)*4 + 1;
    }
    else if(max_layer==yp)
    {
        ans = (layer-1)*4 + 2;
    }
    else if(max_layer==xn)
    {
        ans = (layer-1)*4 + 3;
    }
    else
    {
        ans = (layer-1)*4 + 4;
    }



    pf("%d\n",ans);

    return 0;
}
এর দ্বারা পোস্ট করা এই সময়ে

কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

এতে সদস্যতা: মন্তব্যগুলি পোস্ট করুন (Atom)