oj.uz

답안 #142617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
142617 2019-08-10T03:12:13 Z 12tqian Boat (APIO16_boat) C++14
9 / 100
 272 ms 74904 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const ll MOD = 1e9 + 7;
const int MAX = 505;
vector<pair<ll, ll>> bounds;
vector<pair<ll, ll>> ranges;
ll dp[MAX*3][MAX];
ll choose[3*MAX][MAX];
vi possible[MAX];

template<class T, int SZ> struct Seg { // SZ should be power of 2
    T ID = 0; // comb(ID,b) must equal b
    T comb(T a, T b) {
        return (a+b)%MOD;
    } // easily change this to min or max

    T seg[2*SZ];
    Seg() { memset(seg,0,sizeof seg); }


    void upd(int p, T value) {  // set value at position p
        seg[p += SZ] = value;
        for (p /= 2; p; p /= 2) seg[p] = comb(seg[2*p],seg[2*p+1]);
    }

    T query(int l, int r) {  // sum on interval [l, r]
        r ++; T lres = ID, rres = ID; // make sure non-commutative operations work
        for (l += SZ, r += SZ; l < r; l /= 2, r /= 2) {
            if (l&1) lres = comb(lres,seg[l++]);
            if (r&1) rres = comb(seg[--r],rres);
        }
        return comb(lres,rres);
    }
};
Seg<ll, (1<<15)> seg;



long long modInverse(long long b){
    long long ex = MOD - 2;
    if (b==1){
        return 1;
    }
    long long r = 1;
    while (ex ){
        if (ex&1){
            r=(r * b)%MOD;
        }
        ex = ex >> 1;
        b = (b * b)%MOD;
    }
    return r;
}
int main(){
    fast_io();
    int n;
    cin >> n;
    set<ll> nums;
    f0r(i, n){
        int ai, bi;
        cin >> ai >> bi;
        bounds.eb(mp(ai, bi));
        nums.insert(ai);
        nums.insert(bi);
    }

    vi tmp;
    for(auto x: nums) tmp.eb(x);
    f0r(i, sz(tmp) -1){
        if(tmp[i+1]-tmp[i]>1) ranges.eb(tmp[i]+1, tmp[i+1]-1);
    }
    for(auto x: tmp) ranges.eb(mp(x, x));
    sort(all(ranges));

    f0r(i, sz(ranges)){
        f0r(j, MAX){
            if(j == 0){
                choose[i][j] = 1;
            }
            else{
                choose[i][j] = choose[i][j-1];
                choose[i][j] *= (ranges[i].s - ranges[i].f+1 -j+ 1);
                choose[i][j] %= MOD;
                choose[i][j] *= modInverse(j);
                choose[i][j] %= MOD;
            }
        }
    }
    f0r(i, n){
        f0r(j, sz(ranges)){
            if(bounds[i].f<= ranges[j].f && bounds[i].s>= ranges[j].s){
                possible[i].eb(j);
            }
        }
    }

   /* f0r(i, sz(ranges)){
        cout << ranges[i].f << " " << ranges[i].s << endl;
    }*/
    f0r(i, n){
        unordered_map<int, ll> change;
        for(int j: possible[i]){
            for(int t = n; t>= 1; t--){
                if(t == 1){
                    dp[j][1] = (j == 0? 0:seg.query(0, j-1)) + 1;
                    change[j] += (dp[j][1]*choose[j][1])%MOD;
                    change[j] %= MOD;
                    continue;
                }
                dp[j][t] = dp[j][t-1];
                change[j] += (dp[j][t]*choose[j][t])%MOD;
                change[j] %= MOD;

            }

        }
        for(int j: possible[i]){
            assert(j<= (1<<15));
            seg.upd(j, seg.query(j, j)+  change[j]);
        }
     /*   for(int j: possible[i]){
            f1r(t, 1, n+1){
                cout << i << " " << j << " " << t << ": "  << dp[j][t] << endl;
            }
        }*/
    }
     vi waste;
    f0r(i, (1<<24)){
        int var = 1;
        var += 1;
        waste.eb(var);
    }
    cout << seg.query(0, sz(ranges) - 1) << endl;
    return 0;
}

Compilation message

boat.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
boat.cpp: In function 'void io(std::__cxx11::string)':
boat.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
boat.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 74668 KB Output is correct
2 Correct 256 ms 74836 KB Output is correct
3 Correct 257 ms 74776 KB Output is correct
4 Correct 255 ms 74720 KB Output is correct
5 Correct 257 ms 74708 KB Output is correct
6 Correct 255 ms 74712 KB Output is correct
7 Correct 253 ms 74708 KB Output is correct
8 Correct 268 ms 74756 KB Output is correct
9 Correct 261 ms 74824 KB Output is correct
10 Correct 257 ms 74776 KB Output is correct
11 Correct 253 ms 74660 KB Output is correct
12 Correct 272 ms 74708 KB Output is correct
13 Correct 266 ms 74904 KB Output is correct
14 Correct 255 ms 74672 KB Output is correct
15 Correct 255 ms 74680 KB Output is correct
16 Correct 181 ms 68124 KB Output is correct
17 Correct 183 ms 68252 KB Output is correct
18 Correct 177 ms 68188 KB Output is correct
19 Correct 181 ms 68224 KB Output is correct
20 Correct 183 ms 68208 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 74668 KB Output is correct
2 Correct 256 ms 74836 KB Output is correct
3 Correct 257 ms 74776 KB Output is correct
4 Correct 255 ms 74720 KB Output is correct
5 Correct 257 ms 74708 KB Output is correct
6 Correct 255 ms 74712 KB Output is correct
7 Correct 253 ms 74708 KB Output is correct
8 Correct 268 ms 74756 KB Output is correct
9 Correct 261 ms 74824 KB Output is correct
10 Correct 257 ms 74776 KB Output is correct
11 Correct 253 ms 74660 KB Output is correct
12 Correct 272 ms 74708 KB Output is correct
13 Correct 266 ms 74904 KB Output is correct
14 Correct 255 ms 74672 KB Output is correct
15 Correct 255 ms 74680 KB Output is correct
16 Correct 181 ms 68124 KB Output is correct
17 Correct 183 ms 68252 KB Output is correct
18 Correct 177 ms 68188 KB Output is correct
19 Correct 181 ms 68224 KB Output is correct
20 Correct 183 ms 68208 KB Output is correct
21 Runtime error 223 ms 29304 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 235 ms 69940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 74668 KB Output is correct
2 Correct 256 ms 74836 KB Output is correct
3 Correct 257 ms 74776 KB Output is correct
4 Correct 255 ms 74720 KB Output is correct
5 Correct 257 ms 74708 KB Output is correct
6 Correct 255 ms 74712 KB Output is correct
7 Correct 253 ms 74708 KB Output is correct
8 Correct 268 ms 74756 KB Output is correct
9 Correct 261 ms 74824 KB Output is correct
10 Correct 257 ms 74776 KB Output is correct
11 Correct 253 ms 74660 KB Output is correct
12 Correct 272 ms 74708 KB Output is correct
13 Correct 266 ms 74904 KB Output is correct
14 Correct 255 ms 74672 KB Output is correct
15 Correct 255 ms 74680 KB Output is correct
16 Correct 181 ms 68124 KB Output is correct
17 Correct 183 ms 68252 KB Output is correct
18 Correct 177 ms 68188 KB Output is correct
19 Correct 181 ms 68224 KB Output is correct
20 Correct 183 ms 68208 KB Output is correct
21 Runtime error 223 ms 29304 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -