Submission #1262704

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262704		goulthen	Semiexpress (JOI17_semiexpress)	C++20	100 / 100	9 ms	3652 KiB

semiexpress

//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define int long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, b, a) for (int i = b; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define lsb(x) (x)&(-x)
#define bug(x) cerr << #x << " " << x << endl;
 
void setIO(string name = "") {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    if (!name.empty()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
ll fexp(ll a, ll b, ll m) {
    if (b == 0) return 1LL;
    ll p = a;
    ll ans = 1;
    while (b > 0) {
        if (b % 2 != 0) ans = (ans * p) % m;
        p = (p * p) % m;
        b >>= 1;
    }
    return ans;
}
 
const int MAXN = 3e3 + 10;
const int INF = 1e18 + 5;
const int MOD = 1e9 + 7;
int n,m,k, A,B,C, T;
int s[MAXN], nums[MAXN*MAXN], c = 0;

int get(int l, int r) {
    int res = 0;
    int t = B*l;
    int id = l;
    int cnt = 0;
    while (id < r) {
        int x = T-t;
        if (x < 0) break;
        x /= A;
        int nx = min(r, id + x + 1);
        if (id == l) res = nx - id;
        else nums[c++] = nx - id;
        t += C*(nx - id);
        id = nx;
        cnt++;
        if (cnt > k-m) break;
    }
    return res;
}

void solve() {
    cin >> n >> m >> k >> A >> B >> C >> T;
    rep(i,1,m) cin >> s[i],s[i]--;

    int ans = (B*s[m] <= T) ? 1 : 0;
    rep(i,2,m) ans += get(s[i-1], s[i]);

    sort(nums, nums + c, greater<int>());
    rep(i,1,k-m) ans += nums[i-1];
    cout << ans -1 << '\n';
}

int32_t main() {
    setIO();
    int tt = 1;
    //cin >> tt;
 
    while (tt-- > 0) solve();
    return 0;
}

Compilation message (stderr)

semiexpress.cpp: In function 'void setIO(std::string)':
semiexpress.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
semiexpress.cpp:30:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 18 / 18
• Subtask 2: 30 / 30
• Subtask 3: 52 / 52