oj.uz

답안 #330479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330479 2020-11-25T13:20:14 Z AmineWeslati Boat (APIO16_boat) C++14
31 / 100
 452 ms 524292 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e6 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

unordered_map<int,int> mp;

V<ll> bit(MX,0ll);

void update(int i, int v){
	i++;
	while(i<MX){
		bit[i]+=v;
		bit[i]%=MOD; 
		i+=i&-i;
	}
}

int get(int i){
	i++;
	int ans=0;
	while(i){
		ans+=bit[i];
		ans%=MOD;
		i-=i&-i;
	}
	return ans;
}

int32_t main() {
    boost; IO();

    int N; cin>>N;
    vi a(N),b(N);
    FOR(i,0,N) cin>>a[i]>>b[i];

    vi vec;
    FOR(i,0,N) FOR(j,a[i],b[i]+1) vec.pb(j);
    sort(all(vec));
    vec.erase(unique(all(vec)),vec.end());

    FOR(i,0,sz(vec)) mp[vec[i]]=i;

    int dp[sz(vec)]; fill(dp,dp+sz(vec),0);
    FOR(i,0,N){
    	vpi nw;
    	/*int sum=0;
    	FOR(j,0,sz(vec)){
    		if(a[i]<=vec[j] && b[i]>=vec[j]){
    			nw.pb({j,sum+1});
    		}
    		sum+=dp[j]; sum%=MOD;
    	}*/
    	FOR(j,a[i],b[i]+1){
    		nw.pb({mp[j],get(mp[j]-1)+1});
    	}
    	for(auto x: nw){
    		dp[x.fi]+=x.se,dp[x.fi]%=MOD;
    		update(x.fi,x.se);
		}
    	
    }
	
	int ans=0;
	for(auto x: dp) ans+=x,ans%=MOD;
	cout << ans << endl;
    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8192 KB Output is correct
2 Correct 5 ms 8172 KB Output is correct
3 Correct 5 ms 8192 KB Output is correct
4 Correct 5 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 5 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 5 ms 8172 KB Output is correct
9 Correct 5 ms 8172 KB Output is correct
10 Correct 5 ms 8192 KB Output is correct
11 Correct 6 ms 8172 KB Output is correct
12 Correct 6 ms 8172 KB Output is correct
13 Correct 5 ms 8172 KB Output is correct
14 Correct 5 ms 8172 KB Output is correct
15 Correct 6 ms 8192 KB Output is correct
16 Correct 5 ms 8172 KB Output is correct
17 Correct 5 ms 8172 KB Output is correct
18 Correct 5 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 5 ms 8172 KB Output is correct
21 Correct 141 ms 16476 KB Output is correct
22 Correct 137 ms 16604 KB Output is correct
23 Correct 130 ms 16476 KB Output is correct
24 Correct 144 ms 16476 KB Output is correct
25 Correct 143 ms 16476 KB Output is correct
26 Correct 150 ms 16476 KB Output is correct
27 Correct 153 ms 16476 KB Output is correct
28 Correct 151 ms 16476 KB Output is correct
29 Correct 157 ms 16476 KB Output is correct
30 Correct 243 ms 63948 KB Output is correct
31 Correct 269 ms 63820 KB Output is correct
32 Correct 246 ms 64920 KB Output is correct
33 Correct 240 ms 62796 KB Output is correct
34 Correct 253 ms 63820 KB Output is correct
35 Correct 242 ms 60876 KB Output is correct
36 Correct 249 ms 62540 KB Output is correct
37 Correct 249 ms 62540 KB Output is correct
38 Correct 249 ms 61468 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 452 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8192 KB Output is correct
2 Correct 5 ms 8172 KB Output is correct
3 Correct 5 ms 8192 KB Output is correct
4 Correct 5 ms 8172 KB Output is correct
5 Correct 6 ms 8172 KB Output is correct
6 Correct 5 ms 8172 KB Output is correct
7 Correct 7 ms 8172 KB Output is correct
8 Correct 5 ms 8172 KB Output is correct
9 Correct 5 ms 8172 KB Output is correct
10 Correct 5 ms 8192 KB Output is correct
11 Correct 6 ms 8172 KB Output is correct
12 Correct 6 ms 8172 KB Output is correct
13 Correct 5 ms 8172 KB Output is correct
14 Correct 5 ms 8172 KB Output is correct
15 Correct 6 ms 8192 KB Output is correct
16 Correct 5 ms 8172 KB Output is correct
17 Correct 5 ms 8172 KB Output is correct
18 Correct 5 ms 8172 KB Output is correct
19 Correct 6 ms 8172 KB Output is correct
20 Correct 5 ms 8172 KB Output is correct
21 Correct 141 ms 16476 KB Output is correct
22 Correct 137 ms 16604 KB Output is correct
23 Correct 130 ms 16476 KB Output is correct
24 Correct 144 ms 16476 KB Output is correct
25 Correct 143 ms 16476 KB Output is correct
26 Correct 150 ms 16476 KB Output is correct
27 Correct 153 ms 16476 KB Output is correct
28 Correct 151 ms 16476 KB Output is correct
29 Correct 157 ms 16476 KB Output is correct
30 Correct 243 ms 63948 KB Output is correct
31 Correct 269 ms 63820 KB Output is correct
32 Correct 246 ms 64920 KB Output is correct
33 Correct 240 ms 62796 KB Output is correct
34 Correct 253 ms 63820 KB Output is correct
35 Correct 242 ms 60876 KB Output is correct
36 Correct 249 ms 62540 KB Output is correct
37 Correct 249 ms 62540 KB Output is correct
38 Correct 249 ms 61468 KB Output is correct
39 Runtime error 452 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -