oj.uz

Submission #530725

# Submission time Handle Problem Language Result Execution time Memory
530725 2022-02-26T15:09:33 Z browntoad Semiexpress (JOI17_semiexpress) C++14
18 / 100
 53 ms 320 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=2005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
signed main(){
    IOS();
    int n,m,o; cin>>n>>m>>o;
    int a,b,c; cin>>a>>b>>c;
    int t; cin>>t;
    vector<int> occ(n+1);
    REP(i,m){
        int x; cin>>x;
        occ[x]=1;
    }
    int ans=0;
    vector<int> dp(n+1);
    REP1(i,n){
        FOR(j, i+1, n+1){
            REP1(k,n) dp[k]=0;
            int lc=1, lb=1;
            int cnt=0;
            REP1(k,n){
                if (k==1) continue;
                dp[k]=dp[k-1]+a;
                if (occ[k]){
                    dp[k]=min(dp[k], dp[lb]+b*(k-lb));
                    lb=k;
                }
                if (k==i||k==j||occ[k]){
                    dp[k]=min(dp[k], dp[lc]+c*(k-lc));
                    lc=k;
                }
                if (dp[k]<=t){
                    cnt++;
                }
            }
            ans=max(ans, cnt);

        }
    }
    cout<<ans<<endl;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 316 KB Output is correct
2 Correct 44 ms 320 KB Output is correct
3 Correct 53 ms 292 KB Output is correct
4 Correct 44 ms 292 KB Output is correct
5 Correct 45 ms 296 KB Output is correct
6 Correct 48 ms 316 KB Output is correct
7 Correct 45 ms 312 KB Output is correct
8 Correct 44 ms 292 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 316 KB Output is correct
2 Correct 44 ms 320 KB Output is correct
3 Correct 53 ms 292 KB Output is correct
4 Correct 44 ms 292 KB Output is correct
5 Correct 45 ms 296 KB Output is correct
6 Correct 48 ms 316 KB Output is correct
7 Correct 45 ms 312 KB Output is correct
8 Correct 44 ms 292 KB Output is correct
9 Correct 43 ms 316 KB Output is correct
10 Correct 45 ms 312 KB Output is correct
11 Incorrect 44 ms 292 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 316 KB Output is correct
2 Correct 44 ms 320 KB Output is correct
3 Correct 53 ms 292 KB Output is correct
4 Correct 44 ms 292 KB Output is correct
5 Correct 45 ms 296 KB Output is correct
6 Correct 48 ms 316 KB Output is correct
7 Correct 45 ms 312 KB Output is correct
8 Correct 44 ms 292 KB Output is correct
9 Correct 43 ms 316 KB Output is correct
10 Correct 45 ms 312 KB Output is correct
11 Incorrect 44 ms 292 KB Output isn't correct
12 Halted 0 ms 0 KB -