oj.uz

답안 #862560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862560 2023-10-18T13:36:56 Z green_gold_dog Semiexpress (JOI17_semiexpress) C++17
0 / 100
 0 ms 348 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, m, k;
        cin >> n >> m >> k;
        ll a, b, c;
        cin >> a >> b >> c;
        ll t;
        cin >> t;
        vector<ll> arr(m), can(m);
        for (ll i = 0; i < m; i++) {
                cin >> arr[i];
                arr[i]--;
                if (arr[i] * b <= t) {
                        can[i] = (t - arr[i] * b + a) / a;
                } else {
                        can[i] = 0;
                }
        }
        k -= m;
        priority_queue<pair<ll, ll>> pq;
        m--;
        ll ans = 0;
        for (ll i = 0; i < m; i++) {
                assign_min(can[i], arr[i + 1] - arr[i]);
                ans += can[i];
                ll x = (t - arr[i] * b - can[i] * c + a) / a;
                assign_min(x, arr[i + 1] - arr[i] - can[i]);
                pq.emplace(x, i);
        }
        while (k) {
                auto[x, i] = pq.top();
                pq.pop();
                can[i] += x;
                ans += x;
                k--;
                x = (t - arr[i] * b - can[i] * c + a) / a;
                assign_min(x, arr[i + 1] - arr[i] - can[i]);
                pq.emplace(x, i);
        }
        cout << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:93:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
semiexpress.cpp:94:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -