Lesson :
Always sketch the solution in paper , Never ever just start coding NO MATTER how easy the problem is .
Think 2 minutes more if you have easier / shorter solution .
It's not about getting AC , it's about writing such a program that you can proof it's correctness .
Always sketch the solution in paper , Never ever just start coding NO MATTER how easy the problem is .
Think 2 minutes more if you have easier / shorter solution .
It's not about getting AC , it's about writing such a program that you can proof it's correctness .
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 | /**************************************** @_@ 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; //Remove this before submission char toil[1009]; char up[1009]; char down[1009]; char prf[1009]; int main() { sfs(toil); int len = strlen(toil); loop(i,0,len-1) { up[i] = toil[i]; down[i] = toil[i]; prf[i] = toil[i]; } int cnt = 0; int u = 0; int d = 0; int p = 0; loop(i,1,len-1) { char ch1 = up[i]; char ch2 = up[i-1]; if(ch1!=ch2) { u++; } if(ch1=='D') { u++; up[i] = 'U'; } } loop(i,1,len-1) { char ch1 = down[i]; char ch2 = down[i-1]; if(ch1!=ch2) { d++; } if(ch1=='U') { d++; down[i] = 'D'; } } loop(i,1,len-1) { char ch1 = prf[i]; char ch2 = prf[i-1]; if(ch1!=ch2) { p++; } } cout<<u<<endl; cout<<d<<endl; cout<<p<<endl; return 0; } |
No comments:
Post a Comment