제출 #1361879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1361879		edo	Monster-Go (EGOI25_monstergo)	C++20	8 / 100	1 ms	836 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int nax = 2500;
vector<int> p[nax];
mt19937
    rng((unsigned int)chrono::steady_clock::now().time_since_epoch().count());

// metoda uzaludnih pokusaja
// bilo bi zanimljivo da prodje
void prepare() {
  for (int i = 0; i < nax; ++i) {
    p[i].assign(50, 0);
    iota(p[i].begin(), p[i].end(), 0);
    shuffle(p[i].begin(), p[i].end(), rng);
  }
}

vector<int> get_random_12() {
  int id = rng() % nax;
  vector<int> v;
  for (int i = 0; i < 12; ++i) {
    v.emplace_back(p[id][i]);
  }
  ranges::sort(v);
  return v;
}

void print_vec(vector<int> v) {
  ranges::sort(v);
  v.erase(unique(v.begin(), v.end()), v.end());
  while (v.size() < 12) {
    int x = rng() % 50;
    if (!count(v.begin(), v.end(), x))
      v.push_back(x);
  }
  ranges::sort(v);
  for (auto x : v)
    cout << x << " ";
  cout << "\n";
}

void solve(int n) {
  if (n <= 4) {
    for (int i = 0, num = 0; i < n; ++i) {
      for (int j = 0; j < 12; ++j) {
        cout << num++ << " ";
      }
      cout << "\n";
    }
    return;
  }

  int done = 0;
  while (n - done >= 4) {
    int id = rng() % nax;
    vector<int> base(16);
    for (int i = 0; i < 16; ++i) {
      base[i] = p[id][i];
    }
    array<vector<int>, 4> ans;
    vector<int> miss = {0, 1, 2, 3};
    shuffle(miss.begin(), miss.end(), rng);
    for (int who = 0; who < 4; ++who) {
      for (int j = 0; j < 16; ++j) {
        if (j % 4 != miss[who])
          ans[who].push_back(base[j]);
      }
    }

    for (int who = 0; who < 4; ++who) {
      print_vec(ans[who]);
    }

    done += 4;
  }

  while (done < n) {
    print_vec(get_random_12());
    done++;
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin >> n;
  prepare();
  solve(n);
  // for (int i = 5; i < n; ++i) {
  //   solve(i);
  // }

  return 0;
}

• 서브태스크 1: 8 / 100