Submission #516314

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
516314	2022-01-21T05:18:10 Z	PeppaPig	Boat (APIO16_boat)	C++14	Compilation error	0 ms	0 KB

boat

#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 1005;
const int M = 1e9+7;

long inv[N];

long modpow(long a, long b) {
    long ret = 1;
    for( ; b; b >>= 1) {
        if(b & 1) ret = (ret * a) % M;
        a = (a * a) % M;
    }
    return ret;
}

long mod(long a, int M) {
    while(a >= M) a -= M;
    return a;
}

int n, a[N], b[N];
long dp[N][N];
vector<int> coord;

int main() {
    for(int i = 1; i < N; i++) inv[i] = modpow(i, M-2);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d %d", a+i, b+i);
        coord.emplace_back(a[i]);
        coord.emplace_back(++b[i]);
    }
    sort(coord.begin(), coord.end());
    coord.resize(unique(coord.begin(), coord.end()) - coord.begin());
    for(int i = 1; i <= n; i++) {
        a[i] = lower_bound(coord.begin(), coord.end(), a[i]) - coord.begin() + 1;
        b[i] = lower_bound(coord.begin(), coord.end(), b[i]) - coord.begin() + 1;
    }
    for(int i = 0; i < N; i++) dp[0][i] = 1;
    for(int i = 1; i <= n; i++) {
        for(int j = a[i]; j < b[i]; j++) {
            long p = coord[j] - coord[j-1], cnt = 1;
            for(int k = i-1; ~k; k--) {
                dp[i][j] = mod(dp[i][j] + (p * dp[k][j-1]) % M, M);
                if(a[k] <= j && j < b[k]) {
                    ++cnt;
                    p = (p * (coord[j] - coord[j-1] + cnt - 1)) % M;
                    p = (p * inv[cnt]) % M;
                }
            }
        }
        for(int j = 1; j < N; j++) dp[i][j] = mod(dp[i][j] + dp[i][j-1]);
    }
    long ans = 0;
    for(int i = 1; i <= n; i++) ans = mod(ans + dp[i][N-1]);
    printf("%lld\n", ans);

    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:57:72: error: too few arguments to function 'long long int mod(long long int, int)'
   57 |         for(int j = 1; j < N; j++) dp[i][j] = mod(dp[i][j] + dp[i][j-1]);
      |                                                                        ^
boat.cpp:21:6: note: declared here
   21 | long mod(long a, int M) {
      |      ^~~
boat.cpp:60:59: error: too few arguments to function 'long long int mod(long long int, int)'
   60 |     for(int i = 1; i <= n; i++) ans = mod(ans + dp[i][N-1]);
      |                                                           ^
boat.cpp:21:6: note: declared here
   21 | long mod(long a, int M) {
      |      ^~~
boat.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
boat.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         scanf("%d %d", a+i, b+i);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~