oj.uz

Submission #1027004

# Submission time Handle Problem Language Result Execution time Memory
1027004 2024-07-18T18:06:44 Z _8_8_ Boat (APIO16_boat) C++17
0 / 100
 1830 ms 2396 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
const int  N = 1e6 + 20, MOD = (int)1e9+7;

int dp[N],n;
ll a[N];
void test(){
    cin >> n;
    a[0] = 1;
    for(int i = 1;i <= n;i++){
        int l,r;
        cin >> l >> r;
        ll s =0;
        for(int j = 0;j < N;j++){
            s += a[j];
            s %= MOD;
            if(j >= l && j <= r){
                a[j] = s;
            }
        }
        if(i == n){
            s = 0;
            for(int j = 0;j < N;j++){
                s += a[j];
                s %= MOD;
            }
            cout << (s-1+MOD)%MOD;
            return;
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--){
        test();
    }
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

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