oj.uz

답안 #484591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484591 2021-11-04T14:23:47 Z Victor Calvinball championship (CEOI15_teams) C++17
20 / 100
 259 ms 1336 KB 

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, arr[100001];
    set<ii> mx;
    cin >> n;
    rep(i, 0, n) {
        cin >> arr[i + 1];
        if(i)assert(arr[i + 1] - (--mx.end())->first <= 1);
        mx.emplace(arr[i + 1], i + 1);
    }

    ll ans = 1;
    vll dp(n + 1, 1), dp2(n + 1, 0);
    per(i, 2, n + 1) {
        mx.erase({arr[i], i});
        int curmx = (--mx.end())->first;

        rep(j, 1, i + 1) {
            if (1 < j) dp2[j - 1] = (dp2[j - 1] + dp[j]) % INF;
            if (j < i) dp2[j] = (dp2[j] + dp[j] * ll(j)) % INF;
        }

        ans = (ans + dp[curmx] * ll(arr[i] - 1)) % INF;
        // trav(item, dp) cout << item << ' ';
        // cout << endl;
        dp.swap(dp2);
        dp2.assign(n + 1, 0);
    }

    // trav(item, dp) cout << item << ' ';
    // cout << endl;
    cout << ans << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 700 KB Output is correct
3 Correct 1 ms 588 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 588 KB Output isn't correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 215 ms 1336 KB Output isn't correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 61 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 259 ms 1332 KB Output isn't correct
2 Halted 0 ms 0 KB -