oj.uz

답안 #763642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
763642 2023-06-22T14:41:01 Z GrindMachine Žarulje (COI15_zarulje) C++17
60 / 100
 1000 ms 6172 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi
https://github.com/farmerboy95/CompetitiveProgramming/blob/92f327caaade93b9087bc969d8ed6fa4f596048c/COI/COI%2015-zarulje.cpp

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll fact[N], ifact[N];

ll bexp(ll a, ll b) {
    a %= MOD;
    if (a == 0) return 0;

    ll res = 1;

    while (b) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }

    return res;
}

ll invmod(ll a) {
    return bexp(a, MOD - 2);
}

ll ncr(ll n, ll r) {
    if (n < 0 or r < 0 or n < r) return 0;
    return fact[n] * ifact[r] % MOD * ifact[n - r] % MOD;
}

ll npr(ll n, ll r) {
    if (n < 0 or r < 0 or n < r) return 0;
    return fact[n] * ifact[n - r] % MOD;
}

void precalc(ll n) {
    fact[0] = 1;
    rep1(i, n) fact[i] = fact[i - 1] * i % MOD;

    ifact[n] = invmod(fact[n]);
    rev(i, n - 1, 0) ifact[i] = ifact[i + 1] * (i + 1) % MOD;
}

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    precalc(n);

    vector<ll> a(n+5), b(k+5);
    rep1(i,n) cin >> a[i];
    rep1(i,k) cin >> b[i];

    rep1(ind,k){
        ll p = b[ind];
        ll mn = inf2;
        map<ll,pll> mp;

        for(int i = p+1; i <= n; ++i){
            if(a[i] > mn){
                // will def be removed without any option
                conts;
            }

            mn = a[i];
            mp[a[i]].ff++;
        }

        mn = inf2;
        rev(i,p-1,1){
            if(a[i] > mn){
                conts;
            }

            mn = a[i];
            mp[a[i]].ss++;
        }

        ll ans = 1;
        for(auto [val,px] : mp){
            ll ways = ncr(px.ff+px.ss, px.ff);
            ans = ans * ways % MOD;
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 408 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3064 KB Output is correct
2 Correct 14 ms 5332 KB Output is correct
3 Correct 14 ms 5588 KB Output is correct
4 Correct 16 ms 5784 KB Output is correct
5 Correct 19 ms 5904 KB Output is correct
6 Correct 16 ms 6160 KB Output is correct
7 Correct 18 ms 6172 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 408 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 7 ms 3064 KB Output is correct
8 Correct 14 ms 5332 KB Output is correct
9 Correct 14 ms 5588 KB Output is correct
10 Correct 16 ms 5784 KB Output is correct
11 Correct 19 ms 5904 KB Output is correct
12 Correct 16 ms 6160 KB Output is correct
13 Correct 18 ms 6172 KB Output is correct
14 Correct 103 ms 732 KB Output is correct
15 Execution timed out 1089 ms 4544 KB Time limit exceeded
16 Halted 0 ms 0 KB -