#36524 (C++11(old_compat)) No.241 出席番号(1)

• 問題: No.241 出席番号(1)
• ユーザー: yuppe19 😺
• 提出日時: 2015-07-14 14:31:00
• 言語: C++11(old_compat) (gcc 12.4.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 12 ms / 2,000 ms
• コード長: 3,318 bytes
• コンパイル時間: 1,164 ms
• コンパイル使用メモリ: 174,436 KB
• 実行使用メモリ: 7,844 KB
• 最終ジャッジ日時: 2026-03-08 16:02:59
• 合計ジャッジ時間: 2,497 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 29

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:110:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  110 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
main.cpp:114:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  114 |     scanf("%d", &kirai[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~

ソースコード

#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); 
}

// knuth shuffle
template<class T>
void shuffle(vector<T> &v) {
  int n = v.size();
  for(unsigned int i=n-1; i>=1; --i) {
    unsigned int k = genrand_int32() % (i + 1);
    if(k == i) { continue; }
    swap(v[k], v[i]);
  }
}

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;
  }
  shuffle(res);
  bool ok = false;
  for(int loop : range(100000)) {
    for(int i : range(n)) {
      if(kirai[i] == res[i]) {
        unsigned int p = genrand_int31() % 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;
}