oj.uz

답안 #61118

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

uint64_t PRIME = 1000000007;

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

std::unordered_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())
      ~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 5880 KB Output is correct
2 Correct 63 ms 5976 KB Output is correct
3 Correct 51 ms 5976 KB Output is correct
4 Correct 49 ms 6036 KB Output is correct
5 Correct 43 ms 6084 KB Output is correct
6 Correct 50 ms 6084 KB Output is correct
7 Correct 60 ms 6084 KB Output is correct
8 Correct 59 ms 6116 KB Output is correct
9 Correct 59 ms 6116 KB Output is correct
10 Correct 51 ms 6116 KB Output is correct
11 Correct 49 ms 6116 KB Output is correct
12 Correct 61 ms 6120 KB Output is correct
13 Correct 71 ms 6120 KB Output is correct
14 Correct 67 ms 6120 KB Output is correct
15 Correct 72 ms 6120 KB Output is correct
16 Correct 15 ms 6120 KB Output is correct
17 Correct 19 ms 6120 KB Output is correct
18 Correct 14 ms 6120 KB Output is correct
19 Correct 18 ms 6120 KB Output is correct
20 Correct 13 ms 6120 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 5880 KB Output is correct
2 Correct 63 ms 5976 KB Output is correct
3 Correct 51 ms 5976 KB Output is correct
4 Correct 49 ms 6036 KB Output is correct
5 Correct 43 ms 6084 KB Output is correct
6 Correct 50 ms 6084 KB Output is correct
7 Correct 60 ms 6084 KB Output is correct
8 Correct 59 ms 6116 KB Output is correct
9 Correct 59 ms 6116 KB Output is correct
10 Correct 51 ms 6116 KB Output is correct
11 Correct 49 ms 6116 KB Output is correct
12 Correct 61 ms 6120 KB Output is correct
13 Correct 71 ms 6120 KB Output is correct
14 Correct 67 ms 6120 KB Output is correct
15 Correct 72 ms 6120 KB Output is correct
16 Correct 15 ms 6120 KB Output is correct
17 Correct 19 ms 6120 KB Output is correct
18 Correct 14 ms 6120 KB Output is correct
19 Correct 18 ms 6120 KB Output is correct
20 Correct 13 ms 6120 KB Output is correct
21 Execution timed out 2025 ms 6120 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2049 ms 6120 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 5880 KB Output is correct
2 Correct 63 ms 5976 KB Output is correct
3 Correct 51 ms 5976 KB Output is correct
4 Correct 49 ms 6036 KB Output is correct
5 Correct 43 ms 6084 KB Output is correct
6 Correct 50 ms 6084 KB Output is correct
7 Correct 60 ms 6084 KB Output is correct
8 Correct 59 ms 6116 KB Output is correct
9 Correct 59 ms 6116 KB Output is correct
10 Correct 51 ms 6116 KB Output is correct
11 Correct 49 ms 6116 KB Output is correct
12 Correct 61 ms 6120 KB Output is correct
13 Correct 71 ms 6120 KB Output is correct
14 Correct 67 ms 6120 KB Output is correct
15 Correct 72 ms 6120 KB Output is correct
16 Correct 15 ms 6120 KB Output is correct
17 Correct 19 ms 6120 KB Output is correct
18 Correct 14 ms 6120 KB Output is correct
19 Correct 18 ms 6120 KB Output is correct
20 Correct 13 ms 6120 KB Output is correct
21 Execution timed out 2025 ms 6120 KB Time limit exceeded
22 Halted 0 ms 0 KB -