oj.uz

Submission #494894

# Submission time Handle Problem Language Result Execution time Memory
494894 2021-12-17T10:09:10 Z XII Boat (APIO16_boat) C++17
0 / 100
 3 ms 2252 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ALL(x) (x).begin(), (x).end()

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORU(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define IOS cin.tie(0)->sync_with_stdio(false);
#define PROB "DUT03TEAMS"
void Fi(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp", "r", stdin);
        freopen(PROB".out", "w", stdout);
    }
}

const int N = 500 + 1;
const int MOD = 1e9 + 7;
int a[N], b[N], n, m;
int dp[N][N << 1], cnt;
int X[N << 1];
int inv[N];

int add(const int &a, const int &b){
    return (a + b >= MOD ? a + b - MOD : a + b);
}

int mul(const int &a, const int &b){
    return (1LL * a * b) % MOD;
}

void compress(){
    sort(X + 1, X + m + 1);
    cnt = unique(X + 1, X + m + 1) - X;
    FORU(i, 1, n){
        a[i] = lower_bound(X + 1, X + cnt, a[i]) - X;
        b[i] = lower_bound(X + 1, X + cnt, b[i]) - X;
//        cout << a[i] << " " << b[i] << "\n";
    }
    cnt -= 2;
    cout << cnt << "\n";
}

int main(){
    IOS;
    Fi();
    cin >> n;
    FORU(i, 1, n){
        cin >> a[i] >> b[i];
        X[++m] = a[i];
        X[++m] = ++b[i];
    }
    compress();

    inv[1] = 1;
    FORU(i, 2, n){
        inv[i] = mul(MOD - MOD / i, inv[MOD % i]);
    }

    FORU(j, 0, m) dp[0][j] = 1;

    int ans = 0;

    FORU(i, 1, n){
        FOR(j, a[i], b[i]){
            int len = X[j] - X[j - 1], nu = 1;

            int C = len;
            FORD(k, i - 1, 0){
                dp[i][j] = add(dp[i][j], mul(dp[k][j - 1], C));
                if(a[k] <= j && j < b[k]){
                    ++nu;
                    C = mul(mul(C, len + nu - 1), inv[nu]);
                }
            }
        }
        FORU(j, 2, cnt) dp[i][j] += dp[i][j - 1];
        ans = add(ans, dp[i][cnt]);
    }
    cout << ans;
    return 0;
}

Compilation message

boat.cpp: In function 'void Fi()':
boat.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen(PROB".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
boat.cpp:21:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |         freopen(PROB".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -