oj.uz

답안 #900384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900384 2024-01-08T08:15:28 Z Kutan Boat (APIO16_boat) C++14
100 / 100
 252 ms 5700 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 500 + 5;

int n, m;
int a[N], b[N];
int c[N][N];
int C[N * 2][N];
int inv[N];
int dp[N][N * 2] = {};
vector<int> seg;

void readip(){
    cin >> n;
    REP(i, 1, n) {
        cin >> a[i] >> b[i];
        seg.push_back(a[i] - 1);
        seg.push_back(b[i]);
    }
    sort(ALL(seg));
    seg.erase(unique(ALL(seg)), seg.end());
    m = seg.size() - 1;

    REP(i, 0, 500) {
        c[i][0] = 1;
        REP(j, 1, i) {
            c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]);
            if (c[i][j] >= mod) c[i][j] -= mod;
        }
    }

    REP(i, 0, 500) inv[i] = pw(i, mod - 2);

    REP(i, 1, m) {
        int len = seg[i] - seg[i - 1];
        C[i][0] = 1;
        REP(j, 1, n) {
            C[i][j] = 1LL * product(C[i][j - 1] , len + j - 1) * inv[j] % mod;
        }
    }
}

void solve(){   
    REP(i, 0, m) dp[0][i] = 1;
    int res = 0;
    REP(i, 1, n) {
        REP(j, 1, m) {
            if (a[i] <= seg[j - 1] + 1 && seg[j] <= b[i]) {
                int cnt = 0;
                REPD(k, i, 1) {
                    cnt += (a[k] <= seg[j - 1] + 1 && seg[j] <= b[k]);
                    add(dp[i][j], product(dp[k - 1][j - 1], C[j][cnt]));
                }
            }
            if (j > 1) add(dp[i][j], dp[i][j - 1]);
        }
        add(res, dp[i][m]);
    }

    cout << res << ln;
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

boat.cpp: In function 'void readip()':
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:149:5: note: in expansion of macro 'REP'
  149 |     REP(i, 1, n) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:158:5: note: in expansion of macro 'REP'
  158 |     REP(i, 0, 500) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:160:9: note: in expansion of macro 'REP'
  160 |         REP(j, 1, i) {
      |         ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:166:5: note: in expansion of macro 'REP'
  166 |     REP(i, 0, 500) inv[i] = pw(i, mod - 2);
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:168:5: note: in expansion of macro 'REP'
  168 |     REP(i, 1, m) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:171:9: note: in expansion of macro 'REP'
  171 |         REP(j, 1, n) {
      |         ^~~
boat.cpp: In function 'void solve()':
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:178:5: note: in expansion of macro 'REP'
  178 |     REP(i, 0, m) dp[0][i] = 1;
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:180:5: note: in expansion of macro 'REP'
  180 |     REP(i, 1, n) {
      |     ^~~
boat.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
boat.cpp:181:9: note: in expansion of macro 'REP'
  181 |         REP(j, 1, m) {
      |         ^~~
boat.cpp:93:29: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
boat.cpp:184:17: note: in expansion of macro 'REPD'
  184 |                 REPD(k, i, 1) {
      |                 ^~~~
boat.cpp: In function 'void file()':
boat.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
boat.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5468 KB Output is correct
2 Correct 8 ms 5332 KB Output is correct
3 Correct 8 ms 5468 KB Output is correct
4 Correct 8 ms 5336 KB Output is correct
5 Correct 9 ms 5300 KB Output is correct
6 Correct 8 ms 5468 KB Output is correct
7 Correct 9 ms 5464 KB Output is correct
8 Correct 8 ms 5468 KB Output is correct
9 Correct 8 ms 5468 KB Output is correct
10 Correct 8 ms 5468 KB Output is correct
11 Correct 8 ms 5468 KB Output is correct
12 Correct 9 ms 5332 KB Output is correct
13 Correct 8 ms 5336 KB Output is correct
14 Correct 8 ms 5464 KB Output is correct
15 Correct 8 ms 5468 KB Output is correct
16 Correct 3 ms 5468 KB Output is correct
17 Correct 4 ms 5468 KB Output is correct
18 Correct 3 ms 5468 KB Output is correct
19 Correct 4 ms 5336 KB Output is correct
20 Correct 3 ms 5468 KB Output is correct
21 Correct 163 ms 5444 KB Output is correct
22 Correct 150 ms 5464 KB Output is correct
23 Correct 141 ms 5444 KB Output is correct
24 Correct 154 ms 5440 KB Output is correct
25 Correct 173 ms 5212 KB Output is correct
26 Correct 222 ms 5208 KB Output is correct
27 Correct 223 ms 5448 KB Output is correct
28 Correct 220 ms 5700 KB Output is correct
29 Correct 218 ms 5444 KB Output is correct
30 Correct 9 ms 5468 KB Output is correct
31 Correct 9 ms 5248 KB Output is correct
32 Correct 9 ms 5464 KB Output is correct
33 Correct 10 ms 5336 KB Output is correct
34 Correct 10 ms 5468 KB Output is correct
35 Correct 9 ms 5464 KB Output is correct
36 Correct 9 ms 5468 KB Output is correct
37 Correct 10 ms 5468 KB Output is correct
38 Correct 11 ms 5296 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5468 KB Output is correct
2 Correct 8 ms 5332 KB Output is correct
3 Correct 8 ms 5468 KB Output is correct
4 Correct 8 ms 5336 KB Output is correct
5 Correct 9 ms 5300 KB Output is correct
6 Correct 8 ms 5468 KB Output is correct
7 Correct 9 ms 5464 KB Output is correct
8 Correct 8 ms 5468 KB Output is correct
9 Correct 8 ms 5468 KB Output is correct
10 Correct 8 ms 5468 KB Output is correct
11 Correct 8 ms 5468 KB Output is correct
12 Correct 9 ms 5332 KB Output is correct
13 Correct 8 ms 5336 KB Output is correct
14 Correct 8 ms 5464 KB Output is correct
15 Correct 8 ms 5468 KB Output is correct
16 Correct 3 ms 5468 KB Output is correct
17 Correct 4 ms 5468 KB Output is correct
18 Correct 3 ms 5468 KB Output is correct
19 Correct 4 ms 5336 KB Output is correct
20 Correct 3 ms 5468 KB Output is correct
21 Correct 163 ms 5444 KB Output is correct
22 Correct 150 ms 5464 KB Output is correct
23 Correct 141 ms 5444 KB Output is correct
24 Correct 154 ms 5440 KB Output is correct
25 Correct 173 ms 5212 KB Output is correct
26 Correct 222 ms 5208 KB Output is correct
27 Correct 223 ms 5448 KB Output is correct
28 Correct 220 ms 5700 KB Output is correct
29 Correct 218 ms 5444 KB Output is correct
30 Correct 9 ms 5468 KB Output is correct
31 Correct 9 ms 5248 KB Output is correct
32 Correct 9 ms 5464 KB Output is correct
33 Correct 10 ms 5336 KB Output is correct
34 Correct 10 ms 5468 KB Output is correct
35 Correct 9 ms 5464 KB Output is correct
36 Correct 9 ms 5468 KB Output is correct
37 Correct 10 ms 5468 KB Output is correct
38 Correct 11 ms 5296 KB Output is correct
39 Correct 3 ms 5212 KB Output is correct
40 Correct 3 ms 5212 KB Output is correct
41 Correct 3 ms 5324 KB Output is correct
42 Correct 3 ms 5212 KB Output is correct
43 Correct 3 ms 5212 KB Output is correct
44 Correct 4 ms 5464 KB Output is correct
45 Correct 4 ms 5464 KB Output is correct
46 Correct 4 ms 5212 KB Output is correct
47 Correct 4 ms 5212 KB Output is correct
48 Correct 4 ms 5212 KB Output is correct
49 Correct 3 ms 5212 KB Output is correct
50 Correct 3 ms 5212 KB Output is correct
51 Correct 3 ms 5212 KB Output is correct
52 Correct 3 ms 5208 KB Output is correct
53 Correct 3 ms 5212 KB Output is correct
54 Correct 3 ms 5212 KB Output is correct
55 Correct 3 ms 5464 KB Output is correct
56 Correct 2 ms 5240 KB Output is correct
57 Correct 2 ms 5212 KB Output is correct
58 Correct 2 ms 5212 KB Output is correct
59 Correct 172 ms 5468 KB Output is correct
60 Correct 164 ms 5468 KB Output is correct
61 Correct 159 ms 5468 KB Output is correct
62 Correct 172 ms 5212 KB Output is correct
63 Correct 175 ms 5468 KB Output is correct
64 Correct 251 ms 5464 KB Output is correct
65 Correct 248 ms 5464 KB Output is correct
66 Correct 252 ms 5464 KB Output is correct
67 Correct 247 ms 5464 KB Output is correct
68 Correct 247 ms 5212 KB Output is correct
69 Correct 133 ms 5464 KB Output is correct
70 Correct 129 ms 5464 KB Output is correct
71 Correct 130 ms 5468 KB Output is correct
72 Correct 135 ms 5464 KB Output is correct
73 Correct 140 ms 5468 KB Output is correct
74 Correct 34 ms 5212 KB Output is correct
75 Correct 33 ms 5468 KB Output is correct
76 Correct 35 ms 5464 KB Output is correct
77 Correct 35 ms 5468 KB Output is correct
78 Correct 35 ms 5468 KB Output is correct