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 max_L(S a,T b){
  5.   return a>=b?a:b;
  6. }
  7. #define main dummy_main
  8. int main(){
  9.   return 0;
  10. }
  11. #undef main
  12. int doit[100000];
  13. class Solution{
  14.   public:
  15.   vector<int> busiestServers(int n, vector<int>& arrival, vector<int>& load){
  16.     int i;
  17.     int mx;
  18.     int x;
  19.     int y;
  20.     int k;
  21.     set<int> ave;
  22.     set<int>::iterator it;
  23.     set<pair<int,int>> work;
  24.     vector<int> res;
  25.     for(i=(0);i<(n);i++){
  26.       doit[i] = 0;
  27.     }
  28.     for(i=(0);i<(n);i++){
  29.       ave.insert(i);
  30.     }
  31.     for(i=(0);i<(arrival.size());i++){
  32.       x = arrival[i];
  33.       y = arrival[i] + load[i];
  34.       while(work.size() && work.begin()->first <= x){
  35.         ave.insert(work.begin()->second);
  36.         work.erase(work.begin());
  37.       }
  38.       if(ave.size()==0){
  39.         continue;
  40.       }
  41.       it = ave.lower_bound(i%n);
  42.       if(it == ave.end()){
  43.         it = ave.begin();
  44.       }
  45.       k = *it;
  46.       ave.erase(it);
  47.       work.insert(make_pair(y, k));
  48.       doit[k]++;
  49.     }
  50.     {
  51.       int WYIGIcGE;
  52.       int t_ynMSdg;
  53.       if(n==0){
  54.         t_ynMSdg = 0;
  55.       }
  56.       else{
  57.         t_ynMSdg = doit[0];
  58.         for(WYIGIcGE=(1);WYIGIcGE<(n);WYIGIcGE++){
  59.           t_ynMSdg = max_L(t_ynMSdg, doit[WYIGIcGE]);
  60.         }
  61.       }
  62.       mx =t_ynMSdg;
  63.     }
  64.     for(i=(0);i<(n);i++){
  65.       if(doit[i]==mx){
  66.         res.push_back(i);
  67.       }
  68.     }
  69.     return res;
  70.   }
  71. }
  72. ;
  73. // cLay version 20201121-1
  74.  
  75. // --- original code ---
  76. // #define main dummy_main
  77. // {}
  78. // #undef main
  79. // 
  80. // int doit[1d5];
  81. // 
  82. // class Solution {
  83. // public:
  84. //   vector<int> busiestServers(int n, vector<int>& arrival, vector<int>& load) {
  85. //     int mx, x, y, k;
  86. //     set<int> ave;
  87. //     set<int>::iterator it;
  88. //     set<pair<int,int>> work;
  89. //     vector<int> res;
  90. // 
  91. //     rep(i,n) doit[i] = 0;
  92. //     rep(i,n) ave.insert(i);
  93. // 
  94. //     rep(i,arrival.size()){
  95. //       x = arrival[i];
  96. //       y = arrival[i] + load[i];
  97. //       while(work.size() && work.begin()->first <= x){
  98. //         ave.insert(work.begin()->second);
  99. //         work.erase(work.begin());
  100. //       }
  101. // 
  102. //       if(ave.size()==0) continue;
  103. //       it = ave.lower_bound(i%n);
  104. //       if(it == ave.end()) it = ave.begin();
  105. //       k = *it;
  106. //       ave.erase(it);
  107. // 
  108. //       work.insert(make_pair(y, k));
  109. //       doit[k]++;
  110. //     }
  111. // 
  112. //     mx = max(doit(n));
  113. //     rep(i,n) if(doit[i]==mx) res.push_back(i);
  114. //     return res;
  115. //   }
  116. // };
  117.  
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/NDVRcZ
language:
C++ (gcc 8.3)
created:
3 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!