Submission #754178

#	Time	Username	Problem	Language	Result	Execution time	Memory
754178		nicksms	Jousting tournament (IOI12_tournament)	C++17	100 / 100	183 ms	6912 KiB

tournament

#include <bits/extc++.h>
using namespace std;

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
  struct p {int x,y;};
  __gnu_cxx::rope<p> g;
  vector<int> ans(N+1),cl(N),cr(N);
  int cnt = 0;
  for (int i = 0; i < N-1; i++) if (K[i] > R) {
    cl[i+1]++;
    cr[i]++;
    cnt++;
  }
  partial_sum(cl.begin(),cl.end(),cl.begin());
  partial_sum(cr.rbegin(),cr.rend(),cr.rbegin());
  for (int i = 0; i < N; i++) g.push_back({i,i});
  for (int i = 0; i < C; i++) {
    int l=g[S[i]].x,r=g[E[i]].y;
    g.erase(S[i],E[i]-S[i]+1);
    g.insert(S[i],{l,r});
    if (cl[l]+cr[r]==cnt) ans[l]++,ans[r+1]--;
  }
  partial_sum(ans.begin(),ans.end(),ans.begin());
 
  return max_element(ans.begin(),ans.begin()+N)-ans.begin();
}

• Subtask 1: 17 / 17
• Subtask 2: 32 / 32
• Subtask 3: 51 / 51