#989304 (C++17) No.2744 Power! or +1

• 問題: No.2744 Power! or +1
• ユーザー: tnakao0123
• 提出日時: 2024-06-17 15:41:02
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,082 bytes
• コンパイル時間: 609 ms
• コンパイル使用メモリ: 62,844 KB
• 最終ジャッジ日時: 2025-02-21 23:06:04
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 6 WA * 3

コンパイルメッセージ

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

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/* -*- coding: utf-8 -*-
 *
 * 2744.cc:  No.2744 Power! or +1 - yukicoder
 */
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<utility>
 
using namespace std;
/* constant */
const int MAX_N = 200000;
const int MAX_N2 = MAX_N * 2;
const long long LINF = 1LL << 62;
/* typedef */
using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using pii = pair<int,int>;
using vpii = vector<pii>;
using pli = pair<ll,int>;
/* global variables */
ll ds[MAX_N2];
bool fgs[MAX_N2];
int fs[MAX_N2];
/* subroutines */
inline void setmin(ll &a, ll b) { if (a > b) a = b; }
template <typename T>
T gcd(T m, T n) {  // m >= 0, n >= 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}
/* main */
int main() {
  int n, a, b, c;
  scanf("%d%d%d%d", &n, &a, &b, &c);
  int n2 = n * 2;
  ll b2 = (ll)b * b, b3 = b2 * b;
  for (int i = 2, r = n; i < n2; i++) {
    if (r > 1) r /= gcd(i, n);
    fgs[i] = (r == 1);
  }
  fs[0] = fs[1] = 1;
  for (int i = 2; i < n2; i++) {
    ll f = (ll)fs[i - 1] * i;
    fs[i] = (f < n) ? f : n + (f % n);
  }
  
  fill(ds, ds + n2, LINF);
  ds[1] = 0;
  priority_queue<pli> q;
  q.push({0, 1});
  ll mind = LINF;
  while (! q.empty()) {
    auto [ud, u] = q.top(); q.pop();
    ud = -ud;
    //printf(" u=%d, ud=%lld\n", u, ud);
    if (ds[u] != ud) continue;
    
    if (u == n) {
      mind = ud;
      break;
    }
    // op 1
    {
      int v = u + 1;
      if (v >= n2) v = n + (v % n);
      ll vd = ud + a;
      if (ds[v] > vd) ds[v] = vd, q.push({-vd, v});
    }
    // op 2
    {
      ll v2 = (ll)u * u, v3 = v2 * u;
      if (v2 >= n2) v2 = n + (v2 % n);
      if (v3 >= n2) v3 = n + (v3 % n);
      ll vd2 = ud + b2, vd3 = ud + b3;
      if (ds[v2] > vd2) ds[v2] = vd2, q.push({-vd2, v2});
      if (ds[v3] > vd3) ds[v3] = vd3, q.push({-vd3, v3});
    }
    // op 3
    {
      int v = fgs[u] ? n : fs[u];
      ll vd = ud + c;
      if (ds[v] > vd) ds[v] = vd, q.push({-vd, v});
    }
  }
  
  printf("%lld\n", mind);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX