fork download
copy 
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. #define main dummy_main
  5. int main(){
  6.   return 0;
  7. }
  8. #undef main
  9. class Solution{
  10.   public:
  11.   int minBuildTime(vector<int>& A, int S){
  12.     int i;
  13.     int j;
  14.     int k;
  15.     int m;
  16.     int nd;
  17.     int N;
  18.     int cnt[1011];
  19.     int res;
  20.     N = A.size();
  21.     sort(A.rbegin(), A.rend());
  22.     int Lj4PdHRW;
  23.     int KL2GvlyY;
  24.     int Q5VJL1cS;
  25.     Lj4PdHRW = 0;
  26.     KL2GvlyY = 1000000000;
  27.     while(Lj4PdHRW < KL2GvlyY){
  28.       if((Lj4PdHRW + KL2GvlyY)%2==0){
  29.         Q5VJL1cS = (Lj4PdHRW + KL2GvlyY) / 2;
  30.       }
  31.       else{
  32.         Q5VJL1cS = (Lj4PdHRW + KL2GvlyY - 1) / 2;
  33.       }
  34.       for(i=(0);i<(N+1);i++){
  35.         cnt[i] = 0;
  36.       }
  37.       cnt[0] = 1;
  38.       m = 0;
  39.       for(i=(0);i<(N);i++){
  40.         if(cnt[m]==0){
  41.           m++;
  42.         }
  43.         if(cnt[m]==0){
  44.           break;
  45.         }
  46.         cnt[m]--;
  47.         k = m * S;
  48.         if(k + A[i] > Q5VJL1cS){
  49.           break;
  50.         }
  51.         nd = N - i - 1 - cnt[m];
  52.         for(j=1;nd>0;j++){
  53.           if(k + S*j + A[i] > Q5VJL1cS){
  54.             break;
  55.           }
  56.           cnt[m+j]++;
  57.           nd -= cnt[m+j];
  58.         }
  59.       }
  60.       if(i==N){
  61.         KL2GvlyY = Q5VJL1cS;
  62.       }
  63.       else{
  64.         Lj4PdHRW = Q5VJL1cS + 1;
  65.       }
  66.     }
  67.     res =KL2GvlyY;
  68.     return res;
  69.   }
  70. }
  71. ;
  72. // cLay varsion 20190921-1
  73.  
  74. // --- original code ---
  75. // #define main dummy_main
  76. // {}
  77. // #undef main
  78. // 
  79. // class Solution {
  80. // public:
  81. //   int minBuildTime(vector<int>& A, int S) {
  82. //     int i, j, k, m, nd, N;
  83. //     int cnt[1011];
  84. //     int res;
  85. //     
  86. //     N = A.size();
  87. //     sort(A.rbegin(), A.rend());
  88. // 
  89. //     res = bsearch_min[int,x,0,1d9][
  90. //       rep(i,N+1) cnt[i] = 0;
  91. //       cnt[0] = 1;
  92. //       m = 0;
  93. //       rep(i,N){
  94. //         if(cnt[m]==0) m++;
  95. //         if(cnt[m]==0) break;
  96. //         cnt[m]--;
  97. //         k = m * S;
  98. //         if(k + A[i] > x) break;
  99. // 
  100. //         nd = N - i - 1 - cnt[m];
  101. //         for(j=1;nd>0;j++){
  102. //           if(k + S*j + A[i] > x) break;
  103. //           cnt[m+j]++;
  104. //           nd -= cnt[m+j];
  105. //         }
  106. //       }
  107. //     ](i==N);
  108. // 
  109. //     return res;
  110. //   }
  111. // };
  112.  
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/67HFcm
language:
C++14 (gcc 8.3)
created:
4 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!