fork download
copy 
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. void*wmem;
  5. char memarr[96000000];
  6. template<class S, class T> inline S max_L(S a,T b){
  7.   return a>=b?a:b;
  8. }
  9. template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  10.   static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  11.   (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  12.   (*arr)=(T*)(*mem);
  13.   (*mem)=((*arr)+x);
  14. }
  15. template<class T1> void sortV_L(vector<T1> &a, void *mem = wmem){
  16.   sort(a.begin(), a.end());
  17. }
  18. template<class T1, class T2> void sortV_L(vector<T1> &a, vector<T2> &b, void *mem = wmem){
  19.   int i;
  20.   int N = a.size();
  21.   pair<T1, T2>*arr;
  22.   walloc1d(&arr, N, &mem);
  23.   for(i=(0);i<(N);i++){
  24.     arr[i].first = a[i];
  25.     arr[i].second = b[i];
  26.   }
  27.   sort(arr, arr+N);
  28.   for(i=(0);i<(N);i++){
  29.     a[i] = arr[i].first;
  30.     b[i] = arr[i].second;
  31.   }
  32. }
  33. template<class S, class T> inline S chmax(S &a, T b){
  34.   if(a<b){
  35.     a=b;
  36.   }
  37.   return a;
  38. }
  39. #define main dummy_main
  40. int main(){
  41.   wmem = memarr;
  42.   return 0;
  43. }
  44. #undef main
  45. class Solution{
  46.   public:
  47.   int bestTeamScore(vector<int>& scores, vector<int>& ages){
  48.     int i;
  49.     dummy_main();
  50.     int n = scores.size();
  51.     sortV_L(ages, scores);
  52.     vector<int> dp = scores;
  53.     for(i=(0);i<(n);i++){
  54.       int j;
  55.       for(j=(i+1);j<(n);j++){
  56.         if(scores[i]<=scores[j]){
  57.           chmax(dp[j], dp[i] + scores[j]);
  58.         }
  59.       }
  60.     }
  61.     {
  62.       int cTE1_r3A;
  63.       int RZTsC2BF;
  64.       if(n==0){
  65.         RZTsC2BF = 0;
  66.       }
  67.       else{
  68.         RZTsC2BF = dp[0];
  69.         for(cTE1_r3A=(1);cTE1_r3A<(n);cTE1_r3A++){
  70.           RZTsC2BF = max_L(RZTsC2BF, dp[cTE1_r3A]);
  71.         }
  72.       }
  73.       return RZTsC2BF;
  74.     }
  75.   }
  76. }
  77. ;
  78. // cLay varsion 20201018-2
  79.  
  80. // --- original code ---
  81. // #define main dummy_main
  82. // {}
  83. // #undef main
  84. // 
  85. // class Solution {
  86. // public:
  87. //   int bestTeamScore(vector<int>& scores, vector<int>& ages) {
  88. //     dummy_main();
  89. //     int n = scores.size();
  90. //     sortV(ages, scores);
  91. //     VI dp = scores;
  92. //     rep(i,n) rep(j,i+1,n) if(scores[i]<=scores[j]) dp[j] >?= dp[i] + scores[j];
  93. //     return max(dp(n));
  94. //   }
  95. // };
  96.  
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/9Xj0KE
language:
C++14 (gcc 8.3)
created:
3 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!