fork download
copy 
  1. #pragma GCC optimize("Ofast")
  2. #pragma GCC optimize("unroll-loops")
  3. #pragma GCC optimize("inline")
  4. #include<bits/stdc++.h>
  5. using namespace std;
  6. #define main dummy_main
  7. int main(){
  8.   return 0;
  9. }
  10. #undef main
  11. class Solution{
  12.   public:
  13.   vector<int> recoverArray(vector<int>& A){
  14.     int m;
  15.     int N = A.size();
  16.     int K;
  17.     int i;
  18.     int j;
  19.     int ok[N+1];
  20.     vector<int> res;
  21.     sort(A.begin(), A.end());
  22.     for(m=(1);m<(N);m++){
  23.       K = A[m] - A[0];
  24.       if(K==0 || K%2==1){
  25.         continue;
  26.       }
  27.       for(i=(0);i<(N+1);i++){
  28.         ok[i] = 0;
  29.       }
  30.       j = 0;
  31.       for(i=(0);i<(N);i++){
  32.         if(!ok[i]){
  33.           while((j <= i) || (j < N && A[j] != A[i] + K) || ok[j]){
  34.             j++;
  35.           }
  36.           if(j==N){
  37.             goto Lj4PdHRW;
  38.           }
  39.           ok[i] = 1;
  40.           ok[j] = 2;
  41.         }
  42.       }
  43.       for(i=(0);i<(N);i++){
  44.         if(ok[i]==1){
  45.           res.push_back(A[i] + K/2);
  46.         }
  47.       }
  48.       break;
  49.       Lj4PdHRW:;
  50.     }
  51.     return res;
  52.   }
  53. }
  54. ;
  55. // cLay version 20211231-1
  56.  
  57. // --- original code ---
  58. // #define main dummy_main
  59. // {}
  60. // #undef main
  61. // 
  62. // class Solution {
  63. // public:
  64. //   vector<int> recoverArray(vector<int>& A) {
  65. //     int N = A.size(), K, i, j;
  66. //     int ok[N+1];
  67. //     VI res;
  68. //     sort(A.begin(), A.end());
  69. //     rep(m,1,N){
  70. //       K = A[m] - A[0];
  71. //       if(K==0 || K%2==1) continue;
  72. // 
  73. //       rep(i,N+1) ok[i] = 0;
  74. //       j = 0;
  75. //       rep(i,N) if(!ok[i]){
  76. //         while((j <= i) || (j < N && A[j] != A[i] + K) || ok[j]) j++;
  77. //         if(j==N) break_continue;
  78. //         ok[i] = 1; ok[j] = 2;
  79. //       }
  80. // 
  81. //       rep(i,N) if(ok[i]==1) res.push_back(A[i] + K/2);
  82. //       break;
  83. //     }
  84. //     return res;
  85. //   }
  86. // };
  87.  
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/rHAEDl
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!