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 T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
  16.   walloc1d(arr, x2-x1, mem);
  17.   (*arr) -= x1;
  18. }
  19. template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  20.   sort(a, a+N);
  21. }
  22. template<class T1, class T2> void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){
  23.   int i;
  24.   pair<T1, T2>*arr;
  25.   walloc1d(&arr, N, &mem);
  26.   for(i=(0);i<(N);i++){
  27.     arr[i].first = a[i];
  28.     arr[i].second = b[i];
  29.   }
  30.   sort(arr, arr+N);
  31.   for(i=(0);i<(N);i++){
  32.     a[i] = arr[i].first;
  33.     b[i] = arr[i].second;
  34.   }
  35. }
  36. template<class S, class T> inline S chmax(S &a, T b){
  37.   if(a<b){
  38.     a=b;
  39.   }
  40.   return a;
  41. }
  42. #define main dummy_main
  43. int main(){
  44.   wmem = memarr;
  45.   return 0;
  46. }
  47. #undef main
  48. int N;
  49. int A[100000];
  50. int M[100000];
  51. class Solution{
  52.   public:
  53.   int minimumEffort(vector<vector<int>>& tasks){
  54.     int i;
  55.     dummy_main();
  56.     int res = 0;
  57.     N = tasks.size();
  58.     for(i=(0);i<(N);i++){
  59.       A[i] = tasks[i][0];
  60.       M[i] = tasks[i][1] - A[i];
  61.     }
  62.     sortA_L(N,M,A);
  63.     for(i=(0);i<(N);i++){
  64.       chmax(res, max_L(res, M[i])+ A[i]);
  65.     }
  66.     return res;
  67.   }
  68. }
  69. ;
  70. // cLay version 20201121-1
  71.  
  72. // --- original code ---
  73. // #define main dummy_main
  74. // {}
  75. // #undef main
  76. // 
  77. // int N, A[1d5], M[1d5];
  78. // 
  79. // class Solution {
  80. // public:
  81. //   int minimumEffort(vector<vector<int>>& tasks) {
  82. //     dummy_main();
  83. //     int res = 0;
  84. //     N = tasks.size();
  85. //     rep(i,N) A[i] = tasks[i][0], M[i] = tasks[i][1] - A[i];
  86. //     sortA(N,M,A);
  87. //     rep(i,N) res >?= max(res, M[i]) + A[i];
  88. //     return res;
  89. //   }
  90. // };
  91.  
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/k6j8kf
language:
C++ (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!