Codeforces 632C Grandma Laura and Apples (analog)

Test instructions: There are n people buy apples, when the apple left an even number to buy half, when the apple surplus odd, first buy half, and then half price to buy an apple, and eventually Apple sold out. What is the farmer's income?

Analysis: Reverse simulation.

The code is as follows:

#pragma COMMENT (linker, "/stack:1024000000,1024000000") #include <cstdio> #include <string> #include < cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include < queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include < cmath> #include <stack> #define Lson l,m,rt<<1#define Rson m+1,r,rt<<1|1//#include <tr1/ unordered_map> #define FREOPENR freopen ("In.txt", "R", stdin) #define FREOPENW freopen ("OUT.txt", "w", stdout) using Namespace std;//using namespace std:: tr1;typedef Long Long ll;typedef pair<int, int> p;const int INF = 0x3f3f3f3f;  Const double inf = 0x3f3f3f3f3f3f;const LL LNF = 0x3f3f3f3f3f3f;const Double PI = ACOs ( -1.0); const double EPS = 1e-8;const  int MAXN = 1e5 + 5;const LL mod = 10000000000007;const int N = 1e6 + 5;const int dr[] = {-1, 0, 1, 0, 1, 1,-1, -1};const int dc[] = {0, 1, 0,-1, 1,-1, 1, -1};const char *hex[] = {"0000 "," 0001 "," 0010 "," 0011 "," 0100 "," 0101 "," 0110 "," 0111 "," 1000 "," 1001 "," 1010 "," 1011 "," 1100 "," 1101 "," 1110 "," 1111 "};inline ll GCD (ll A, ll b) {return b = = 0? A:GCD (b, a%b);  }int N, m;const int mon[] = {0, 31, 29, 31, 30, 31, 0, +, +,, +, +, +, +, +, 31};const int monn[] N, H, H, C, h, 31};inline int Min (int a, int b) {return a < b? A:b;} inline int Max (int a, int b) {return a > b a:b;} inline ll Min (ll A, ll b) {return a < b a:b;} inline ll Max (ll A, ll b) {return a > b a:b;} inline bool Is_in (int r, int c) {return R >= 0 && r < n && C >= 0 && C < m;} String Str[55];int Main () {while (scanf ("%d%d", &n, &m) = = 2) {for (int i = 0; i < n; ++i) cin &GT;&G T        Str[i];        LL ans = 0, x = 0;                for (int i = n-1; I >= 0; i.) {if (Str[i].size () > 5) {ans + = x * m + m/2;            x = x * 2 + 1; } else{ans + = x * m;            x *= 2;    }} cout << ans << endl; } return 0;}

Codeforces 632C Grandma Laura and Apples (analog)