結果

問題 No.241 出席番号(1)
ユーザー yuppe19 😺yuppe19 😺
提出日時 2015-07-14 12:14:20
言語 C++11
(gcc 11.4.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,073 bytes
コンパイル時間 428 ms
コンパイル使用メモリ 52,988 KB
最終ジャッジ日時 2023-08-20 17:49:40
合計ジャッジ時間 844 ms
ジャッジサーバーID
(参考情報)
judge14 / judge13
このコードへのチャレンジ(β)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:25:20: error: variable or field ‘init_by_array’ declared void
 void init_by_array(vector<unsigned int> init_key) {
                    ^~~~~~
main.cpp:25:20: error: ‘vector’ was not declared in this scope
main.cpp:25:20: note: ‘std::vector’ is defined in header ‘<vector>’; did you forget to ‘#include <vector>’?
main.cpp:3:1:
+#include <vector>
 using namespace std;
main.cpp:25:20:
 void init_by_array(vector<unsigned int> init_key) {
                    ^~~~~~
main.cpp:25:27: error: expected primary-expression before ‘unsigned’
 void init_by_array(vector<unsigned int> init_key) {
                           ^~~~~~~~
main.cpp:81:1: error: ‘vector’ does not name a type; did you mean ‘perror’?
 vector<int> kirai, res;
 ^~~~~~
 perror
main.cpp: In function ‘bool check()’:
main.cpp:85:8: error: ‘kirai’ was not declared in this scope
     if(kirai[i] == res[i]) { return false; }
        ^~~~~
main.cpp:85:20: error: ‘res’ was not declared in this scope
     if(kirai[i] == res[i]) { return false; }
                    ^~~
main.cpp:85:20: note: suggested alternative: ‘gets’
     if(kirai[i] == res[i]) { return false; }
                    ^~~
                    gets
main.cpp: In function ‘int main()’:
main.cpp:92:3: error: ‘vector’ was not declared in this scope
   vector<unsigned int> init;
   ^~~~~~
main.cpp:92:3: note: ‘std::vector’ is defined in header ‘<vector>’; did you forget to ‘#include <vector>’?
main.cpp:92:10: error: expected primary-expression before ‘unsigned’
   vector<unsigned int> init;
          ^~~~~~~~
main.cpp:93:3: error: ‘init’ was not declared in this scope
   init.push_back(0x123);
   ^~~~
main.cpp:93:3: note: suggested alternative: ‘int’
   init.push_back(0x123);
   ^~~~
   int
main.cpp:98:3: error: ‘init_by_array’ was not declared in this scope
   init_by_array(init);
   ^~~~~~~~~~~~~
main.cpp:100:3: error: ‘kirai’ was not declared in this scope
   kirai

ソースコード

diff #

#include <iostream>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int N = 624;
const int M = 397;
const unsigned int MATRIX_A   = 0x9908b0dfU;
const unsigned int UPPER_MASK = 0x80000000U;
const unsigned int LOWER_MASK = 0x7fffffffU;

static unsigned int mt[N];
static int mti = N + 1;

void init_genrand(unsigned int s) {
  mt[0] = s & 0xffffffffU;
  for(mti=1; mti<N; mti++) {
    mt[mti] = (1812433253U * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
    mt[mti] &= 0xffffffffU;
  }
}

void init_by_array(vector<unsigned int> init_key) {
  int key_length = init_key.size();
  init_genrand(19880731U); // まいぷる
  int i = 1, j = 0;
  int k = N > key_length ? N : key_length;
  for( ; k; k--) {
    mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525U)) + init_key[j] + j;
    mt[i] &= 0xffffffffU;
    i++; j++;
    if(i >= N) { mt[0] = mt[N-1]; i = 1; }
    if(j >= key_length) { j = 0; }
  }
  for(k=N-1; k; k--) {
    mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941U)) - i;
    mt[i] &= 0xffffffffU;
    i++;
    if(i >= N) { mt[0] = mt[N-1]; i = 1; }
  }
  mt[0] = 0x80000000U;
}

unsigned int genrand_int32(void) {
  unsigned int y;
  static unsigned int mag01[2] = {0x0U, MATRIX_A};
  if(mti >= N) {
    if(mti == N + 1) { init_genrand(5489U); }
    int kk;
    for(kk=0; kk<N-M; kk++) {
      y = (mt[kk] & UPPER_MASK) | (mt[kk+1] & LOWER_MASK);
      mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1U];
    }
    for(; kk<N-1; kk++) {
      y = (mt[kk] & UPPER_MASK) | (mt[kk+1] & LOWER_MASK);
      mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1U];
    }
    y = (mt[N-1] & UPPER_MASK) | (mt[0] & LOWER_MASK);
    mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1U];
    mti = 0;
  }
  y = mt[mti++];
  y ^= (y >> 11);
  y ^= (y << 7) & 0x9d2c5680U;
  y ^= (y << 15) & 0xefc60000U;
  y ^= (y >> 18);
  return y;
}

int genrand_int31(void) {
  return (int)(genrand_int32() >> 1);
}

double genrand_real2(void) {
  return genrand_int32()*(1.0/4294967296.0); 
}

int n;
vector<int> kirai, res;

bool check() {
  for(int i : range(n)) {
    if(kirai[i] == res[i]) { return false; }
  }
  return true;
}

int main(void) {
  time_t seed = time(0);
  vector<unsigned int> init;
  init.push_back(0x123);
  init.push_back(0x234);
  init.push_back(0x345);
  init.push_back(0x456);
  init.push_back(seed);
  init_by_array(init);
  scanf("%d", &n);
  kirai.assign(n, 0);
  res.assign(n, 0);
  for(int i : range(n)) {
    scanf("%d", &kirai[i]);
    res[i] = i;
  }
  bool ok = false;
  for(int loop : range(100000)) {
    for(int i : range(n)) {
      if(kirai[i] == res[i]) {
        unsigned int p = genrand_int32() % n;
        swap(res[i], res[p]);
      }
    }
    if(check()) { ok = true; break; }
  }
  if(!ok) { puts("-1"); return 0; }
  for(int i : range(n)) {
    printf("%d\n", res[i]);
  }
  return 0;
}
0