Submission #754185

#	Time	Username	Problem	Language	Result	Execution time	Memory
754185		nicksms	마상시합 토너먼트 (IOI12_tournament)	C++17	0 / 100	85 ms	3964 KiB

tournament

#include <bits/extc++.h>
int ans[100001],cl[100000],cr[100000];

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
  struct p {int x,y;};
  __gnu_cxx::rope<p> g;
  int cnt = 0;
  for (int i = 0; i < N-1; i++) if (K[i] > R) {
    cl[i+1]++;
    cr[i]++;
    cnt++;
  }
  for (int i = 1; i < N; i++) cl[i]+=cl[i-1];
  for (int i = N-2; i >= 0; i--) cr[i]+=cr[i+1];
  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]--;
  }
  int a = ans[0];
  for (int i = 1; i <= N; i++) a=std::max(a,ans[i] += ans[i-1]);
  return a;
}

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