提出 #7097237

---

ソースコード 拡げる

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(char &c){
  int i;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i, sz=0;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    putchar_unlocked(c[i]);
  }
}
char W[102];
int N;
int cnt[128];
int main(){
  int KL2GvlyY, Q5VJL1cS;
  N = rd(W);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<((N-1) + 1);Lj4PdHRW++){
      cnt[W[Lj4PdHRW]] ^= 1;
    }
  }
  if(128==0){
    Q5VJL1cS = 0;
  }
  else{
    int KL2GvlyY;
    Q5VJL1cS = cnt[0];
    for(KL2GvlyY=(1);KL2GvlyY<(128);KL2GvlyY++){
      Q5VJL1cS += cnt[KL2GvlyY];
    }
  }
  if(Q5VJL1cS){
    wt_L("No");
    wt_L('\n');
  }
  else{
    wt_L("Yes");
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20190822-2

// --- original code ---
// char W[102];
// int N;
// int cnt[128];
// {
//   rd(W@N);
//   cnt[W[0..N-1]] ^= 1;
//   wt( if[sum(cnt(128)), "No", "Yes"] );
// }

提出情報

ジャッジ結果