Submission #763587

#	Time	Username	Problem	Language	Result	Execution time	Memory
763587		GrindMachine	Žarulje (COI15_zarulje)	C++17	22 / 100	294 ms	524288 KiB

zarulje

// 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

/*



*/

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

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> a(n+5), b(k+5);
    rep1(i,n) cin >> a[i];
    rep1(i,k) cin >> b[i];

    ll dp[n+5][n+5];
    memset(dp,0,sizeof dp);

    dp[1][n] = 1;

    rep1(l,n){
        rev(r,n,l){
            if(l == 1 and r == n) conts;
            if(a[r+1] > a[l-1]){
                dp[l][r] = dp[l][r+1];
            }
            else if(a[r+1] < a[l-1]){
                dp[l][r] = dp[l-1][r];
            }
            else{
                dp[l][r] = (dp[l][r+1] + dp[l-1][r]) % MOD;
            }
        }
    }

    rep1(i,k){
        ll ans = dp[b[i]][b[i]];
        cout << ans << endl;
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 0 / 38
• Subtask 3: 0 / 40