답안 #61103

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61103 2018-07-25T08:07:39 Z Eae02 Boat (APIO16_boat) C++14
9 / 100
2000 ms 8840 KB
#include <bits/stdc++.h>

uint64_t PRIME = 1000000007;

std::vector<std::pair<uint64_t, uint64_t>> schools;

std::map<uint64_t, uint64_t> memo[500];

uint64_t count(int i, uint64_t min)
{
	if (i >= schools.size())
		return 1;
	auto mIt = memo[i].find(min);
	if (mIt != memo[i].end())
		return mIt->second;
	
	uint64_t c = count(i + 1, min);
	for (uint64_t n = std::max(schools[i].first, min == 0 ? 0 : (min + 1)); n <= schools[i].second; n++)
	{
		c = (c + count(i + 1, n)) % PRIME;
	}
	
	memo[i].insert(std::make_pair(min, c));
	return c;
}

int main()
{
	int N;
	std::cin >> N;
	
	schools.resize(N);
	for (int i = 0; i < N; i++)
	{
		std::cin >> schools[i].first;
		std::cin >> schools[i].second;
	}
	
	std::cout << (count(0, 0) - 1) << std::endl;
}

Compilation message

boat.cpp: In function 'uint64_t count(int, uint64_t)':
boat.cpp:11:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (i >= schools.size())
      ~~^~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 8184 KB Output is correct
2 Correct 64 ms 8304 KB Output is correct
3 Correct 61 ms 8440 KB Output is correct
4 Correct 73 ms 8576 KB Output is correct
5 Correct 99 ms 8588 KB Output is correct
6 Correct 88 ms 8588 KB Output is correct
7 Correct 85 ms 8612 KB Output is correct
8 Correct 81 ms 8612 KB Output is correct
9 Correct 78 ms 8612 KB Output is correct
10 Correct 113 ms 8612 KB Output is correct
11 Correct 86 ms 8840 KB Output is correct
12 Correct 84 ms 8840 KB Output is correct
13 Correct 78 ms 8840 KB Output is correct
14 Correct 85 ms 8840 KB Output is correct
15 Correct 63 ms 8840 KB Output is correct
16 Correct 14 ms 8840 KB Output is correct
17 Correct 18 ms 8840 KB Output is correct
18 Correct 20 ms 8840 KB Output is correct
19 Correct 15 ms 8840 KB Output is correct
20 Correct 14 ms 8840 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 8184 KB Output is correct
2 Correct 64 ms 8304 KB Output is correct
3 Correct 61 ms 8440 KB Output is correct
4 Correct 73 ms 8576 KB Output is correct
5 Correct 99 ms 8588 KB Output is correct
6 Correct 88 ms 8588 KB Output is correct
7 Correct 85 ms 8612 KB Output is correct
8 Correct 81 ms 8612 KB Output is correct
9 Correct 78 ms 8612 KB Output is correct
10 Correct 113 ms 8612 KB Output is correct
11 Correct 86 ms 8840 KB Output is correct
12 Correct 84 ms 8840 KB Output is correct
13 Correct 78 ms 8840 KB Output is correct
14 Correct 85 ms 8840 KB Output is correct
15 Correct 63 ms 8840 KB Output is correct
16 Correct 14 ms 8840 KB Output is correct
17 Correct 18 ms 8840 KB Output is correct
18 Correct 20 ms 8840 KB Output is correct
19 Correct 15 ms 8840 KB Output is correct
20 Correct 14 ms 8840 KB Output is correct
21 Execution timed out 2073 ms 8840 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2062 ms 8840 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 8184 KB Output is correct
2 Correct 64 ms 8304 KB Output is correct
3 Correct 61 ms 8440 KB Output is correct
4 Correct 73 ms 8576 KB Output is correct
5 Correct 99 ms 8588 KB Output is correct
6 Correct 88 ms 8588 KB Output is correct
7 Correct 85 ms 8612 KB Output is correct
8 Correct 81 ms 8612 KB Output is correct
9 Correct 78 ms 8612 KB Output is correct
10 Correct 113 ms 8612 KB Output is correct
11 Correct 86 ms 8840 KB Output is correct
12 Correct 84 ms 8840 KB Output is correct
13 Correct 78 ms 8840 KB Output is correct
14 Correct 85 ms 8840 KB Output is correct
15 Correct 63 ms 8840 KB Output is correct
16 Correct 14 ms 8840 KB Output is correct
17 Correct 18 ms 8840 KB Output is correct
18 Correct 20 ms 8840 KB Output is correct
19 Correct 15 ms 8840 KB Output is correct
20 Correct 14 ms 8840 KB Output is correct
21 Execution timed out 2073 ms 8840 KB Time limit exceeded
22 Halted 0 ms 0 KB -