fork download
copy 
  1. #pragma GCC optimize("Ofast")
  2. #pragma GCC optimize("unroll-loops")
  3. #pragma GCC optimize("inline")
  4. #include<bits/stdc++.h>
  5. using namespace std;
  6. template<class T, class S> inline T RoundUp(T a, S b){
  7.   T m;
  8.   if(b < 0){
  9.     b = -b;
  10.   }
  11.   if(b <= 1){
  12.     return a;
  13.   }
  14.   m = a % b;
  15.   if(m == 0){
  16.     return a;
  17.   }
  18.   if(m < 0){
  19.     m += b;
  20.   }
  21.   return ((a + b - m) / b) * b;
  22. }
  23. template<class S, class T> inline S chmin(S &a, T b){
  24.   if(a>b){
  25.     a=b;
  26.   }
  27.   return a;
  28. }
  29. #define main dummy_main
  30. int main(){
  31.   return 0;
  32. }
  33. #undef main
  34. long long dp[1001][1001];
  35. class Solution{
  36.   public:
  37.   int minSkips(vector<int>& dist, int speed, int hoursBefore){
  38.     int i;
  39.     int N = dist.size();
  40.     for(i=(0);i<(N+1);i++){
  41.       int j;
  42.       for(j=(0);j<(N+1);j++){
  43.         dp[i][j] = 4611686016279904256LL;
  44.       }
  45.     }
  46.     dp[0][0] = 0;
  47.     for(i=(0);i<(N);i++){
  48.       int j;
  49.       for(j=(0);j<(N+1);j++){
  50.         if(dp[i][j] < 4611686016279904256LL){
  51.           chmin(dp[i+1][j], RoundUp(dp[i][j], speed) + dist[i]);
  52.           chmin(dp[i+1][j+1], dp[i][j] + dist[i]);
  53.         }
  54.       }
  55.     }
  56.     for(i=(0);i<(N+1);i++){
  57.       if(dp[N][i] <= (long long)speed * hoursBefore){
  58.         return i;
  59.       }
  60.     }
  61.     return -1;
  62.   }
  63. }
  64. ;
  65. // cLay version 20210607-1
  66.  
  67. // --- original code ---
  68. // #define main dummy_main
  69. // {}
  70. // #undef main
  71. // 
  72. // ll dp[1001][1001];
  73. // 
  74. // class Solution {
  75. // public:
  76. //   int minSkips(vector<int>& dist, int speed, int hoursBefore) {
  77. //     int N = dist.size();
  78. // 
  79. //     rep(i,N+1) rep(j,N+1) dp[i][j] = ll_inf;
  80. //     dp[0][0] = 0;
  81. // 
  82. //     rep(i,N) rep(j,N+1) if(dp[i][j] < ll_inf){
  83. //       dp[i+1][j] <?= RoundUp(dp[i][j], speed) + dist[i];
  84. //       dp[i+1][j+1] <?= dp[i][j] + dist[i];
  85. //     }
  86. //     rep(i,N+1) if(dp[N][i] <= (ll)speed * hoursBefore) return i;
  87. //     return -1;
  88. //   }
  89. // };
  90.  
Compilation error #stdin compilation error #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
compilation info 
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/8/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
stdout
copy 
Standard output is empty
https://ideone.com/aAuN74
language:
C++ (gcc 8.3)
created:
2 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!