oj.uz

Submission #283647

# Submission time Handle Problem Language Result Execution time Memory
283647 2020-08-26T04:20:06 Z kdh9949 Žarulje (COI15_zarulje) C++17
0 / 100
 46 ms 2688 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vector<pil>;
using vpli = vector<pli>;
using vpll = vector<pll>;

#define x first
#define y second
#define all(v) v.begin(),v.end()

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

  int n, q;
  cin >> n >> q;

  vint a(n + 2);
  for(int i = 1; i <= n; i++) cin >> a[i];

  const static ll M = int(1e9) + 7;
  vll fa(n + 1, 1), fi(n + 1, 1);
  auto inv = [&](ll x) {
    ll r = 1;
    for(int k = M - 2; k; k /= 2, x = x * x % M) if(k & 1) r = r * x % M;
    return r;
  };
  for(int i = 1; i <= n; i++) {
    fa[i] = fa[i - 1] * i % M;
    fi[i] = inv(fa[i]);
  }
  auto com = [&](int n, int r) {
    if(n < 0 || r < 0 || r > n) return 0LL;
    return fa[n] * fi[r] % M * fi[n - r] % M;
  };

  while(q--) {
    int x;
    cin >> x;

    stack<pii> lst, rst;
    lst.emplace(0, 1);
    for(int i = 1; i < x; i++) {
      while(a[lst.top().x] > a[i]) lst.pop();
      if(a[lst.top().x] == a[i]) lst.top().y++;
      else lst.emplace(i, 1);
    }
    rst.emplace(n + 1, 1);
    for(int i = n; i > x; i--) {
      while(a[rst.top().x] > a[i]) rst.pop();
      if(a[rst.top().x] == a[i]) rst.top().y++;
      else rst.emplace(i, 1);
    }

    ll ans = 1;
    while(a[lst.top().x] && a[rst.top().x]) {
      int lv = a[lst.top().x], rv = a[rst.top().x];
      if(lv > rv) lst.pop();
      else if(lv < rv) rst.pop();
      else {
        ans = ans * com(lst.top().y + rst.top().y, lst.top().y);
        lst.pop();
        rst.pop();
      }
    }
    cout << ans << '\n';
  }

  return 0;
}

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 46 ms 448 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 46 ms 448 KB Output isn't correct
4 Halted 0 ms 0 KB -