제출 #1295671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1295671		ulvix	Calvinball championship (CEOI15_teams)	C++20	70 / 100	72 ms	131072 KiB

teams

#include <bits/stdc++.h>
#ifdef ULVI
    #define db(x)          cerr<<"[ "<<#x<<" = "<<(x)<<" ]\n"
    #define dbv(v)         cerr<<#v<<" = [ ";for(auto &__x : v)cerr<<__x<<' ';cerr<<"]\n"
    #define line()         cerr<<string(80, '-')<<'\n'
#else
    #define db(x)
    #define dbv(v)
    #define line()
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef int ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll mod=1000007;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void solve(){
    ll n;
    cin>>n;
    vector<ll> v(n+1);
    for(ll i=1;i<=n;i++) cin>>v[i];
    vector<vector<ll>> dp(n+1,vector<ll>(n+1));
    for(ll i=1;i<=n;i++) dp[0][i]=1;
    for(ll i=1;i<=n;i++) for(ll j=n;j>=1;j--) dp[i][j]=(j*dp[i-1][j]+dp[i-1][j+1])%mod;
    ll ans=1,mx=1;
    for(ll i=2;i<=n;i++){
        ans=(ans+min(v[i]-1,mx)*dp[n-i][mx])%mod;
        mx=max(mx,v[i]);
    }
    cout<<ans<<'\n';
}

int main(){
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t=1;
    //cin>>t;
    for(ll _=1;_<=t;_++){
        //cout<<"Scenario #"<<_<<":\n";
        solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

teams.cpp:24:14: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   24 | const ll inf=1e18;
      |              ^~~~

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