oj.uz

Submission #424503

# Submission time Handle Problem Language Result Execution time Memory
424503 2021-06-12T03:55:25 Z cpp219 Calvinball championship (CEOI15_teams) C++14
30 / 100
 21 ms 16660 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e3 + 9;
const ll mod = 1e6 + 7;
typedef pair<ll,ll> LL;

ll n,x,dp[N][N],ans = 1;

ll f(ll pos,ll lim){
    if (pos == n + 1) return 1;
    if (pos == n) return lim;
    if (dp[pos][lim] != -1) return dp[pos][lim];
    ll ans = 0;
    ans = ((lim - 1)*f(pos + 1,lim)) % mod + f(pos + 1,lim + 1);
    ans %= mod;
    return dp[pos][lim] = ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "test"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n; memset(dp,-1,sizeof(dp));
    ll mx = 0; //cout<<f(3,2); return 0;
    for (ll i = 1;i <= n;i++){
        cin>>x; mx = max(mx,x);
        ans += (x - 1)*f(i + 1,mx); ans %= mod;
        //cout<<(x - 1)*f(i + 1,mx)<<"x\n";
    }
    cout<<ans;
}

Compilation message

teams.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
teams.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
teams.cpp: In function 'int main()':
teams.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 8268 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 8268 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 8268 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 8324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 16588 KB Execution killed with signal 11

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 21 ms 16592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 20 ms 16660 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -