oj.uz

답안 #107009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107009 2019-04-21T12:47:12 Z golub Boat (APIO16_boat) C++14
31 / 100
 2000 ms 273224 KB 
// #define TASK "sweets"

// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse4.2,avx2")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("unroll-all-loops")

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>

// using namespace __gnu_cxx;`
// using namespace __gnu_pbds;
using namespace std;

// template<class K>
// using ordered_set = tree<K, null_type, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

// template<class K, class T>
// using ordered_map = tree<K, T, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937 rnd((int)chrono::high_resolution_clock::now().time_since_epoch().count());
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>
#define len(x) (long long)x.size()
#define int long long

typedef long long ll;
typedef long double ld;

const long long INF = (int)numeric_limits<int>::max() >> 1;
const long long MAXN = (long long)1e5 + 10;
const long long MOD = (long long)1e9 + 7;
const long double EPS = (long double)1e-12;

// char _buf_[(int)6e6];
// size_t _p_ = 0;

// inline void *operator new(size_t _n_) {
//    _p_ += _n_;
//    return _buf_ + _p_ - _n_;
// }
// inline void operator delete(void*) {};

ll power(ll x, ll n, ll mod = 1e9 + 7) {
    if (n == 0) return 1ll;
    if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
    ll tmp = power(x, n >> 1ll, mod);
    return (tmp * tmp) % mod;
}

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd (b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

template<typename A, typename B>
bool cmax(A &a, const B &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
bool cmin(A &a, const B &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

int mod(int x) {
    x %= MOD;
    if (x < 0) x += MOD;
    return x;
}

struct FT {
    unordered_map<int, int> d;
    int MAXN = 1e9 + 1;

    void update(int k, int value) {
        for (int i = k; i < MAXN; i |= (i + 1)) {
            d[i] = mod(d[i] + value);
        }
    }

    int query(int k) {
        int S = 0;
        for (int i = k; i >= 0; i = (i & (i + 1)) - 1) {
            auto it = d.find(i);
            if (it != d.end())
                S = mod(S + (*it).S);
        }
        return S;
    }

    int query(int l, int r) {
        return mod(query(r) - query(l - 1));
    }
};

signed main() {
#ifndef LOCAL
    #ifdef TASK
    freopen(TASK".in", "r", stdin);
    freopen(TASK".out", "w", stdout);
#endif
#endif
    iostream::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // == SOLUTION == //
    int n;
    cin >> n;
    vector<pii> a;
    for (int i = 0; i < n; i++) {
        int l, r;
        cin >> l >> r;
        a.pb({l, r});
    }
    FT T;
    vector<map<int, int>> dp(n);
    for (int i = 0; i < n; i++) {
        for (int j = a[i].F; j <= a[i].S; j++) {
            dp[i][j] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = a[i].F; j <= a[i].S; j++) {
            dp[i][j] = mod(dp[i][j] + T.query(j - 1));
        }
        for (int j = a[i].F; j <= a[i].S; j++) {
            T.update(j, dp[i][j]);
        }
    }
    int S = 0;
    for (int i = 0; i < n; i++) {
        for (int j = a[i].F; j <= a[i].S; j++) {
            S = mod(S + dp[i][j]);
        }
    }
    cout << S << "\n";
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 4 ms 640 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 1251 ms 55404 KB Output is correct
22 Correct 1455 ms 55032 KB Output is correct
23 Correct 1206 ms 51972 KB Output is correct
24 Correct 1288 ms 57084 KB Output is correct
25 Correct 1355 ms 57712 KB Output is correct
26 Correct 1358 ms 60792 KB Output is correct
27 Correct 1440 ms 61872 KB Output is correct
28 Correct 1421 ms 61300 KB Output is correct
29 Correct 1488 ms 62200 KB Output is correct
30 Correct 1370 ms 112304 KB Output is correct
31 Correct 1293 ms 111084 KB Output is correct
32 Correct 1608 ms 112368 KB Output is correct
33 Correct 1516 ms 110552 KB Output is correct
34 Correct 1453 ms 111340 KB Output is correct
35 Correct 1485 ms 108564 KB Output is correct
36 Correct 1517 ms 110444 KB Output is correct
37 Correct 1549 ms 111008 KB Output is correct
38 Correct 1526 ms 109080 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 273224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 4 ms 640 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 1251 ms 55404 KB Output is correct
22 Correct 1455 ms 55032 KB Output is correct
23 Correct 1206 ms 51972 KB Output is correct
24 Correct 1288 ms 57084 KB Output is correct
25 Correct 1355 ms 57712 KB Output is correct
26 Correct 1358 ms 60792 KB Output is correct
27 Correct 1440 ms 61872 KB Output is correct
28 Correct 1421 ms 61300 KB Output is correct
29 Correct 1488 ms 62200 KB Output is correct
30 Correct 1370 ms 112304 KB Output is correct
31 Correct 1293 ms 111084 KB Output is correct
32 Correct 1608 ms 112368 KB Output is correct
33 Correct 1516 ms 110552 KB Output is correct
34 Correct 1453 ms 111340 KB Output is correct
35 Correct 1485 ms 108564 KB Output is correct
36 Correct 1517 ms 110444 KB Output is correct
37 Correct 1549 ms 111008 KB Output is correct
38 Correct 1526 ms 109080 KB Output is correct
39 Execution timed out 2041 ms 273224 KB Time limit exceeded
40 Halted 0 ms 0 KB -