Submission #1758336
Source Code Expand
#include <algorithm> #include <cstdio> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <math.h> #include <queue> #include <set> #include <stack> #include <string> #include <type_traits> #include <vector> typedef long long ll; #define FOR(i, a, b) for (ll i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EREP(i, n) for (int i = (n - 1); i >= 0; --i) #define mod 100000 #define INF 93193111451418101 #define MIN -933111451418101 using namespace std; typedef pair<ll, ll> P; template <typename T, typename U> typename std::enable_if<std::rank<T>::value == 0>::type fill_all(T &arr, const U &v) { arr = v; } template <typename ARR, typename U> typename std::enable_if<std::rank<ARR>::value != 0>::type fill_all(ARR &arr, const U &v) { for (auto &i : arr) { fill_all(i, v); } } //------------------?????°-----------------------// ll n, m, s; map<ll, ll> dp; vector<ll> nico; //-------------------??¢??°----------------------// ll DP(ll num) { if (dp[num]) { return dp[num]; } ll mini = num; if (num <= 1) { return num; } for (auto i : nico) { ll a = num / i,b=num%i; if (a != 0) { mini = min(mini, DP(a) + b); } } return dp[num]=mini; } int main() { cin >> n; nico.push_back(2); nico.push_back(5); ll now = 2; while (nico[now-2]*10<n) { if (nico[now - 2] % 10 == 2) { nico.push_back(nico[now - 2] * 10 + 5); } else { nico.push_back(nico[now - 2] * 10 + 2); } now++; } cout << DP(n) << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 通勤 |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 80 |
Code Size | 1579 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | Subtask0 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 50 / 50 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_15.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
All | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_15.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample0.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_10.txt | AC | 1 ms | 256 KB |
subtask0_11.txt | AC | 1 ms | 256 KB |
subtask0_12.txt | AC | 1 ms | 256 KB |
subtask0_13.txt | AC | 1 ms | 256 KB |
subtask0_14.txt | AC | 1 ms | 256 KB |
subtask0_15.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |
subtask0_4.txt | AC | 1 ms | 256 KB |
subtask0_5.txt | AC | 1 ms | 256 KB |
subtask0_6.txt | AC | 1 ms | 256 KB |
subtask0_7.txt | AC | 1 ms | 256 KB |
subtask0_8.txt | AC | 1 ms | 256 KB |
subtask0_9.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 31 ms | 1280 KB |
subtask1_1.txt | AC | 31 ms | 1280 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 2 ms | 384 KB |
subtask1_13.txt | AC | 5 ms | 384 KB |
subtask1_14.txt | AC | 38 ms | 1408 KB |
subtask1_15.txt | AC | 37 ms | 1408 KB |
subtask1_2.txt | AC | 39 ms | 1408 KB |
subtask1_3.txt | AC | 42 ms | 1536 KB |
subtask1_4.txt | AC | 24 ms | 1024 KB |
subtask1_5.txt | AC | 41 ms | 1536 KB |
subtask1_6.txt | AC | 41 ms | 1536 KB |
subtask1_7.txt | AC | 37 ms | 1408 KB |
subtask1_8.txt | AC | 40 ms | 1536 KB |
subtask1_9.txt | AC | 40 ms | 1536 KB |