Submission #994854
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <fstream> using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template<class T> inline T sqr(T x) { return x*x; } typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<long long int> vll; typedef vector<string> vs; typedef pair<int, int> pii; typedef long long ll; typedef unsigned long long ull; //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) FOR(i,0,n) #define P(p) cout<<(p)<<endl; #define VEC_2D(a,b) vector<vector<int> >(a, vector<int>(b, 0)) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define pb push_back #define mp make_pair #define INF (1100000000) #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define MOD 1000000007LL #define FSP(a) cout << fixed << setprecision(a) ll gcd(ll x, ll y) { if (y == 0) return x; else return gcd(y, x%y); } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } bool is_prime(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return n != 1; } map<int, int> prime_factor(int n) { map<int, int> res; for (int i = 2; i * i <= n; i++) { while (n % i == 0) { ++res[i]; n /= i; } } if (n != 1) res[n] = 1; return res; } int extgcd(int a, int b, int& x, int& y) {// int d = a; if (b != 0) { d = extgcd(b, a%b, y, x); y -= (a / b)*x; } else { x = 1; y = 0; } return d; } ll mod_pow(ll x, ll n, ll mod) { if (n == 0) return 1; ll res = mod_pow(x * x % mod, n / 2, mod); if (n & 1) res = res * x % mod; return res; } vector<string> split(const string &str, char delim) { vector<string> res; size_t current = 0, found; while ((found = str.find_first_of(delim, current)) != string::npos) { res.push_back(string(str, current, found - current)); current = found + 1; } res.push_back(string(str, current, str.size() - current)); return res; } bool is_kadomatsu(int a, int b, int c) { if (a == b || a == c || b == c)return false; if (a > b && c > b) return true; if (a < b && c < b)return true; return false; } struct UF { int n; vi d; UF() {} UF(int n) :n(n), d(n, -1) {} int root(int v) { if (d[v] < 0) return v; return d[v] = root(d[v]); } bool unite(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (size(x) < size(y)) swap(x, y); d[x] += d[y]; d[y] = x; return true; } int size(int v) { return -d[root(v)]; } }; vector<int> divisor(int n) { if (n == 1) return{}; vi res; for (int i = 1; i*i <= n; i++) { if (n%i == 0) { res.emplace_back(i); if (i != 1 && i != n / i)res.emplace_back(n / i); } } return res; } //------------------------------------------------------------- int N, A; int dp[1000000]; int dfs(int a) { if (dp[a] >= 0) return dp[a]; int res = 11111111; for (int i = 1; i*i <= a; i++) { if (a%i != 0) continue; int dd = dfs(i); res = min(res, dd + a / i + A); if (i != 1) { int dd = dfs(a / i); res = min(res, dd + i + A); } } return dp[a] = res; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N >> A; memset(dp, -1, sizeof(dp)); if (N > 1000000 || A > 1000000) return 0; dp[1] = 0; for (int i = 1; i<5000000; i++) dfs(i); int ans = 11111111; for (int i = 1; i < 1000000; i++) { ans = min(ans,dp[i] + (N+i-1) / i); } P(ans); return 0; //ifstream ifs("soc-LiveJournal1.txt"); //グラフの読み込み //ofstream output("soc-LiveJournal2.txt"); //int u, v; //string s; //bool is_0_start = false; //int count = 0; //rep(i, 4) getline(ifs, s); //for (; ifs >> u >> v;) { // if (u == 0) is_0_start = true; // if (!is_0_start) { // u--; // v--; // } // count++; // if(count%10000==0)cout << count << endl; // output << u << " " << v << endl; //} }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | kou |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 4653 Byte |
Status | WA |
Exec Time | 2102 ms |
Memory | 4096 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:155:10: warning: iteration 999999u invokes undefined behavior [-Waggressive-loop-optimizations] if (dp[a] >= 0) return dp[a]; ^ ./Main.cpp:176:19: note: containing loop for (int i = 1; i<5000000; i++) dfs(i); ^
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | 0 / 500 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | TLE | 2102 ms | 4096 KB |
01-02.txt | TLE | 2102 ms | 4096 KB |
01-03.txt | TLE | 2102 ms | 4096 KB |
01-04.txt | TLE | 2102 ms | 4096 KB |
01-05.txt | TLE | 2102 ms | 4096 KB |
01-06.txt | TLE | 2102 ms | 4096 KB |
01-07.txt | TLE | 2102 ms | 4096 KB |
01-08.txt | TLE | 2102 ms | 4096 KB |
01-09.txt | TLE | 2102 ms | 4096 KB |
01-10.txt | TLE | 2102 ms | 4096 KB |
01-11.txt | TLE | 2102 ms | 4096 KB |
01-12.txt | TLE | 2102 ms | 4096 KB |
01-13.txt | TLE | 2102 ms | 4096 KB |
01-14.txt | TLE | 2102 ms | 4096 KB |
01-15.txt | TLE | 2102 ms | 4096 KB |
01-16.txt | TLE | 2102 ms | 4096 KB |
01-17.txt | TLE | 2102 ms | 4096 KB |
01-18.txt | TLE | 2102 ms | 4096 KB |
01-19.txt | TLE | 2102 ms | 4096 KB |
01-20.txt | TLE | 2102 ms | 4096 KB |
01-21.txt | TLE | 2102 ms | 4096 KB |
01-22.txt | TLE | 2102 ms | 4096 KB |
01-23.txt | TLE | 2102 ms | 4096 KB |
01-24.txt | TLE | 2102 ms | 4096 KB |
01-25.txt | TLE | 2102 ms | 4096 KB |
01-26.txt | TLE | 2102 ms | 4096 KB |
02-01.txt | WA | 6 ms | 4096 KB |
02-02.txt | WA | 6 ms | 4096 KB |
02-03.txt | WA | 6 ms | 4096 KB |
02-04.txt | WA | 6 ms | 4096 KB |
02-05.txt | WA | 6 ms | 4096 KB |
02-06.txt | WA | 6 ms | 4096 KB |
02-07.txt | WA | 6 ms | 4096 KB |
02-08.txt | WA | 6 ms | 4096 KB |
02-09.txt | WA | 6 ms | 4096 KB |
02-10.txt | WA | 6 ms | 4096 KB |
02-11.txt | WA | 6 ms | 4096 KB |
02-12.txt | WA | 6 ms | 4096 KB |
02-13.txt | WA | 6 ms | 4096 KB |
02-14.txt | WA | 6 ms | 4096 KB |
02-15.txt | WA | 6 ms | 4096 KB |
02-16.txt | WA | 6 ms | 4096 KB |
02-17.txt | WA | 6 ms | 4096 KB |
02-18.txt | WA | 6 ms | 4096 KB |
02-19.txt | WA | 6 ms | 4096 KB |
02-20.txt | WA | 6 ms | 4096 KB |
02-21.txt | WA | 6 ms | 4096 KB |
02-22.txt | WA | 6 ms | 4096 KB |
02-23.txt | WA | 6 ms | 4096 KB |
02-24.txt | WA | 6 ms | 4096 KB |
02-25.txt | WA | 6 ms | 4096 KB |
02-26.txt | WA | 6 ms | 4096 KB |
02-27.txt | WA | 6 ms | 4096 KB |
02-28.txt | WA | 6 ms | 4096 KB |
02-29.txt | WA | 6 ms | 4096 KB |
02-30.txt | WA | 6 ms | 4096 KB |
02-31.txt | WA | 6 ms | 4096 KB |
02-32.txt | WA | 6 ms | 4096 KB |
02-33.txt | WA | 6 ms | 4096 KB |
02-34.txt | WA | 6 ms | 4096 KB |
02-35.txt | WA | 6 ms | 4096 KB |
02-36.txt | WA | 6 ms | 4096 KB |
02-37.txt | WA | 6 ms | 4096 KB |
02-38.txt | WA | 6 ms | 4096 KB |
02-39.txt | WA | 6 ms | 4096 KB |
02-40.txt | WA | 6 ms | 4096 KB |
sample-01.txt | TLE | 2102 ms | 4096 KB |
sample-02.txt | WA | 6 ms | 4096 KB |
sample-03.txt | TLE | 2102 ms | 4096 KB |