| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 268708 |
2020-08-16T19:26:37 Z |
test2 |
Boat (APIO16_boat) |
C++14 |
|
491 ms |
25880 KB |
#include<bits/stdc++.h>
#define I inline void
using ll = long long ;
using ld = long double ;
using namespace std ;
const int N = 5000 + 7 , mod = 1e9 + 7 ;
// how interesting!
int n;
ll ans ;
map<int , int > used ;
set<pair<int , int> > st ;
vector<pair<int , int> > v ;
I add(int u , int v){
while(u <=v && used[u])u++ ;
while(v>=u&&used[v])v-- ;
if(u <=v){
used[u] = used[v] = 1;
st.insert({u , v}) ;
}
}
vector<int> onepiece[N * 10] ;
std::vector<int> szs[N * 10];
ll dp[N][505] ;
ll mul(ll a , ll b){
return (1ll * a * b) %mod ;
}
ll solve(int i , int j){
if(dp[i][j]!=-1)
return dp[i][j] ;
if(i == (int) st.size())
return 1;
ll ret = solve(i+1 , j ) ;
int pos = 0 ;
for(auto u : onepiece[i]){
if(u > j){
ll add = mul( szs[i][pos] , solve(i+1, u) ) ;
ret = (ret + add) %mod ;
}
pos ++ ;
}
return dp[i][j] = ret ;
}
ll conts[N] ;
int main(){
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
memset(dp , -1 , sizeof dp) ;
//freopen("in.in" , "r" , stdin) ;
cin >> n;
set<int> ev ;
for(int i = 0 ;i < n;i++){
int x , y ;
cin >> x >> y ;
ev.insert(x) ;
ev.insert(y) ;
used[x] = used[y] = 1;
st.insert({x , x}) ;
st.insert({y , y}) ;
//for(int j =x ;j <= y ;j ++)
// st.push_back({j , j}) ;
v.push_back({x , y}) ;
}
int l = 0 ;
for(auto u : ev){
if(l){
add(l+1 , u - 1) ;
}
l = u ;
}
int pos = 0 ;
for(auto u : st){
for(int j = 0 ;j < n; j++){
if( u.first>= v[j].first && u.second <= v[j].second ){
onepiece[pos].push_back(j + 1) ;
szs[pos].push_back( u.second - u.first +1 ) ;
conts[j] += u.second - u.first + 1 ;
}
}
pos ++ ;
}
for(int i = 0 ;i < n;i++){
assert((conts[i] == v[i].second - v[i].first + 1)) ;
}
cout<< (mod + solve(0 , 0 ) -1 ) %mod ;
return 0 ;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 2 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 3 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 4 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 5 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 6 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 7 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 8 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 9 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 10 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 11 |
Correct |
26 ms |
22904 KB |
Output is correct |
| 12 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 13 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 14 |
Correct |
25 ms |
22784 KB |
Output is correct |
| 15 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 16 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 17 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 18 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 19 |
Correct |
19 ms |
22528 KB |
Output is correct |
| 20 |
Correct |
16 ms |
22528 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 2 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 3 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 4 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 5 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 6 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 7 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 8 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 9 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 10 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 11 |
Correct |
26 ms |
22904 KB |
Output is correct |
| 12 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 13 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 14 |
Correct |
25 ms |
22784 KB |
Output is correct |
| 15 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 16 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 17 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 18 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 19 |
Correct |
19 ms |
22528 KB |
Output is correct |
| 20 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 21 |
Incorrect |
491 ms |
25880 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
22 ms |
22784 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 2 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 3 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 4 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 5 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 6 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 7 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 8 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 9 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 10 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 11 |
Correct |
26 ms |
22904 KB |
Output is correct |
| 12 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 13 |
Correct |
22 ms |
22784 KB |
Output is correct |
| 14 |
Correct |
25 ms |
22784 KB |
Output is correct |
| 15 |
Correct |
20 ms |
22784 KB |
Output is correct |
| 16 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 17 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 18 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 19 |
Correct |
19 ms |
22528 KB |
Output is correct |
| 20 |
Correct |
16 ms |
22528 KB |
Output is correct |
| 21 |
Incorrect |
491 ms |
25880 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
