oj.uz

Submission #502007

# Submission time Handle Problem Language Result Execution time Memory
502007 2022-01-05T05:53:16 Z 600Mihnea Fish (IOI08_fish) C++17
95 / 100
 574 ms 52404 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>

using namespace std;


struct Fish {
  int sz;
  int tp;
};

bool operator < (Fish a, Fish b) {
  return a.sz < b.sz;
}

const int N = (int) 5e5 + 7;
int n, k, mod;
Fish a[N];
vector<int> aux[N], oftp[N];

int caneat(int f, int s) {
  int low = 0, high = (int) oftp[s].size() - 1, sol = 0;
  while (low <= high) {
    int mid = (low + high) / 2;
    if (a[oftp[f].back()].sz >= 2 * a[oftp[s][mid]].sz) {
      sol = mid + 1;
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  return sol;
}

int aux_order[N], aux_inv_order[N];

bool cmp(int i, int j) {
  return aux[i].back() < aux[j].back();
}
const int TM = 1048576 + 7;

int tree[TM];

void upd(int v, int tl, int tr, int i, int x) {
  if (tr < i || i < tl) {
    return;
  }
  if (tl == tr) {
    tree[v] = x % mod;
    return;
  }
  int tm = (tl + tr) / 2;
  upd(2 * v, tl, tm, i, x);
  upd(2 * v + 1, tm + 1, tr, i, x);
  tree[v] = tree[2 * v] * tree[2 * v + 1] % mod;
}

int get(int v, int tl, int tr, int l, int r) {
  if (tr < l || r < tl) {
    return 1;
  }
  if (l <= tl && tr <= r) {
    return tree[v];
  }
  int tm = (tl + tr) / 2;
  return get(2 * v, tl, tm, l, r) * get(2 * v + 1, tm + 1, tr, l, r) % mod;
}

int nxt;

void upd(int i, int x) {
  upd(1, 1, nxt, i, x);
}

int get(int l, int r) {
  return get(1, 1, nxt, l, r);
}

int thesol[N], frq[N], lc[N], rc[N], full[N], semi[N];

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

  for (int i = 1; i < TM; i++) {
    tree[i] = 1;
  }

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

  cin >> n >> k >> mod;
  int init_n = n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].sz >> a[i].tp;
  }
  bool debug = (a[1].tp == 374545);

  sort(a + 1, a + n + 1);


  for (int i = 1; i <= n; i++) {
    aux[a[i].tp].push_back(i);
  }
  n = k;
  for (int i = 1; i <= n; i++) {
    aux_order[i] = i;
  }
  nxt = 1;
  while (nxt < n) nxt *= 2;

  sort(aux_order + 1, aux_order + n + 1, cmp);

  for (int i = 1; i <= n; i++) aux_inv_order[aux_order[i]] = i;
  if (debug) exit(0);
  for (int i = 1; i <= n; i++) oftp[i] = aux[aux_order[i]];
  for (int i = 1; i <= n; i++) aux[i] = oftp[i];

  for (int i = 1; i <= init_n; i++) a[i].tp = aux_inv_order[a[i].tp];

  int go = 1, print = 0;

  if (debug) exit(0);
  for (int i = 1; i <= n; i++) {
    while (2 * a[go].sz <= a[oftp[i].back()].sz) {
      frq[a[go].tp]++;
      upd(a[go].tp, frq[a[go].tp] + 1);
      go++;
    }
    thesol[i] = get(1, i - 1);
    full[i] = 1;
    semi[i] = caneat(i, i) % mod;
    int last = i, low = i + 1, high = n;
    while (low <= high) {
      int j = (low + high) / 2;
      if (caneat(j, i) == caneat(i, i)) {
        last = j;
        low = j + 1;
      } else {
        high = j - 1;
      }
    }
    full[i] = get(i + 1, last);
    full[i] = full[i] * thesol[i] % mod;
    semi[i] = semi[i] * thesol[i] % mod;

    print = (print + full[i]) % mod;
    print = (print + semi[i]) % mod;
  }
  cout << print << "\n";

  return 0;
}

/**
**/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27960 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27852 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27960 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27852 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27852 KB Output is correct
2 Correct 14 ms 27932 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 27932 KB Output is correct
2 Correct 174 ms 36216 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 27980 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 27944 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 31648 KB Output is correct
2 Correct 94 ms 32548 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28108 KB Output is correct
2 Correct 21 ms 28052 KB Output is correct
3 Correct 17 ms 28108 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 33560 KB Output is correct
2 Correct 205 ms 36636 KB Output is correct
3 Correct 189 ms 37416 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 37092 KB Output is correct
2 Correct 192 ms 37000 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 33728 KB Output is correct
2 Correct 197 ms 37196 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 36764 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 37820 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 37336 KB Output is correct
2 Correct 276 ms 41932 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 44836 KB Output is correct
2 Correct 339 ms 43844 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 47756 KB Output is correct
2 Correct 382 ms 42340 KB Output is correct
3 Correct 436 ms 52404 KB Output is correct
4 Correct 391 ms 42436 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 49416 KB Output is correct
2 Incorrect 329 ms 51240 KB Output isn't correct
3 Halted 0 ms 0 KB -