Advertisement
Korotkodul

Alg/1/3

Feb 8th, 2025 (edited)
53
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.15 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <queue>
  5. #include <algorithm>
  6. #include <string>
  7. #include <stack>
  8. #include <set>
  9. #include <map>
  10. #define pii pair <int, int>
  11. #define pb(x) push_back(x)
  12. using namespace std;
  13. using ll = long long;
  14. using ld = long double;
  15. using db = double;
  16. void cv(vector <int> &v) {
  17.     for (auto x : v) cout << x << ' ';
  18.     cout << "\n";
  19. }
  20.  
  21. void cvl(vector <ll> &v) {
  22.     for (auto x : v) cout << x << ' ';
  23.     cout << "\n";
  24. }
  25.  
  26.  
  27. void cvv(vector <vector <int> > &v) {
  28.     for (auto x : v) cv(x);
  29.     cout << "\n";
  30. }
  31.  
  32. void cvb(vector <bool> v) {
  33.     for (bool x : v) cout << x << ' ';
  34.     cout << "\n";
  35. }
  36.  
  37. void cvs(vector <string>  v) {
  38.     for (auto a : v) {
  39.         cout << a << "\n";
  40.     }
  41. }
  42.  
  43. void cvp(vector <pii> a) {
  44.     for (auto p : a) {
  45.         cout << p.first << ' ' << p.second << "\n";
  46.     }
  47.     cout << "\n";
  48. }
  49.  
  50.  
  51.  
  52. int main() {
  53.     ios::sync_with_stdio(0);
  54.     cin.tie(0);
  55.     cout.tie(0);
  56.     string s; cin >> s;
  57.     int n = s.size();
  58.     vector <int> a(n);
  59.     for (int i = 0; i < n; ++i) {
  60.         a[i] = s[i] - '0';
  61.     }
  62.     //cv(a);
  63.     map <int, int> cnt;
  64.     for (int i = 0; i < n; ++i) {
  65.         cout << s[i] << s[i] - '0' << "\n";
  66.         if (cnt.find(a[i]) == cnt.end()) {
  67.             //cout << "create\n";
  68.             cnt[a[i]] == 0;
  69.             cnt[a[i]]++;
  70.         } else {
  71.             //cout << "add\n";
  72.             cnt[a[i]]++;
  73.         }
  74.         //cout << cnt[a[i]] << "\n";
  75.     }
  76.     /*cout << "cnt\n";
  77.     for (auto p:cnt) {
  78.         cout << p.first << ' ' << p.second << "\n";
  79.     }
  80.     cout << "\n";*/
  81.     vector <int> clear;
  82.     for (int i = 0; i < n; ++i) {
  83.         if (cnt[a[i]] > 1) {
  84.             clear.push_back(a[i]);
  85.         }
  86.     }
  87.     //cout << "clear\n";
  88.     //cv(clear);
  89.     if(clear.size() % 2 == 1) {
  90.         cout << "YES\n";
  91.         exit(0);
  92.     }
  93.     bool pol = 1;
  94.     for (int i = 0; i < clear.size() / 2; ++i) {
  95.         if (clear[i] != clear[n - 1 - i]) {
  96.             pol = 0;
  97.             break;
  98.         }
  99.     }
  100.     if (pol) {
  101.         cout << "NO\n";
  102.     } else{
  103.         cout << "YES\n";
  104.     }
  105. }
  106. //XYBAXB
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement