답안 #262452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262452	2020-08-13T00:02:27 Z	yuma220284	Boat (APIO16_boat)	C++14	9 / 100	6 ms	4480 KB

boat

#include "bits/stdc++.h"
using namespace std;

constexpr long long MOD = 1000000007;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int N;
	cin >> N;
	vector<long long> A(N), B(N), X;
	X.push_back(0);
	for (int i = 0; i < N; i++) {
		cin >> A[i] >> B[i];
		B[i]++;
		X.push_back(A[i]), X.push_back(B[i]);
	}
	sort(X.begin(), X.end());
	X.erase(unique(X.begin(), X.end()), X.end());
	for (int i = 0; i < N; i++) {
		A[i] = lower_bound(X.begin(), X.end(), A[i]) - X.begin();
		B[i] = lower_bound(X.begin(), X.end(), B[i]) - X.begin();
	}
	vector<vector<long long> > DP(N + 1, vector<long long>(X.size() - 1, 0));
	DP[0][0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < X.size() - 1; j++) DP[i + 1][j] = DP[i][j];
		long long SUM = 0;
		for (int j = 0; j < A[i]; j++) SUM += DP[i][j], SUM %= MOD;
		for (int j = A[i]; j < B[i]; j++) {
			DP[i + 1][j] += (SUM * (X[j + 1] - X[j])) % MOD;
			DP[i + 1][j] %= MOD;
			SUM += DP[i][j];
			SUM %= MOD;
		}
	}
	long long ANS = 0;
	for (int j = 1; j < X.size() - 1; j++) {
		ANS += DP[N][j];
		ANS %= MOD;
	}
	cout << ANS << endl;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:27:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   for (int j = 0; j < X.size() - 1; j++) DP[i + 1][j] = DP[i][j];
      |                   ~~^~~~~~~~~~~~~~
boat.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for (int j = 1; j < X.size() - 1; j++) {
      |                  ~~^~~~~~~~~~~~~~

Subtask #1

9.0 / 9.0

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

Subtask #2

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4480 KB	Output is correct
2	Correct	4 ms	4352 KB	Output is correct
3	Correct	5 ms	4352 KB	Output is correct
4	Correct	5 ms	4352 KB	Output is correct
5	Correct	5 ms	4352 KB	Output is correct
6	Correct	4 ms	4352 KB	Output is correct
7	Correct	5 ms	4352 KB	Output is correct
8	Correct	5 ms	4352 KB	Output is correct
9	Correct	5 ms	4352 KB	Output is correct
10	Correct	4 ms	4352 KB	Output is correct
11	Correct	4 ms	4352 KB	Output is correct
12	Correct	5 ms	4352 KB	Output is correct
13	Correct	4 ms	4352 KB	Output is correct
14	Correct	5 ms	4352 KB	Output is correct
15	Correct	6 ms	4352 KB	Output is correct
16	Correct	1 ms	1024 KB	Output is correct
17	Correct	1 ms	1152 KB	Output is correct
18	Correct	1 ms	1024 KB	Output is correct
19	Correct	2 ms	1152 KB	Output is correct
20	Correct	1 ms	1024 KB	Output is correct
21	Incorrect	5 ms	3968 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

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

Subtask #4

0 / 42.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4480 KB	Output is correct
2	Correct	4 ms	4352 KB	Output is correct
3	Correct	5 ms	4352 KB	Output is correct
4	Correct	5 ms	4352 KB	Output is correct
5	Correct	5 ms	4352 KB	Output is correct
6	Correct	4 ms	4352 KB	Output is correct
7	Correct	5 ms	4352 KB	Output is correct
8	Correct	5 ms	4352 KB	Output is correct
9	Correct	5 ms	4352 KB	Output is correct
10	Correct	4 ms	4352 KB	Output is correct
11	Correct	4 ms	4352 KB	Output is correct
12	Correct	5 ms	4352 KB	Output is correct
13	Correct	4 ms	4352 KB	Output is correct
14	Correct	5 ms	4352 KB	Output is correct
15	Correct	6 ms	4352 KB	Output is correct
16	Correct	1 ms	1024 KB	Output is correct
17	Correct	1 ms	1152 KB	Output is correct
18	Correct	1 ms	1024 KB	Output is correct
19	Correct	2 ms	1152 KB	Output is correct
20	Correct	1 ms	1024 KB	Output is correct
21	Incorrect	5 ms	3968 KB	Output isn't correct
22	Halted	0 ms	0 KB	-