結果

問題 No.5018 Let's Make a Best-seller Book
ユーザー Shun_PIShun_PI
提出日時 2023-10-01 15:32:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 33 ms / 400 ms
コード長 3,531 bytes
コンパイル時間 2,886 ms
コンパイル使用メモリ 194,672 KB
実行使用メモリ 24,492 KB
スコア 51,489
平均クエリ数 52.00
最終ジャッジ日時 2023-10-01 15:32:47
合計ジャッジ時間 10,648 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
24,012 KB
testcase_01 AC 28 ms
23,364 KB
testcase_02 AC 28 ms
23,652 KB
testcase_03 AC 28 ms
23,388 KB
testcase_04 AC 28 ms
24,036 KB
testcase_05 AC 28 ms
24,024 KB
testcase_06 AC 28 ms
23,424 KB
testcase_07 AC 28 ms
23,364 KB
testcase_08 AC 28 ms
23,400 KB
testcase_09 AC 29 ms
23,388 KB
testcase_10 AC 28 ms
23,520 KB
testcase_11 AC 28 ms
23,640 KB
testcase_12 AC 28 ms
23,376 KB
testcase_13 AC 28 ms
24,360 KB
testcase_14 AC 28 ms
24,348 KB
testcase_15 AC 28 ms
23,532 KB
testcase_16 AC 28 ms
23,376 KB
testcase_17 AC 28 ms
24,492 KB
testcase_18 AC 28 ms
24,048 KB
testcase_19 AC 28 ms
23,640 KB
testcase_20 AC 27 ms
24,276 KB
testcase_21 AC 27 ms
23,628 KB
testcase_22 AC 28 ms
24,036 KB
testcase_23 AC 28 ms
24,024 KB
testcase_24 AC 29 ms
23,652 KB
testcase_25 AC 28 ms
23,820 KB
testcase_26 AC 28 ms
23,844 KB
testcase_27 AC 28 ms
23,412 KB
testcase_28 AC 28 ms
23,616 KB
testcase_29 AC 28 ms
23,664 KB
testcase_30 AC 28 ms
23,640 KB
testcase_31 AC 28 ms
23,376 KB
testcase_32 AC 28 ms
24,012 KB
testcase_33 AC 28 ms
24,060 KB
testcase_34 AC 28 ms
23,508 KB
testcase_35 AC 28 ms
24,048 KB
testcase_36 AC 28 ms
24,024 KB
testcase_37 AC 28 ms
24,012 KB
testcase_38 AC 28 ms
24,048 KB
testcase_39 AC 29 ms
24,048 KB
testcase_40 AC 28 ms
23,844 KB
testcase_41 AC 29 ms
23,388 KB
testcase_42 AC 28 ms
23,820 KB
testcase_43 AC 27 ms
23,376 KB
testcase_44 AC 29 ms
24,360 KB
testcase_45 AC 27 ms
24,264 KB
testcase_46 AC 28 ms
23,640 KB
testcase_47 AC 29 ms
24,372 KB
testcase_48 AC 29 ms
24,204 KB
testcase_49 AC 29 ms
23,532 KB
testcase_50 AC 28 ms
23,988 KB
testcase_51 AC 28 ms
24,360 KB
testcase_52 AC 28 ms
24,060 KB
testcase_53 AC 28 ms
23,400 KB
testcase_54 AC 28 ms
24,324 KB
testcase_55 AC 29 ms
23,712 KB
testcase_56 AC 28 ms
23,664 KB
testcase_57 AC 28 ms
23,412 KB
testcase_58 AC 28 ms
23,832 KB
testcase_59 AC 29 ms
24,024 KB
testcase_60 AC 29 ms
23,520 KB
testcase_61 AC 29 ms
23,424 KB
testcase_62 AC 29 ms
24,396 KB
testcase_63 AC 28 ms
23,520 KB
testcase_64 AC 28 ms
24,360 KB
testcase_65 AC 29 ms
23,844 KB
testcase_66 AC 28 ms
23,376 KB
testcase_67 AC 28 ms
24,384 KB
testcase_68 AC 28 ms
23,652 KB
testcase_69 AC 28 ms
23,652 KB
testcase_70 AC 28 ms
23,376 KB
testcase_71 AC 29 ms
23,652 KB
testcase_72 AC 28 ms
23,652 KB
testcase_73 AC 28 ms
24,048 KB
testcase_74 AC 28 ms
23,376 KB
testcase_75 AC 27 ms
23,664 KB
testcase_76 AC 28 ms
23,376 KB
testcase_77 AC 29 ms
24,276 KB
testcase_78 AC 27 ms
23,640 KB
testcase_79 AC 28 ms
23,388 KB
testcase_80 AC 28 ms
23,820 KB
testcase_81 AC 28 ms
24,048 KB
testcase_82 AC 28 ms
23,400 KB
testcase_83 AC 28 ms
24,012 KB
testcase_84 AC 28 ms
23,844 KB
testcase_85 AC 28 ms
23,532 KB
testcase_86 AC 28 ms
23,520 KB
testcase_87 AC 28 ms
24,012 KB
testcase_88 AC 28 ms
24,360 KB
testcase_89 AC 28 ms
23,832 KB
testcase_90 AC 29 ms
24,024 KB
testcase_91 AC 28 ms
23,376 KB
testcase_92 AC 29 ms
23,544 KB
testcase_93 AC 28 ms
23,832 KB
testcase_94 AC 27 ms
23,424 KB
testcase_95 AC 28 ms
24,048 KB
testcase_96 AC 28 ms
23,664 KB
testcase_97 AC 28 ms
23,412 KB
testcase_98 AC 28 ms
23,640 KB
testcase_99 AC 28 ms
24,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
constexpr bool DEBUG = false;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T, N, Money;
  cin >> T >> N;
  if(!DEBUG) cin >> Money;
  else Money = 2000000;
  vector<int> R(N), P(N);
  vector<double> D(N);
  if(DEBUG) REP(i, N) cin >> D[i];
  vector<vector<double>> Z(T, vector<double>(N));
  if(DEBUG) REP(i, T) REP(j, N) cin >> Z[i][j];

  vector<double> weight(N);
  REP(i, N) weight[i] = 1.0 / N;

  int score = 0;
  REP(t, T) {
    /*
    cerr << t << endl;
    cerr << Money << endl;
    REP(i, N) cerr << R[i] << " ";
    cerr << endl;
    REP(i, N) cerr << P[i] << " ";
    cerr << endl;
    */

    int mode = 1;
    vector<int> L(N);
    int x = 1;

    // 行動を決める
    int MODE_CHANGE_TURN = 40;
    double THRESHOLD_D = min(1.0, 0.5 + 0.6 * t / T);
    double THRESHOLD_Z = 0.75;
    int limL = Money / 500 / N;
    if(t < MODE_CHANGE_TURN) {
      REP(i, N) {
        int l = 6;
        int r = 1e9;
        while(r-l > 1) {
          int m = (l+r)/2;
          if(sqrt(m) * pow(1.05, P[i]) * THRESHOLD_D * THRESHOLD_Z >= 0.3 * m) l = m;
          else r = m;
        }
        L[i] = max(0, l - R[i]);
        chmin(L[i], limL);
      }
    } else {
      REP(i, N) weight[i] = pow(1.3, P[i]);
      double weight_sum = 0;
      REP(i, N) weight_sum += weight[i];
      REP(i, N) weight[i] /= weight_sum;
      REP(i, N) L[i] = (int)(Money / 500 * weight[i]);
    }
    FOR(k, 4, 6) {
      if(Money >= 500000 * pow(2, k-1) + 2000000) {
        mode = 2;
        x = k;
      }
    }
    if(t == 0) {
      mode = 2;
      x = 2;
    }
    REP(i, N) assert(L[i] >= 0);

    cout << mode << " ";
    if(mode == 1) {
      REP(i, N) cout << L[i] << (i!=N-1 ? " " : "");
      REP(i, N) R[i] += L[i];
      REP(i, N) Money -= 500 * L[i];
    } else {
      cout << x;
      REP(i, N) P[i] = min(60, P[i] + x);
      Money -= 500000 * pow(2, x-1);
    }
    cout << endl;
    cout.flush();

    assert(Money >= 0);
    //cerr << Money << endl;

    vector<int> S(N);
    if(!DEBUG) {
      cin >> Money;
      if(Money == -1) {
        cerr << "Money is -1" << endl;
        return 0;
      }
      REP(i, N) cin >> S[i];
    }
    //結果の受け取り
    REP(i, N) {
      int s = S[i];
      if(DEBUG) s = min(R[i], (int)floor(sqrt(R[i]) * pow(1.05, P[i]) * D[i] * Z[t][i]));
      score += s;
      if(DEBUG) Money += 1000 * s;

      if(R[i] > 0) {
        if(s >= 0.3 * R[i]) P[i] = min(60, P[i] + 1);
        else if(s <= 0.1 * R[i]) P[i] = max(-60, P[i] - 1);
      }
      R[i] -= s;
    }

    if(!DEBUG) {
      REP(i, N) cin >> P[i];
      REP(i, N) cin >> R[i];
    }
  }
  cerr << score/100 << endl;
}
0