Submission #1027001

#TimeUsernameProblemLanguageResultExecution timeMemory
1027001_8_8_Boat (APIO16_boat)C++17
0 / 100
1793 ms2396 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e6 + 2, MOD = (int)1e9+7; int dp[N],n; ll a[N]; void test(){ cin >> n; 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 + 1; a[j] %= MOD; } } if(i == n){ s = 0; for(int j = 0;j < N;j++){ s += a[j]; s %= MOD; } cout << s; return; } } } int main() { ios_base::sync_with_stdio(false);cin.tie(0); int t = 1; // cin >> t; while(t--){ test(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...