Advertisement
Dennnhhhickk

Untitled

Jan 14th, 2018
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.32 KB | None | 0 0
  1. // C.cpp: определяет точку входа для консольного приложения.
  2. //
  3.  
  4. #include "stdafx.h"
  5. #include <cmath>
  6. #include <algorithm>
  7. #include <iostream>
  8. #include <vector>
  9.  
  10. using namespace std;
  11.  
  12. typedef long long ll;
  13. typedef unsigned long long ull;
  14.  
  15. vector <ll> up, down;
  16.  
  17. int main()
  18. {
  19. ll last, count, n, data;
  20. char ch;
  21. cin >> last >> count >> n;
  22. for (int i = 0; i < n; i++)
  23. {
  24. cin >> data >> ch;
  25. if (ch == 'U')
  26. up.push_back(data);
  27. else
  28. down.push_back(data);
  29. }
  30. ll mn, ans = 0, ans1 = 0;
  31. for (int i = 0; i < 2 * (count + up.size()); i++)
  32. {
  33. if (ans1 == count + up.size())
  34. {
  35. cout << ans << endl;
  36. break;
  37. }
  38. mn = last;
  39. for (int j = 0; j < up.size(); j++)
  40. mn = min((last - up[j] != 0? last - up[j] : last), mn);
  41. for (int j = 0; j < down.size(); j++)
  42. mn = min((down[j]? down[j] : last), mn);
  43. for (int j = 0; j < up.size(); j++)
  44. up[j] += mn;
  45. for (int j = 0; j < down.size(); j++)
  46. down[j] -= mn;
  47. for (int j = 0; j < up.size(); j++)
  48. if (up[j] == last)
  49. {
  50. up.erase(up.begin() + j);
  51. down.push_back(last);
  52. ans1++;
  53. }
  54. for (int j = 0; j < down.size(); j++)
  55. if (down[j] == last)
  56. {
  57. down.erase(down.begin() + j);
  58. up.push_back(0);
  59. }
  60. ans += mn;
  61. }
  62. system("pause");
  63. return 0;
  64. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement