oj.uz

Submission #533926

# Submission time Handle Problem Language Result Execution time Memory
533926 2022-03-07T15:58:36 Z AA_Surely Calvinball championship (CEOI15_teams) C++17
100 / 100
 221 ms 500 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 1e4 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e6 + 7;
const int LOG = 22;

using namespace std;

int ns[MAXN], mx[MAXN];
int dp[2][MAXN], n;

int main(){
    IOS;

    cin >> n;
    FOR(i, 1, n + 1) {
        cin >> ns[i];
        mx[i] = max(mx[i - 1], ns[i]);
    }

    int ans = 1;
    bool f = (n & 1);

    f = 1 - f;

    F0R(j, n + 1) 
        dp[f][j] = 1;
    
    ROF(i, 1, n + 1) {
        int d = (i & 1);
        int g = 1ll * (ns[i] - 1) * dp[1 - d][ mx[i - 1] ] % MOD;
        ans = (ans + g) % MOD;

        F0R(j, i + 1)
            dp[d][j] = (dp[1 - d][j + 1] + 1ll * dp[1 - d][j] * j % MOD) % MOD;
    }

    cout << ans % MOD;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 3 ms 272 KB Output is correct
3 Correct 2 ms 332 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 496 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 400 KB Output is correct
2 Correct 48 ms 404 KB Output is correct
3 Correct 55 ms 332 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 476 KB Output is correct
2 Correct 186 ms 476 KB Output is correct
3 Correct 221 ms 500 KB Output is correct