oj.uz

Submission #60062

# Submission time Handle Problem Language Result Execution time Memory
60062 2018-07-23T15:00:39 Z SpeedOfMagic Calvinball championship (CEOI15_teams) C++17
70 / 100
 1000 ms 66560 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
#define int long long
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
int getInt(){int a; get a; return a;}
//code goes here
const int mod = 1e6 + 7;

void run() {
    int n;
    get n;
    int ans = 1;
    int lim = 0;

    int dp[n][n];
    rep(i, 0, n)
        rep(j, 0, n)
            dp[i][j] = 0;
    rep(i, 0, n) {
        int a;
        get a;
        dp[i][lim] = a - 1;
        /**
        if (a == 1)
            continue;
        else {

            dp[i][lim] = a - 1;
            int dp[n - i][n];
            rep(j, 0, n - i)
                rep(k, 0, n)
                    dp[j][k] = 0;


            rep(j, 1, n - i)
                rep(k, 0, n) {
                    dp[j][k] = (dp[j][k] + (dp[j - 1][k] * (k + 1)) % mod) % mod;
                    if (k)
                        dp[j][k] = (dp[j][k] + dp[j - 1][k - 1]) % mod;
                }
            f(0) = 1
            1:  f(x) = 1
            2:  f(x) = 2 ^ x - 1
            3:  f(x) = 3 * f((x - 1) - 1) + (2 ^ (x - 1) - 1)

            dp[i][j] = i * dp[i][j - 1] + dp[i - 1][j - 1]

            rep(j, 0, n)
                ans = (ans + dp[n - i - 1][j]) % mod;

        }
        **/
        lim = max(lim, a - 1);
    }

    rep(j, 1, n)
        rep(k, 0, n) {
            dp[j][k] = (dp[j][k] + (dp[j - 1][k] * (k + 1)) % mod) % mod;
            if (k)
                dp[j][k] = (dp[j][k] + dp[j - 1][k - 1]) % mod;
        }

    rep(j, 0, n)
        ans = (ans + dp[n - 1][j]) % mod;

    put ans;
}

int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 588 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 592 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 604 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 608 KB Output is correct
2 Correct 4 ms 612 KB Output is correct
3 Correct 2 ms 732 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2668 KB Output is correct
2 Correct 8 ms 2832 KB Output is correct
3 Correct 8 ms 2832 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 764 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1047 ms 66560 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 686 ms 66560 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -