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. #define main dummy_main
  30. int main(){
  31.   wmem = memarr;
  32.   return 0;
  33. }
  34. #undef main
  35. int ind[100];
  36. int cnt[100];
  37. class Solution{
  38.   public:
  39.   vector<int> kWeakestRows(vector<vector<int>>& mat, int k){
  40.     int i;
  41.     dummy_main();
  42.     int X = mat.size();
  43.     int Y = mat[0].size();
  44.     vector<int> res;
  45.     for(i=(0);i<(X);i++){
  46.       ind[i] = i;
  47.       {
  48.         int Q5VJL1cS;
  49.         int e98WHCEY;
  50.         if(Y==0){
  51.           e98WHCEY = 0;
  52.         }
  53.         else{
  54.           e98WHCEY = mat[i][0];
  55.           for(Q5VJL1cS=(1);Q5VJL1cS<(Y);Q5VJL1cS++){
  56.             e98WHCEY += mat[i][Q5VJL1cS];
  57.           }
  58.         }
  59.         cnt[i] =e98WHCEY;
  60.       }
  61.     }
  62.     sortA_L(X,cnt,ind);
  63.     for(i=(0);i<(k);i++){
  64.       res.push_back(ind[i]);
  65.     }
  66.     return res;
  67.   }
  68. }
  69. ;
  70. // cLay varsion 20200214-1
  71.  
  72. // --- original code ---
  73. // #define main dummy_main
  74. // {}
  75. // #undef main
  76. // 
  77. // int ind[100], cnt[100];
  78. // 
  79. // class Solution {
  80. // public:
  81. //   vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
  82. //     dummy_main();
  83. //     int X = mat.size();
  84. //     int Y = mat[0].size();
  85. //     vector<int> res;
  86. // 
  87. //     rep(i,X){
  88. //       ind[i] = i;
  89. //       cnt[i] = sum(mat[i](Y));
  90. //     }
  91. //     sortA(X,cnt,ind);
  92. //     rep(i,k) res.push_back(ind[i]);
  93. //     return res;
  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/AR4t0o
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

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!