fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S> void arrErase(int k, int &sz, S a[]){
  5. int i;
  6. sz--;
  7. for(i=(k);i<(sz);i++){
  8. a[i] = a[i+1];
  9. }
  10. }
  11. template<class S, class T> void arrErase(int k, int &sz, S a[], T b[]){
  12. int i;
  13. sz--;
  14. for(i=(k);i<(sz);i++){
  15. a[i] = a[i+1];
  16. }
  17. for(i=(k);i<(sz);i++){
  18. b[i] = b[i+1];
  19. }
  20. }
  21. template<class S, class T, class U> void arrErase(int k, int &sz, S a[], T b[], U c[]){
  22. int i;
  23. sz--;
  24. for(i=(k);i<(sz);i++){
  25. a[i] = a[i+1];
  26. }
  27. for(i=(k);i<(sz);i++){
  28. b[i] = b[i+1];
  29. }
  30. for(i=(k);i<(sz);i++){
  31. c[i] = c[i+1];
  32. }
  33. }
  34. template<class S> inline void arrInsert(const int k, int &sz, S a[], const S aval){
  35. int i;
  36. sz++;
  37. for(i=sz-1;i>k;i--){
  38. a[i] = a[i-1];
  39. }
  40. a[k] = aval;
  41. }
  42. template<class S, class T> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval){
  43. int i;
  44. sz++;
  45. for(i=sz-1;i>k;i--){
  46. a[i] = a[i-1];
  47. }
  48. for(i=sz-1;i>k;i--){
  49. b[i] = b[i-1];
  50. }
  51. a[k] = aval;
  52. b[k] = bval;
  53. }
  54. template<class S, class T, class U> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval){
  55. int i;
  56. sz++;
  57. for(i=sz-1;i>k;i--){
  58. a[i] = a[i-1];
  59. }
  60. for(i=sz-1;i>k;i--){
  61. b[i] = b[i-1];
  62. }
  63. for(i=sz-1;i>k;i--){
  64. c[i] = c[i-1];
  65. }
  66. a[k] = aval;
  67. b[k] = bval;
  68. c[k] = cval;
  69. }
  70. template<class S, class T, class U, class V> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval, V d[], const V dval){
  71. int i;
  72. sz++;
  73. for(i=sz-1;i>k;i--){
  74. a[i] = a[i-1];
  75. }
  76. for(i=sz-1;i>k;i--){
  77. b[i] = b[i-1];
  78. }
  79. for(i=sz-1;i>k;i--){
  80. c[i] = c[i-1];
  81. }
  82. for(i=sz-1;i>k;i--){
  83. d[i] = d[i-1];
  84. }
  85. a[k] = aval;
  86. b[k] = bval;
  87. c[k] = cval;
  88. d[k] = dval;
  89. }
  90. #define main dummy_main
  91. int main(){
  92. return 0;
  93. }
  94. #undef main
  95. int P[1000];
  96. class Solution{
  97. public:
  98. vector<int> processQueries(vector<int>& queries, int m){
  99. int Q5VJL1cS, i;
  100. vector<int> res;
  101. for(i=(0);i<(m);i++){
  102. P[i] = i+1;
  103. }
  104. for(Q5VJL1cS=(0);Q5VJL1cS<(queries.size());Q5VJL1cS++){
  105. auto &k = queries[Q5VJL1cS];
  106. for(i=(0);i<(m);i++){
  107. if(P[i]==k){
  108. break;
  109. }
  110. }
  111. res.push_back(i);
  112. arrErase(i,m,P);
  113. arrInsert(0,m,P,k);
  114. }
  115. return res;
  116. }
  117. }
  118. ;
  119. // cLay varsion 20200419-1
  120.  
  121. // --- original code ---
  122. // #define main dummy_main
  123. // {}
  124. // #undef main
  125. //
  126. // int P[1000];
  127. //
  128. // class Solution {
  129. // public:
  130. // vector<int> processQueries(vector<int>& queries, int m) {
  131. // vector<int> res;
  132. // rep(i,m) P[i] = i+1;
  133. // rep[queries](k,queries.size()){
  134. // rep(i,m) if(P[i]==k) break;
  135. // res.push_back(i);
  136. // arrErase(i,m,P);
  137. // arrInsert(0,m,P,k);
  138. // }
  139. // return res;
  140. // }
  141. // };
  142.  
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