# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
636838 | 2022-08-30T10:01:09 Z | drkarlicio2107 | Boat (APIO16_boat) | C++14 | 2000 ms | 16252 KB |
#include <bits/stdc++.h> using namespace std; long long int mod=1e9+7; pair <long long int, long long int> l [1000]; long long int dp [2][1000010]; vector < pair < pair< int, int> , pair <int, int> > > s; int dulj [1000010]; int main(){ long long int n; cin >> n; for (int i=0; i<n; i++){ long long int a,b; cin >> a >> b; l [i].first=a; l[i].second=b; s.push_back ({{a, b}, {i, 0}}); dulj [i]=b-a+1; } s.push_back ({{0, 0}, {0, 0}}); sort (s.begin(), s.end()); for (int i=1; i<s.size(); i++){ if (l [s[i].second.first].first>l [s[i-1].second.first].second){ l [s[i].second.first].first=l [s[i-1].second.first].second+1; l [s[i].second.first].second=dulj [s[i].second.first]+l [s[i].second.first].first; } } dp [0][0]=1; for (int j=1; j<1000010; j++) dp [0][j]+=dp [0][j-1]; for (int i=0; i<n; i++){ for (int j=l [i].first; j<=l [i].second; j++){ dp [1][j]=(dp [1][j]+dp [0][j-1])%mod; //cout << dp [1][j] << endl; } dp [1][0]=(dp [1][0]+dp [0][1000009])%mod; for (int j=1; j<1000010; j++){ //cout << dp [1][j] << " "; dp[1][j]=(dp [1][j]+dp [1][j-1])%mod; //cout << dp [1][j] << endl; } //cout << endl; swap (dp [0], dp [1]); for (int j=0; j<1000010; j++) dp [1][j]=0; } cout << (dp [0][1000009]-1)%mod << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2068 ms | 15956 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2068 ms | 15956 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 12 ms | 16252 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2068 ms | 15956 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |