結果

問題 No.1837 Same but Different
ユーザー miscalc
提出日時 2022-02-12 00:14:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 2,434 bytes
コンパイル時間 2,173 ms
コンパイル使用メモリ 197,776 KB
最終ジャッジ日時 2025-01-27 22:27:45
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
int main()
{
  ll N;
  cin >> N;
  vector<ll> A(N), B(N);
  if (N % 3 == 2)
  {
    for (ll i = 0; i < N; i++)
    {
      A.at(i) = 3 * i + 1;
      B.at(i) = 3 * i + 6;
    }
    ll diff = 5 * N;
    A.at(N - 1) += 11, A.at(N - 2) += 11;
    diff -= 22;
    while (diff > 0)
    {
      for (ll i = N - 3; i >= 0 && diff > 0; i--, diff -= 3)
      {
        A.at(i) += 3;
      }
    }
  }
  else
  {
    for (ll i = 0; i < N; i++)
    {
      A.at(i) = 3 * i + 1;
      B.at(i) = 3 * i + 3;
    }
    ll diff = 2 * N;
    A.at(N - 1) += (N % 3 == 0 ? 6 : 5);
    diff -= (N % 3 == 0 ? 6 : 5);
    for (ll i = N - 2; diff > 0; i--, diff -= 3)
    {
      A.at(i) += 3;
    }
  }
  for (ll i = 0; i < N; i++)
  {
    cout << A.at(i) << (i == N - 1 ? '\n' : ' ');
  }
  for (ll i = 0; i < N; i++)
  {
    cout << B.at(i) << (i == N - 1 ? '\n' : ' ');
  }
  /*
  cerr << accumulate(A.begin(), A.end(), 0LL) << " ";
  cerr << accumulate(B.begin(), B.end(), 0LL) << endl;
  cerr << *max_element(A.begin(), A.end()) << " ";
  cerr << *max_element(B.begin(), B.end()) << endl;
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j < N; j++)
    {
      for (ll k = 0; k < N; k++)
      {
        for (ll l = 0; l < N; l++)
        {
          if (A.at(i) + A.at(j) == B.at(k) + B.at(l))
          {
            cerr << A.at(i) << " " << A.at(j) << "  " << B.at(k) << " " << B.at(l) << endl;
          }
        }
      }
    }
  }
  //*/
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0