fork download
copy 
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S, class T> inline S chmin(S &a, T b){
  5.   if(a>b){
  6.     a=b;
  7.   }
  8.   return a;
  9. }
  10. template<class S, class T> inline S chmax(S &a, T b){
  11.   if(a<b){
  12.     a=b;
  13.   }
  14.   return a;
  15. }
  16. #define main dummy_main
  17. int main(){
  18.   return 0;
  19. }
  20. #undef main
  21. int arr[500000+2];
  22. int mn[100];
  23. int mx[100];
  24. class Solution{
  25.   public:
  26.   int findTheLongestSubstring(string s){
  27.     int i;
  28.     int N = s.size();
  29.     int res = 0;
  30.     arr[0] = 0;
  31.     for(i=(0);i<(N);i++){
  32.       arr[i+1] = arr[i];
  33.       if(s[i]=='a'){
  34.         arr[i+1] ^= (1<<0);
  35.       }
  36.       if(s[i]=='i'){
  37.         arr[i+1] ^= (1<<1);
  38.       }
  39.       if(s[i]=='u'){
  40.         arr[i+1] ^= (1<<2);
  41.       }
  42.       if(s[i]=='e'){
  43.         arr[i+1] ^= (1<<3);
  44.       }
  45.       if(s[i]=='o'){
  46.         arr[i+1] ^= (1<<4);
  47.       }
  48.     }
  49.     for(i=(0);i<(1<<5);i++){
  50.       mn[i] = 1073709056;
  51.       mx[i] = -1;
  52.     }
  53.     for(i=(0);i<(N+1);i++){
  54.       chmin(mn[arr[i]], i);
  55.       chmax(mx[arr[i]], i);
  56.     }
  57.     for(i=(0);i<(1<<5);i++){
  58.       chmax(res, mx[i]-mn[i]);
  59.     }
  60.     return res;
  61.   }
  62. }
  63. ;
  64. // cLay varsion 20200308-1
  65.  
  66. // --- original code ---
  67. // #define main dummy_main
  68. // {}
  69. // #undef main
  70. // 
  71. // int arr[5d5+2];
  72. // int mn[100], mx[100];
  73. // 
  74. // class Solution {
  75. // public:
  76. //   int findTheLongestSubstring(string s) {
  77. //     int N = s.size();
  78. //     int res = 0;
  79. // 
  80. //     arr[0] = 0;
  81. //     rep(i,N){
  82. //       arr[i+1] = arr[i];
  83. //       if(s[i]=='a') arr[i+1] ^= (1<<0);
  84. //       if(s[i]=='i') arr[i+1] ^= (1<<1);
  85. //       if(s[i]=='u') arr[i+1] ^= (1<<2);
  86. //       if(s[i]=='e') arr[i+1] ^= (1<<3);
  87. //       if(s[i]=='o') arr[i+1] ^= (1<<4);
  88. //     }
  89. // 
  90. //     rep(i,1<<5) mn[i] = int_inf, mx[i] = -1;
  91. //     rep(i,N+1){
  92. //       mn[arr[i]] <?= i;
  93. //       mx[arr[i]] >?= i;
  94. //     }
  95. //     rep(i,1<<5) res >?= mx[i]-mn[i];
  96. //     return res;
  97. //   }
  98. // };
  99.  
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/o8GvT7
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!