Yandex.Algorithm 2020 Qualification round A問題 - Reconstructing the alphabet

Source

Yandex.Algorithm 2020 Qualification round
問題文

問題概要

省略

解法

省略

cLay（version 20201031-1）のコード

C++に変換後のコードはこちら

int N;
char S[1d6+2];
char gen[1d7]; int len;
char res[27], rev[27];
{
  int i, j, k;
  rd(S@N);

  gen[len++] = 'A';
  rep(i,1,23){
    k = len;
    gen[len++] = 'A' + i;
    rep(j,k) gen[len++] = gen[j];
  }

  rep(s,2d6){
    rep(i,26) res[i] = rev[i] = 0;
    rep(i,N){
      if(rev[S[i]-'A'] == 0 && res[gen[i+s]-'A'] == 0){
        rev[S[i]-'A'] = gen[i+s];
        res[gen[i+s]-'A'] = S[i];
      }
      if(rev[S[i]-'A'] != gen[i+s] || res[gen[i+s]-'A'] != S[i]) break_continue;
    }
    rep(i,26) rep(j,26) if(res[i]==0 && rev[j]==0){
      res[i] = 'A' + j;
      rev[j] = 'A' + i;
    }
    wt(res);
    wt(s+1);
    return 0;
  }

  wt("No solution");
}

Current time: 2024年04月26日05時16分50秒
Last modified: 2020年10月31日02時37分30秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Yandex_Algorithm
トップページに戻る

Logged in as: unknown user (not login)