結果

問題 No.233 めぐるはめぐる (3)
ユーザー LayCurseLayCurse
提出日時 2015-05-14 21:29:55
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 60 ms / 1,000 ms
コード長 3,997 bytes
コンパイル時間 2,079 ms
コンパイル使用メモリ 148,588 KB
実行使用メモリ 6,688 KB
最終ジャッジ日時 2023-09-20 07:54:46
合計ジャッジ時間 4,037 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
6,444 KB
testcase_01 AC 14 ms
6,688 KB
testcase_02 AC 7 ms
4,904 KB
testcase_03 AC 14 ms
6,440 KB
testcase_04 AC 58 ms
6,436 KB
testcase_05 AC 32 ms
6,508 KB
testcase_06 AC 29 ms
6,440 KB
testcase_07 AC 58 ms
6,440 KB
testcase_08 AC 60 ms
6,528 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 14 ms
6,444 KB
testcase_13 AC 18 ms
6,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

template<class T>
struct ullHash{
  ull *key; T *val; unsigned memory, size, mask;

  void clear(){memset(val,0,size*sizeof(T));}
  void clear(int sz){size=1;while(size<sz)size*=2;mask=size-1;clear();}
  void init(int mem, int sz){memory=mem;size=1;while(size<sz)size*=2;mask=size-1;if(memory<size)memory=size;key=(ull*)malloc(memory*sizeof(ull));val=(T*)malloc(memory*sizeof(T));if(size)clear();}
  int function(ull a){return (((a*123456789789ULL)>>32)*987654321321ULL)&mask;}
  T get(ull a){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;if(key[i]!=a) return 0;return val[i];}
  void set(ull a, T v){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;key[i]=a;val[i]=v;}
  T increase(ull a, T v = 1){int i=function(a);for(;key[i]!=a&&val[i]!=0;)i=(i+1)&mask;key[i]=a;return val[i]+=v;}
};


int N;

int aeiou[300];
char meguru[] = "inabameguru";
ullHash<int> hs;

int used[20];
char now[20];
int solve(int dep, ull tmp, int dw){
  int i, s;

  if(dw > 2) return 0;

  if(dep==11){
    if(aeiou[now[10]]==0) return 0;
    now[11] = '\0';
    if(hs.get(tmp)) return 0;
    writerLn(now);
    return 1;
  }

  rep(i,11) if(!used[i]){
    if(i && used[i-1]==0 && meguru[i-1]==meguru[i]) continue;
    now[dep] = meguru[i];

    s = dw;
    if(dep){
      if(aeiou[now[dep-1]]+aeiou[now[dep]]==0) continue;
      if(aeiou[now[dep-1]]+aeiou[now[dep]]==2) s++;
    } else {
      if(aeiou[now[dep]]) s++;
    }
    
    used[i] = 1;
    if(solve(dep+1,tmp*12345+now[dep],s)) return 1;
    used[i] = 0;
  }
  return 0;
}

int main(){
  int i, j, k;
  char buf[100];
  ull tmp;

  sort(meguru,meguru+11);
  aeiou['a'] = aeiou['e'] = aeiou['i'] = aeiou['o'] = aeiou['u'] = 1;

  reader(&N);
  hs.init(2*N,2*N);
  
  while(N--){
    reader(buf);
    tmp = 0;
    rep(i,11) tmp = tmp*12345 + buf[i];
    hs.increase(tmp);
  }
  if(!solve(0,0,0)) writerLn("NO");

  return 0;
}
0