Submission #882361

#	Time	Username	Problem	Language	Result	Execution time	Memory
882361		noompty	Semiexpress (JOI17_semiexpress)	C++17	100 / 100	23 ms	18380 KiB

semiexpress

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <array>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
	#define D(...)
#endif

ll n, m, k, ex[3005], a, b, c, t, r;
priority_queue<int> pq;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m >> k >> a >> b >> c >> t;
    for (int i = 0; i < m; i++) {
        cin >> ex[i];
    }

    if ((n - 1) * b <= t) r++;

    for (int i = 0; i < m - 1; i++) {
        ll idx, q, rng;
        idx = (ex[i] - 1) * b;
        if (idx > t) break;
        q = (t - idx) / a;
        rng = min(ex[i + 1] - 1, ex[i] + q);
        r += rng - ex[i] + 1;
        if (!i) r--;
        for (int j = 0; j < k && rng < ex[i + 1] - 1; j++) {
            ll tmp, q1, rng1;
            tmp = idx + (rng + 1 - ex[i]) * c;
            if (tmp > t) break;
            q1 = (t - tmp) / a;
            rng1 = min(ex[i + 1] - 1, rng + q1 + 1);
            pq.push(rng1 - rng);
            rng = rng1;
        }
    }

    for (int i = m; i < k; i++) {
        if (pq.empty()) break;
        r += pq.top();
        pq.pop();
    }

    cout << r << "\n";

}

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