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. class Solution{
  10.   public:
  11.   vector<string> mostVisitedPattern(vector<string>& user, vector<int>& tm, vector<string>& web){
  12.     int N, a, b, c, i, j, k, ress=-1;
  13.     map<vector<string>,int> mp;
  14.     set<string> done;
  15.     set<vector<string> > done2;
  16.     vector<string> res, tmp, vis;
  17.     N = user.size();
  18.     for(i=0;i<(N);i++){
  19.       for(j=(1);j<(N);j++){
  20.         if(tm[j-1] > tm[j]){
  21.           swap(user[j-1], user[j]);
  22.           swap(tm[j-1], tm[j]);
  23.           swap(web[j-1], web[j]);
  24.         }
  25.       }
  26.     }
  27.     for(i=0;i<(N);i++){
  28.       if(done.count(user[i])){
  29.         continue;
  30.       }
  31.       done.insert(user[i]);
  32.       vis.clear();
  33.       for(j=0;j<(N);j++){
  34.         if(user[j]==user[i]){
  35.           vis.push_back(web[j]);
  36.         }
  37.       }
  38.       done2.clear();
  39.       k = vis.size();
  40.       for(a=0;a<(k);a++){
  41.         for(b=(a+1);b<(k);b++){
  42.           for(c=(b+1);c<(k);c++){
  43.             tmp.clear();
  44.             tmp.push_back(vis[a]);
  45.             tmp.push_back(vis[b]);
  46.             tmp.push_back(vis[c]);
  47.             if(done2.count(tmp)){
  48.               continue;
  49.             }
  50.             done2.insert(tmp);
  51.             mp[tmp]++;
  52.             if(ress < mp[tmp] || (ress == mp[tmp] && res > tmp)){
  53.               res = tmp;
  54.               ress = mp[tmp];
  55.             }
  56.           }
  57.         }
  58.       }
  59.     }
  60.     return res;
  61.   }
  62. }
  63. ;
  64. // cLay varsion 20190817-1
  65.  
  66. // --- original code ---
  67. // #define main dummy_main
  68. // {}
  69. // #undef main
  70. // 
  71. // class Solution {
  72. // public:
  73. //   vector<string> mostVisitedPattern(vector<string>& user, vector<int>& tm, vector<string>& web) {
  74. //     int i, j, k, a, b, c;
  75. //     int N;
  76. //     set<string> done;
  77. //     vector<string> vis;
  78. // 
  79. //     set<vector<string> > done2;
  80. //     map<vector<string>,int> mp;
  81. // 
  82. //     vector<string> res, tmp;
  83. //     int ress = -1;
  84. // 
  85. //     
  86. //     N = user.size();
  87. // 
  88. //     rep(i,N) rep(j,1,N) if(tm[j-1] > tm[j]){
  89. //       swap(user[j-1], user[j]);
  90. //       swap(tm[j-1], tm[j]);
  91. //       swap(web[j-1], web[j]);
  92. //     }
  93. // 
  94. //     rep(i,N){
  95. //       if(done.count(user[i])) continue;
  96. //       done.insert(user[i]);
  97. // 
  98. //       vis.clear();
  99. //       rep(j,N) if(user[j]==user[i]) vis.push_back(web[j]);
  100. // 
  101. //       done2.clear();
  102. //       k = vis.size();
  103. //       rep(a,k) rep(b,a+1,k) rep(c,b+1,k){
  104. //         tmp.clear();
  105. //         tmp.push_back(vis[a]);
  106. //         tmp.push_back(vis[b]);
  107. //         tmp.push_back(vis[c]);
  108. //         if(done2.count(tmp)) continue;
  109. //         done2.insert(tmp);
  110. //         mp[tmp]++;
  111. //         if(ress < mp[tmp] || (ress == mp[tmp] && res > tmp)){
  112. //           res = tmp;
  113. //           ress = mp[tmp];
  114. //         }
  115. //       }
  116. //     }
  117. // 
  118. //     return res;
  119. //   }
  120. // };
  121.  
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/7WZF75
language:
C++14 (gcc 8.3)
created:
6 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!