#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int> dp(n+1, INF);
dp[0] = 0;
for(int i=3; i<=n; i++)
{
dp[i] = min(dp[i], dp[i-3]+1);
if(i >= 5) dp[i] = min(dp[i], dp[i-5]+1);
}
int res = min(dp[n], dp[n-2]+2);
cout << (res == INF ? -1 : res) << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
612 KB |
Output is correct |
2 |
Correct |
3 ms |
484 KB |
Output is correct |
3 |
Correct |
3 ms |
484 KB |
Output is correct |
4 |
Correct |
4 ms |
612 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
740 KB |
Output is correct |
2 |
Correct |
2 ms |
612 KB |
Output is correct |
3 |
Incorrect |
3 ms |
612 KB |
Output isn't correct |
4 |
Correct |
3 ms |
620 KB |
Output is correct |
5 |
Correct |
2 ms |
740 KB |
Output is correct |
6 |
Correct |
2 ms |
612 KB |
Output is correct |
7 |
Correct |
4 ms |
620 KB |
Output is correct |
8 |
Correct |
2 ms |
612 KB |
Output is correct |
9 |
Correct |
2 ms |
740 KB |
Output is correct |
10 |
Correct |
3 ms |
740 KB |
Output is correct |
11 |
Correct |
2 ms |
612 KB |
Output is correct |
12 |
Correct |
3 ms |
612 KB |
Output is correct |
13 |
Correct |
3 ms |
612 KB |
Output is correct |
14 |
Correct |
3 ms |
612 KB |
Output is correct |
15 |
Correct |
2 ms |
612 KB |
Output is correct |
16 |
Correct |
2 ms |
612 KB |
Output is correct |
17 |
Correct |
3 ms |
612 KB |
Output is correct |
18 |
Correct |
2 ms |
612 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
744 KB |
Output is correct |
2 |
Correct |
3 ms |
740 KB |
Output is correct |
3 |
Correct |
3 ms |
744 KB |
Output is correct |
4 |
Correct |
4 ms |
744 KB |
Output is correct |
5 |
Correct |
2 ms |
740 KB |
Output is correct |
6 |
Correct |
3 ms |
740 KB |
Output is correct |
7 |
Correct |
3 ms |
744 KB |
Output is correct |
8 |
Correct |
3 ms |
744 KB |
Output is correct |
9 |
Correct |
2 ms |
740 KB |
Output is correct |
10 |
Correct |
3 ms |
744 KB |
Output is correct |
11 |
Correct |
3 ms |
740 KB |
Output is correct |
12 |
Correct |
3 ms |
740 KB |
Output is correct |