oj.uz

Submission #509835

# Submission time Handle Problem Language Result Execution time Memory
509835 2022-01-14T10:58:38 Z 600Mihnea Archery (IOI09_archery) C++17
94 / 100
 2000 ms 28856 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2 * 200000 + 7;
const int INF = (int) 1e9 + 7;
int n;
int r;
int my_rank;
int init_ord[N];
int ord[N];
int winner[N];
int loser[N];
bool wannap;
int thesol[N];

int rep(int x) {
  x %= n;
  if (x < 0) x += n;
  return x;
}

enum TYPE {BIG, SMALL, EQUAL};

int cnt_big[N];
int cnt_equal[N];

TYPE type[N];
int low, high;
pair<int, int> guys[2 * N];


int get_smart(int x) {
  if (my_rank == 0) {
    return 0;
  }
  if (my_rank <= n) {
    int pos = 2 * x;
    ord[pos] = my_rank;
    for (int i = 0; i < pos; i++) {
      ord[i] = init_ord[i];
    }
    for (int i = pos + 1; i < 2 * n; i++) {
      ord[i] = init_ord[i - 1];
    }
    low = 1;
    high = 0;
    for (int i = 0; i < 2 * n; i++) {
      guys[++high] = {i / 2, ord[i]};
    }
    int ant = max(ord[0], ord[1]);
    set<int> inside;
    vector<int> mxs;
    for (int iter = 1; iter <= r; iter++) {
      while (low <= high && guys[low].first < iter) inside.insert(guys[low++].second);
      auto smallestIt = inside.begin();
      int smallest = *smallestIt;
      inside.erase(smallestIt);
      if (iter == 1) {
        inside.clear();
      }
      int nw = iter - 1 + n;
      int mx = max(smallest, ant);
      int mn = min(smallest, ant);
      mxs.push_back(mx);
      ant = mn;
      guys[++high] = {nw, mx};
    }
    assert(high < 2 * N);
    int last_seen = -1, transfering = 0;
    for (int i = 0; i < r; i++) {
      if (mxs[i] == my_rank) {
        last_seen = i;
        transfering++;
      }
    }
    int thepos = n - (r - 1 - last_seen) - 1;
    return thepos - n * transfering;
  }
  int pos = 2 * x;
  ord[pos] = my_rank;
  for (int i = 0; i < pos; i++) {
    ord[i] = init_ord[i];
  }
  for (int i = pos + 1; i < 2 * n; i++) {
    ord[i] = init_ord[i - 1];
  }
  for (int i = 0; i < 2 * n; i++) {
    if (ord[i] == my_rank) {
      type[i] = EQUAL;
    }
    if (ord[i] > my_rank) {
      type[i] = BIG;
    }
    if (ord[i] < my_rank) {
      type[i] = SMALL;
    }
  }
  for (int i = 0; i < n; i++) {
    cnt_big[i] = (type[2 * i] == BIG) + (type[2 * i + 1] == BIG);
    cnt_equal[i] = (type[2 * i] == EQUAL) + (type[2 * i + 1] == EQUAL);
  }
  int big_in_hand = 0, equal_in_hand = 0, transfering = 0;
  function<void()> handle0 = [&] () {
    /// if EQUAL vs BIG => EQUAL remains, BIG goes

    int the_sum = cnt_big[0] + cnt_equal[0];
    big_in_hand += cnt_big[0];
    equal_in_hand += cnt_equal[0];
    cnt_big[0] = cnt_equal[0] = 0;

    if (the_sum != 2) {
      /// there is a small one and it pushes them away
      transfering += (equal_in_hand);
      return;
    }

    if (equal_in_hand) {
      cnt_equal[0] = 1;
      equal_in_hand = 0;
    } else {
      if (big_in_hand) {
        cnt_big[0] = 1;
        big_in_hand--;
      }
    }
    transfering += (equal_in_hand);
  };
  function<void(int)> handlenot0 = [&] (int i) {

    /// if EQUAL vs BIG => BIG remains, EQUAL goes
    big_in_hand += cnt_big[i];
    equal_in_hand += cnt_equal[i];

    cnt_big[i] = cnt_equal[i] = 0;

    if (big_in_hand) {
      cnt_big[i] = 1;
      big_in_hand--;
    } else {
      if (equal_in_hand) {
        cnt_equal[i] = 1;
        equal_in_hand = 0;
      }
    }
  };

  handle0();
  for (int i = n - 1; i >= 1; i--) handlenot0(i);

  handle0();
  for (int i = n - 1; i >= 1; i--) handlenot0(i);

  int thepos = -1;
  for (int i = 0; i < n; i++) {
    if (cnt_equal[i]) {
      thepos = i;
    }
  }
  assert(thepos != -1);

  return thepos - n * transfering;
}

int get(int x) {
  if (thesol[x] != INF) {
    return thesol[x];
  }
  thesol[x] = get_smart(x);
  return thesol[x];
}



int mn = (int) 1e9;
int best = -1;

void upd(int i) {
  int x = get(i);
  int y = rep(x);
  if (y < mn) {
    mn = y;
    best = i;
  } else {
    if (y == mn) {
      best = max(best, i);
    }
  }
}

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  ///freopen ("input", "r", stdin);

  for (int i = 0; i < N; i++) {
    thesol[i] = INF;
  }

  wannap = 0;

  cin >> n >> r;
  r = 2 * n + r % n;
  cin >> my_rank;
  my_rank--;
  for (int i = 0; i < 2 * n - 1; i++) {
    cin >> init_ord[i];
    init_ord[i]--;
  }
  upd(0);
  upd(n - 1);
  {
    int low = 0, high = n - 1;
    while (low <= high) {
      int mid = (low + high) / 2;
      upd(mid);
      if (get(mid) == get(0)) {
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
  }
  int L = get(0), R = get(n - 1);
  for (int j = L; j <= R; j++) {
    if (j % n) {
      continue;
    }
    int low = 0, high = n - 1, the_value = INF;
    while (low <= high) {
      int mid = (low + high) / 2;
      upd(mid);
      if (get(mid) >= j) {
        high = mid - 1;
        the_value = mid;
      } else {
        low = mid + 1;
      }
    }
    low = the_value;
    high = n - 1;
    while (low <= high) {
      int mid = (low + high) / 2;
      upd(mid);
      if (get(mid) == get(the_value)) {
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
  }
  cout << best + 1 << "\n";
  return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 1 ms 1868 KB Output is correct
3 Correct 2 ms 1868 KB Output is correct
4 Correct 27 ms 2240 KB Output is correct
5 Correct 1 ms 1868 KB Output is correct
6 Correct 1 ms 1868 KB Output is correct

Subtask #2
88.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 18 ms 2096 KB Output is correct
4 Correct 238 ms 3804 KB Output is correct
5 Execution timed out 2069 ms 28856 KB Time limit exceeded
6 Correct 2 ms 1868 KB Output is correct
7 Correct 4 ms 1996 KB Output is correct
8 Correct 88 ms 3540 KB Output is correct
9 Correct 340 ms 4176 KB Output is correct
10 Correct 11 ms 1996 KB Output is correct
11 Correct 384 ms 4384 KB Output is correct
12 Correct 31 ms 2220 KB Output is correct
13 Execution timed out 2070 ms 16592 KB Time limit exceeded
14 Correct 65 ms 2572 KB Output is correct
15 Correct 677 ms 5876 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 17 ms 2088 KB Output is correct
18 Correct 23 ms 2184 KB Output is correct
19 Correct 45 ms 2380 KB Output is correct
20 Correct 92 ms 2508 KB Output is correct
21 Correct 304 ms 4328 KB Output is correct
22 Correct 575 ms 5628 KB Output is correct
23 Execution timed out 2091 ms 22092 KB Time limit exceeded
24 Correct 1 ms 1868 KB Output is correct
25 Correct 2 ms 1868 KB Output is correct
26 Correct 4 ms 2104 KB Output is correct
27 Correct 25 ms 2508 KB Output is correct
28 Correct 141 ms 5888 KB Output is correct
29 Correct 2 ms 1868 KB Output is correct
30 Correct 4 ms 2096 KB Output is correct
31 Correct 11 ms 2508 KB Output is correct
32 Correct 118 ms 7392 KB Output is correct
33 Correct 1 ms 1868 KB Output is correct
34 Correct 1 ms 1868 KB Output is correct
35 Correct 2 ms 1996 KB Output is correct
36 Correct 2 ms 1996 KB Output is correct
37 Correct 11 ms 2380 KB Output is correct
38 Correct 19 ms 2596 KB Output is correct
39 Correct 2 ms 1868 KB Output is correct
40 Correct 2 ms 1868 KB Output is correct
41 Correct 3 ms 1996 KB Output is correct
42 Correct 2 ms 1996 KB Output is correct
43 Correct 4 ms 1996 KB Output is correct
44 Correct 9 ms 2124 KB Output is correct
45 Correct 12 ms 2508 KB Output is correct
46 Correct 12 ms 2508 KB Output is correct
47 Correct 134 ms 8132 KB Output is correct