oj.uz

Submission #501797

# Submission time Handle Problem Language Result Execution time Memory
501797 2022-01-04T15:10:33 Z 600Mihnea Fish (IOI08_fish) C++17
0 / 100
 3000 ms 33184 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Guy {
  int sz;
  int type;
};

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

const int N = (int) 5e5 + 7;
int n, k, mod, pref[N];
Guy a[N];
vector<int> where[N];

int getCnt(int prefix, int type) {
  assert(0 <= prefix && prefix <= n);
  assert(1 <= type && type <= k);
  int sol = 0;
  int low = 0, high = (int) where[type].size() - 1;
  while (low <= high) {
    int mid = (low + high) / 2;
    if (where[type][mid] <= prefix) {
      sol = mid + 1;
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  return sol;
}


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

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

  cin >> n >> k >> mod;

  for (int i = 1; i <= n; i++) {
    cin >> a[i].sz >> a[i].type;
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    where[a[i].type].push_back(i);
  }
  vector<int> potential;
  for (int i = 1; i <= k; i++) {
    assert(!where[i].empty());
    if (where[i].back() != n) {
      potential.push_back(where[i].back());
    }
  }

  {
    int pt = 0;
    for (int i = 1; i <= n; i++) {
      while (pt + 1 <= n && a[pt + 1].sz * 2 <= a[i].sz) {
        pt++;
      }
      assert(pt < i);
      pref[i] = pt;
    }
  }
  sort(potential.begin(), potential.end());
  assert((int) potential.size() == k - 1);
  int print = 0;

  {
    /// for the last one it is quite easy
    int sol = 1;
    for (int i = 1; i <= k; i++) {
      int frq = getCnt(pref[n], i);
      sol = sol * (ll) (frq + 1) % mod;
    }
    print += sol;
    if (print >= mod) {
      print -= mod;
    }
  }

  sort(potential.begin(), potential.end());
  assert((int) potential.size() == k - 1);

  for (int step = (int) potential.size() - 1; step >= 0; step--) {
    int ind = potential[step];
    {
      int sol = 1;
      for (int s = 0; s < step; s++) {
        int frq = getCnt(pref[n], a[potential[step]].type);
        sol = sol * (ll) (frq + 1) % mod;
      }
      print += sol;
      if (print >= mod) {
        print -= mod;
      }
    }
    if (getCnt(pref[ind], a[ind].type) + 1 <= getCnt(pref[n], a[ind].type)) {
      /// it is only useful when we cast smaller guys than him

    } else {
      /// et extra when Il y a maximum
      int sol = 1;
      for (int i = 1; i <= k; i++) {
        if (i == a[ind].type) {
          continue; /// no choice
        }
        int frq = getCnt(pref[n], i);
        sol = sol * (ll) (frq + 1) % mod;
      }
      print += sol;
      if (print >= mod) {
        print -= mod;
      }
    }
  }
  cout << print << "\n";
  return 0;
}

/**
: [1] [1,2] [2]
**/

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 12068 KB Output isn't correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 12052 KB Output isn't correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 12068 KB Output isn't correct

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 11980 KB Output isn't correct

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12072 KB Output is correct
2 Incorrect 7 ms 12108 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11980 KB Output is correct
2 Incorrect 134 ms 26480 KB Output isn't correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 12108 KB Output isn't correct

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 12108 KB Output isn't correct

Subtask #9
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 18156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 12188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 161 ms 21756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 27200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 284 ms 21892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3012 ms 26620 KB Time limit exceeded

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3069 ms 28872 KB Time limit exceeded

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3087 ms 26012 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 3011 ms 30432 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 3057 ms 29360 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 3100 ms 33184 KB Time limit exceeded
2 Halted 0 ms 0 KB -