oj.uz

답안 #249173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249173 2020-07-14T13:02:21 Z sahil_k Boat (APIO16_boat) C++14
0 / 100
 9 ms 7296 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MOD 1000000007
int n;
int s_val[510], e_val[510];
vector<int> pts;
int s_id[510], e_id[510];
long long dp1[510][1010];
long long dp2[510][1010];
long long calc (long long a) {
	return (a*(a-1)/2)%MOD;
}
int main () {
	cin >> n;
	for (int i=0; i<n; i++) {
		cin >> s_val[i] >> e_val[i];
		pts.push_back(s_val[i]);
		pts.push_back(e_val[i]);
	}
	pts.push_back(0);
	sort(pts.begin(), pts.end());
	pts.resize(unique(pts.begin(), pts.end())-pts.begin());
	for (int i=0; i<n; i++) {
		s_id[i+1] = lower_bound(pts.begin(), pts.end(), s_val[i])-pts.begin();
		e_id[i+1] = lower_bound(pts.begin(), pts.end(), e_val[i])-pts.begin();
	}
	int m = pts.size();
	dp1[0][0] = 1;
	for (int j=1; j<m; j++) {
		dp2[0][j] = 1;
	}
	for (int i=1; i<=n; i++) {
		dp1[i][0] = 1;
		for (int j=1; j<m; j++) {
			if (s_id[i] <= j && j <= e_id[i]) dp1[i][j] = (dp1[i][j]+dp2[i-1][j])%MOD;
			dp2[i][j] = dp2[i-1][j]-dp2[i-1][j-1];
			dp2[i][j] = (dp2[i][j]+dp2[i][j-1])%MOD;
			if (s_id[i] < j && j <= e_id[i]) {
				dp2[i][j] = (dp2[i][j]+dp2[i-1][j-1]*(pts[j]-pts[j-1]))%MOD;
				dp2[i][j] = (dp2[i][j]+dp1[i-1][j-1]*calc(pts[j]-pts[j-1]))%MOD;
			}
			if (j == e_id[i]+1) dp2[i][j] = (dp2[i][j]+dp1[i][j-1])%MOD;
		}
	}
	long long o = (MOD+dp2[n][m-1]-1)%MOD;
	for (int i=1; i<=n; i++) o = (o+dp1[i][m-1])%MOD;
	cout << o << endl;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7296 KB Output is correct
2 Incorrect 7 ms 7296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7296 KB Output is correct
2 Incorrect 7 ms 7296 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7296 KB Output is correct
2 Incorrect 7 ms 7296 KB Output isn't correct
3 Halted 0 ms 0 KB -