提出 #21224362

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;

const int mod = 1e9 + 7, N = 1e5 + 10;
int n, m, p[N];

int add(int x, int y) { return (x + y) % mod; }
int sub(int x, int y) { return (x - y + mod) % mod; }
int mul(int x, int y) { return 1ll * x * y % mod; }
void Add(int &x, int y) { x = (x + y) % mod; }
void Sub(int &x, int y) { x = (x - y + mod) % mod; }
void Mul(int &x, int y) { x = 1ll * x * y % mod; }
int qpow(int a, int b) { int ret = 1; for (; b; b >>= 1, Mul(a, a)) if (b & 1) Mul(ret, a); return ret; }

struct mat {
    int x[5][5];
    mat() {
        memset(x, 0, sizeof(x));
    }
    friend mat operator * (mat a, mat b) {
        mat c;
        rep(i, 0, 2) rep(k, 0, 2) rep(j, 0, 2) Add(c.x[i][j], mul(a.x[i][k], b.x[k][j]));
        return c;
    }
    friend mat operator ^ (mat a, int b) {
        mat ret;
        rep(i, 0, 2) ret.x[i][i] = 1;
        for (; b; b >>= 1, a = a * a) if (b & 1) ret = ret * a;
        return ret;
    }
} A, B, ans;

int main() {
    cin >> n >> m;
    rep(i, 1, m) {
        scanf("%d", &p[i]);
    } sort(p + 1, p + m + 1);

    A.x[0][0] = A.x[1][0] = A.x[1][1] = A.x[2][0] = A.x[2][2] = 1, A.x[2][1] = 2;
    B = A;
    rep(i, 0, 2) ++B.x[i][2];

    ans.x[0][2] = 1;
    rep(i, 1, m) {
        ans = ans * (B ^ (p[i] - p[i - 1] - 1));
        ans = ans * A;
    }
    ans = ans * (B ^ (n - p[m]));
    printf("%d\n", ans.x[0][0]);
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:37:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   37 |         scanf("%d", &p[i]);
      |         ~~~~~^~~~~~~~~~~~~

ジャッジ結果