oj.uz

답안 #306981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
306981 2020-09-26T16:05:26 Z MarcoMeijer Boat (APIO16_boat) C++14
100 / 100
 1440 ms 8448 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//

// mod library
ll MOD=1e9+7;

inline ll mod(ll x_) {
    return (x_)%MOD;
}
ll modpow(ll x_, ll N_) {
    if(N_ == 0) return 1;
    ll a = modpow(x_,N_/2);
    a = (a*a)%MOD;
    if(N_%2) a = (a*x_)%MOD;
    return a;
}
ll inv(ll x_) {
    return modpow(x_, MOD-2);
}
class mi {
public:
    mi(ll v=0) {value = v;}
    mi  operator+ (ll rs) {return value+rs;}
    mi  operator- (ll rs) {return mod(value-rs+MOD);}
    mi  operator* (ll rs) {return mod(value*rs);}
    mi  operator/ (ll rs) {return mod(value*inv(rs));}
    mi& operator+=(ll rs) {*this = (*this)+rs; return *this;}
    mi& operator-=(ll rs) {*this = (*this)-rs; return *this;}
    mi& operator*=(ll rs) {*this = (*this)*rs; return *this;}
    mi& operator/=(ll rs) {*this = (*this)/rs; return *this;}
    operator ll&() {return value;}

    ll value;
};
typedef vector<mi> vmi;

//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1010;

int n, m;
int a[MX], b[MX];
mi dp[MX][MX];
mi DIV[MX];
vi cc;
ll len[MX];

mi get(int i, int j) {
    if(i < 0) return 1;
    if(j < 0) return 0;
    return dp[i][j];
}

void program() {
    IN(n);
    RE(i,n) IN(a[i], b[i]);
    RE(i,n) b[i]++;

    // coördinate compression
    RE(i,n) cc.pb(a[i]), cc.pb(b[i]);
    sort(all(cc));
    cc.erase(unique(all(cc)),cc.end());
    RE(i,n) a[i] = lower_bound(all(cc),a[i])-cc.begin();
    RE(i,n) b[i] = lower_bound(all(cc),b[i])-cc.begin();
    m = cc.size();

    RE(i,m-1) len[i] = cc[i+1]-cc[i];
    RE(i,MX) DIV[i] = mi(1)/mi(i);

    RE(i,n) RE(j,m) {
        dp[i][j] = get(i,j-1);
        if(a[i] <= j && j < b[i]) {
            ll inRange = 1;
            mi mult = len[j];
            REV(k,-1,i) {
                dp[i][j] += get(k,j-1)*mult;
                if(k == -1) continue;
                if(a[k] <= j && j < b[k]) {
                    mult *= mi(inRange+len[j])*DIV[inRange+1];
                    inRange++;
                }
            }
            dp[i][j] %= MOD;
        }
    }

    mi ans = 0;
    RE(i,n) ans += dp[i][m-1];
    ans %= MOD;
    OUTL((ll)ans);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8320 KB Output is correct
2 Correct 8 ms 8320 KB Output is correct
3 Correct 8 ms 8320 KB Output is correct
4 Correct 8 ms 8320 KB Output is correct
5 Correct 8 ms 8320 KB Output is correct
6 Correct 9 ms 8320 KB Output is correct
7 Correct 9 ms 8320 KB Output is correct
8 Correct 8 ms 8320 KB Output is correct
9 Correct 8 ms 8320 KB Output is correct
10 Correct 7 ms 8320 KB Output is correct
11 Correct 8 ms 8412 KB Output is correct
12 Correct 8 ms 8320 KB Output is correct
13 Correct 8 ms 8320 KB Output is correct
14 Correct 7 ms 8320 KB Output is correct
15 Correct 8 ms 8320 KB Output is correct
16 Correct 7 ms 8320 KB Output is correct
17 Correct 6 ms 8320 KB Output is correct
18 Correct 7 ms 8320 KB Output is correct
19 Correct 7 ms 8320 KB Output is correct
20 Correct 7 ms 8320 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8320 KB Output is correct
2 Correct 8 ms 8320 KB Output is correct
3 Correct 8 ms 8320 KB Output is correct
4 Correct 8 ms 8320 KB Output is correct
5 Correct 8 ms 8320 KB Output is correct
6 Correct 9 ms 8320 KB Output is correct
7 Correct 9 ms 8320 KB Output is correct
8 Correct 8 ms 8320 KB Output is correct
9 Correct 8 ms 8320 KB Output is correct
10 Correct 7 ms 8320 KB Output is correct
11 Correct 8 ms 8412 KB Output is correct
12 Correct 8 ms 8320 KB Output is correct
13 Correct 8 ms 8320 KB Output is correct
14 Correct 7 ms 8320 KB Output is correct
15 Correct 8 ms 8320 KB Output is correct
16 Correct 7 ms 8320 KB Output is correct
17 Correct 6 ms 8320 KB Output is correct
18 Correct 7 ms 8320 KB Output is correct
19 Correct 7 ms 8320 KB Output is correct
20 Correct 7 ms 8320 KB Output is correct
21 Correct 508 ms 8404 KB Output is correct
22 Correct 493 ms 8404 KB Output is correct
23 Correct 441 ms 8440 KB Output is correct
24 Correct 506 ms 8400 KB Output is correct
25 Correct 498 ms 8440 KB Output is correct
26 Correct 921 ms 8440 KB Output is correct
27 Correct 952 ms 8404 KB Output is correct
28 Correct 924 ms 8440 KB Output is correct
29 Correct 923 ms 8320 KB Output is correct
30 Correct 9 ms 8320 KB Output is correct
31 Correct 9 ms 8320 KB Output is correct
32 Correct 9 ms 8320 KB Output is correct
33 Correct 9 ms 8320 KB Output is correct
34 Correct 9 ms 8320 KB Output is correct
35 Correct 9 ms 8320 KB Output is correct
36 Correct 9 ms 8320 KB Output is correct
37 Correct 9 ms 8320 KB Output is correct
38 Correct 9 ms 8320 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 8320 KB Output is correct
2 Correct 9 ms 8320 KB Output is correct
3 Correct 10 ms 8320 KB Output is correct
4 Correct 11 ms 8320 KB Output is correct
5 Correct 11 ms 8320 KB Output is correct
6 Correct 17 ms 8320 KB Output is correct
7 Correct 16 ms 8320 KB Output is correct
8 Correct 17 ms 8320 KB Output is correct
9 Correct 17 ms 8320 KB Output is correct
10 Correct 17 ms 8320 KB Output is correct
11 Correct 11 ms 8320 KB Output is correct
12 Correct 10 ms 8320 KB Output is correct
13 Correct 10 ms 8320 KB Output is correct
14 Correct 10 ms 8320 KB Output is correct
15 Correct 11 ms 8320 KB Output is correct
16 Correct 9 ms 8320 KB Output is correct
17 Correct 8 ms 8320 KB Output is correct
18 Correct 8 ms 8320 KB Output is correct
19 Correct 8 ms 8320 KB Output is correct
20 Correct 8 ms 8320 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8320 KB Output is correct
2 Correct 8 ms 8320 KB Output is correct
3 Correct 8 ms 8320 KB Output is correct
4 Correct 8 ms 8320 KB Output is correct
5 Correct 8 ms 8320 KB Output is correct
6 Correct 9 ms 8320 KB Output is correct
7 Correct 9 ms 8320 KB Output is correct
8 Correct 8 ms 8320 KB Output is correct
9 Correct 8 ms 8320 KB Output is correct
10 Correct 7 ms 8320 KB Output is correct
11 Correct 8 ms 8412 KB Output is correct
12 Correct 8 ms 8320 KB Output is correct
13 Correct 8 ms 8320 KB Output is correct
14 Correct 7 ms 8320 KB Output is correct
15 Correct 8 ms 8320 KB Output is correct
16 Correct 7 ms 8320 KB Output is correct
17 Correct 6 ms 8320 KB Output is correct
18 Correct 7 ms 8320 KB Output is correct
19 Correct 7 ms 8320 KB Output is correct
20 Correct 7 ms 8320 KB Output is correct
21 Correct 508 ms 8404 KB Output is correct
22 Correct 493 ms 8404 KB Output is correct
23 Correct 441 ms 8440 KB Output is correct
24 Correct 506 ms 8400 KB Output is correct
25 Correct 498 ms 8440 KB Output is correct
26 Correct 921 ms 8440 KB Output is correct
27 Correct 952 ms 8404 KB Output is correct
28 Correct 924 ms 8440 KB Output is correct
29 Correct 923 ms 8320 KB Output is correct
30 Correct 9 ms 8320 KB Output is correct
31 Correct 9 ms 8320 KB Output is correct
32 Correct 9 ms 8320 KB Output is correct
33 Correct 9 ms 8320 KB Output is correct
34 Correct 9 ms 8320 KB Output is correct
35 Correct 9 ms 8320 KB Output is correct
36 Correct 9 ms 8320 KB Output is correct
37 Correct 9 ms 8320 KB Output is correct
38 Correct 9 ms 8320 KB Output is correct
39 Correct 11 ms 8320 KB Output is correct
40 Correct 9 ms 8320 KB Output is correct
41 Correct 10 ms 8320 KB Output is correct
42 Correct 11 ms 8320 KB Output is correct
43 Correct 11 ms 8320 KB Output is correct
44 Correct 17 ms 8320 KB Output is correct
45 Correct 16 ms 8320 KB Output is correct
46 Correct 17 ms 8320 KB Output is correct
47 Correct 17 ms 8320 KB Output is correct
48 Correct 17 ms 8320 KB Output is correct
49 Correct 11 ms 8320 KB Output is correct
50 Correct 10 ms 8320 KB Output is correct
51 Correct 10 ms 8320 KB Output is correct
52 Correct 10 ms 8320 KB Output is correct
53 Correct 11 ms 8320 KB Output is correct
54 Correct 9 ms 8320 KB Output is correct
55 Correct 8 ms 8320 KB Output is correct
56 Correct 8 ms 8320 KB Output is correct
57 Correct 8 ms 8320 KB Output is correct
58 Correct 8 ms 8320 KB Output is correct
59 Correct 723 ms 8320 KB Output is correct
60 Correct 661 ms 8440 KB Output is correct
61 Correct 630 ms 8440 KB Output is correct
62 Correct 746 ms 8444 KB Output is correct
63 Correct 701 ms 8320 KB Output is correct
64 Correct 1425 ms 8412 KB Output is correct
65 Correct 1440 ms 8440 KB Output is correct
66 Correct 1439 ms 8408 KB Output is correct
67 Correct 1418 ms 8440 KB Output is correct
68 Correct 1436 ms 8400 KB Output is correct
69 Correct 624 ms 8440 KB Output is correct
70 Correct 615 ms 8440 KB Output is correct
71 Correct 613 ms 8440 KB Output is correct
72 Correct 652 ms 8320 KB Output is correct
73 Correct 664 ms 8440 KB Output is correct
74 Correct 117 ms 8320 KB Output is correct
75 Correct 114 ms 8448 KB Output is correct
76 Correct 118 ms 8320 KB Output is correct
77 Correct 116 ms 8320 KB Output is correct
78 Correct 120 ms 8408 KB Output is correct