Submission #424511

#	Time	Username	Problem	Language	Result	Execution time	Memory
424511		cpp219	Calvinball championship (CEOI15_teams)	C++14	0 / 100	45 ms	65540 KiB

teams

#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 = 1e4 + 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;
        ans += (x - 1)*f(i + 1,mx + 1); ans %= mod;
        //cout<<(x - 1)*f(i + 1,mx + 1)<<"x\n";
        mx = max(mx,x);
    }
    cout<<ans;
}

Compilation message (stderr)

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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
teams.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10