fork download
  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 cnv[101];
  10. class Solution{
  11. public:
  12. bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces){
  13. int i;
  14. int j;
  15. int k = 0;
  16. for(i=(0);i<(101);i++){
  17. cnv[i] = -1;
  18. }
  19. for(i=(0);i<(arr.size());i++){
  20. cnv[arr[i]] = i;
  21. }
  22. for(i=(0);i<(pieces.size());i++){
  23. for(j=(0);j<(pieces[i].size());j++){
  24. pieces[i][j] = cnv[pieces[i][j]];
  25. }
  26. }
  27. sort(pieces.begin(), pieces.end());
  28. for(i=(0);i<(pieces.size());i++){
  29. for(j=(0);j<(pieces[i].size());j++){
  30. if(pieces[i][j] != k){
  31. return false;
  32. }
  33. k++;
  34. }
  35. }
  36. return true;
  37. }
  38. }
  39. ;
  40. // cLay varsion 20201101-1
  41.  
  42. // --- original code ---
  43. // #define main dummy_main
  44. // {}
  45. // #undef main
  46. //
  47. // int cnv[101];
  48. //
  49. // class Solution {
  50. // public:
  51. // bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
  52. // int i, j, k = 0;
  53. // rep(i,101) cnv[i] = -1;
  54. // rep(i,arr.size()) cnv[arr[i]] = i;
  55. // rep(i,pieces.size()) rep(j,pieces[i].size()) pieces[i][j] = cnv[pieces[i][j]];
  56. // sort(pieces.begin(), pieces.end());
  57. // rep(i,pieces.size()) rep(j,pieces[i].size()){
  58. // if(pieces[i][j] != k) return false;
  59. // k++;
  60. // }
  61. // return true;
  62. // }
  63. // };
  64.  
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
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
Standard output is empty