fork download
copy 
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. #define main dummy_main
  5. int main(){
  6.   return 0;
  7. }
  8. #undef main
  9. int N;
  10. int vis[10000];
  11. int deg[10000];
  12. vector<int> lf;
  13. vector<int> rg;
  14. void solve(int n){
  15.   vis[n]++;
  16.   if(vis[n]!=1){
  17.     return;
  18.   }
  19.   if(lf[n]>=0){
  20.     solve(lf[n]);
  21.   }
  22.   if(rg[n]>=0){
  23.     solve(rg[n]);
  24.   }
  25. }
  26. class Solution{
  27.   public:
  28.   bool validateBinaryTreeNodes(int n, vector<int>& leftChild, vector<int>& rightChild){
  29.     int i;
  30.     N = n;
  31.     lf = leftChild;
  32.     rg = rightChild;
  33.     for(i=(0);i<(N);i++){
  34.       vis[i] = deg[i] = 0;
  35.     }
  36.     for(i=(0);i<(N);i++){
  37.       if(lf[i] >= 0){
  38.         deg[lf[i]]++;
  39.       }
  40.       if(rg[i] >= 0){
  41.         deg[rg[i]]++;
  42.       }
  43.     }
  44.     for(i=(0);i<(N);i++){
  45.       if(deg[i] == 0){
  46.         break;
  47.       }
  48.     }
  49.     if(i==N){
  50.       return false;
  51.     }
  52.     solve(i);
  53.     for(i=(0);i<(N);i++){
  54.       if(vis[i]!=1){
  55.         return false;
  56.       }
  57.     }
  58.     return true;
  59.   }
  60. }
  61. ;
  62. // cLay varsion 20200227-1
  63.  
  64. // --- original code ---
  65. // #define main dummy_main
  66. // {}
  67. // #undef main
  68. // 
  69. // int N, vis[1d4], deg[1d4];
  70. // vector<int> lf, rg;
  71. // 
  72. // void solve(int n){
  73. //   vis[n]++;
  74. //   if(vis[n]!=1) return;
  75. // 
  76. //   if(lf[n]>=0) solve(lf[n]);
  77. //   if(rg[n]>=0) solve(rg[n]);
  78. // }
  79. // 
  80. // class Solution {
  81. // public:
  82. //   bool validateBinaryTreeNodes(int n, vector<int>& leftChild, vector<int>& rightChild) {
  83. //     N = n;
  84. //     lf = leftChild;
  85. //     rg = rightChild;
  86. //     rep(i,N) vis[i] = deg[i] = 0;
  87. // 
  88. //     rep(i,N){
  89. //       if(lf[i] >= 0) deg[lf[i]]++;
  90. //       if(rg[i] >= 0) deg[rg[i]]++;
  91. //     }
  92. // 
  93. //     rep(i,N) if(deg[i] == 0) break;
  94. //     if(i==N) return false;
  95. // 
  96. //     solve(i);
  97. //     rep(i,N) if(vis[i]!=1) return false;
  98. // 
  99. //     return true;
  100. //   }
  101. // };
  102.  
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/ITkkS8
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!