oj.uz

Submission #501876

# Submission time Handle Problem Language Result Execution time Memory
501876 2022-01-04T17:51:27 Z 600Mihnea Fish (IOI08_fish) C++17
70 / 100
 3000 ms 41172 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

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];

bool cmp(int i, int j) {
  return aux[i].back() < aux[j].back();
}

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

  cin >> n >> k >> mod;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].sz >> a[i].tp;
  }
  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;
  }

  sort(aux_order + 1, aux_order + n + 1, cmp);
  for (int i = 1; i <= n; i++) oftp[i] = aux[aux_order[i]];
  for (int i = 1; i <= n; i++) aux[i] = oftp[i];

  int print = 0;
  for (int i = n; i >= 1; i--) {
    int full = 1, semi = caneat(i, i);
    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;
      }
    }
    for (int j = i + 1; j <= last; j++) {
      full = full * (ll) (caneat(i, j) + 1) % mod;
    }

    int sol = 1;
    for (int j = 1; j < i; j++) {
      sol = sol * (ll) (caneat(i, j) + 1) % mod;
    }
    full = full * (ll) sol % mod;
    semi = semi * (ll) sol % mod;

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

  return 0;
}

/**
**/

Subtask #1
4.0 / 4.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23736 KB Output is correct

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 123 ms 31864 KB Output is correct

Subtask #7
6.0 / 6.0

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

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23848 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 27448 KB Output is correct
2 Correct 82 ms 28408 KB Output is correct

Subtask #10
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 23884 KB Output is correct
2 Correct 25 ms 23904 KB Output is correct
3 Correct 36 ms 23872 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 29392 KB Output is correct
2 Correct 392 ms 32540 KB Output is correct
3 Correct 325 ms 33228 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 32696 KB Output is correct
2 Correct 480 ms 32852 KB Output is correct

Subtask #13
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 29540 KB Output is correct
2 Correct 2016 ms 33084 KB Output is correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3074 ms 32324 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3090 ms 33352 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3074 ms 32280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3056 ms 37772 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3088 ms 40600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3086 ms 41172 KB Time limit exceeded
2 Halted 0 ms 0 KB -