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 T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  7.   static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  8.   (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  9.   (*arr)=(T*)(*mem);
  10.   (*mem)=((*arr)+x);
  11. }
  12. template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  13.   sort(a, a+N);
  14. }
  15. template<class T1, class T2> void sortA_L(int N, T1 a[], T2 b[], void *mem = wmem){
  16.   int i;
  17.   pair<T1, T2> *arr;
  18.   walloc1d(&arr, N, &mem);
  19.   for(i=(0);i<(N);i++){
  20.     arr[i].first = a[i];
  21.     arr[i].second = b[i];
  22.   }
  23.   sort(arr, arr+N);
  24.   for(i=(0);i<(N);i++){
  25.     a[i] = arr[i].first;
  26.     b[i] = arr[i].second;
  27.   }
  28. }
  29. template<class S, class T> inline S chmax(S &a, T b){
  30.   if(a<b){
  31.     a=b;
  32.   }
  33.   return a;
  34. }
  35. #define main dummy_main
  36. int main(){
  37.   wmem = memarr;
  38.   return 0;
  39. }
  40. #undef main
  41. int N;
  42. int A[1000];
  43. int B[1000];
  44. int len[1000];
  45. class Solution{
  46.   public:
  47.   int removeCoveredIntervals(vector<vector<int>>& intervals){
  48.     int i;
  49.     dummy_main();
  50.     int res = 0;
  51.     int mx = -1073709056;
  52.     N = intervals.size();
  53.     for(i=(0);i<(N);i++){
  54.       A[i] = intervals[i][0];
  55.       B[i] = intervals[i][1];
  56.     }
  57.     for(i=(0);i<(N);i++){
  58.       B[i] = -B[i];
  59.     }
  60.     sortA_L(N,A,B);
  61.     for(i=(0);i<(N);i++){
  62.       B[i] = -B[i];
  63.     }
  64.     for(i=(0);i<(N);i++){
  65.       if(mx < B[i]){
  66.         res++;
  67.       }
  68.       chmax(mx, B[i]);
  69.     }
  70.     return res;
  71.   }
  72. }
  73. ;
  74. // cLay varsion 20191214-1
  75.  
  76. // --- original code ---
  77. // #define main dummy_main
  78. // {}
  79. // #undef main
  80. // 
  81. // int N, A[1000], B[1000], len[1000];
  82. // 
  83. // class Solution {
  84. // public:
  85. //   int removeCoveredIntervals(vector<vector<int>>& intervals) {
  86. //     dummy_main();
  87. //     int res = 0, mx = -int_inf;
  88. //     N = intervals.size();
  89. //     rep(i,N) A[i] = intervals[i][0], B[i] = intervals[i][1];
  90. //     rep(i,N) B[i] = -B[i];
  91. //     sortA(N,A,B);
  92. //     rep(i,N) B[i] = -B[i];
  93. //     rep(i,N){
  94. //       if(mx < B[i]) res++;
  95. //       mx >?= B[i];
  96. //     }
  97. //     return res;
  98. //   }
  99. // };
  100.  
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/KExUwr
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!