# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1051975 | alex_2008 | Semiexpress (JOI17_semiexpress) | C++14 | 0 ms | 440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 3e3 + 10;
ll s[N];
ll n, m, k;
ll a, b, c;
ll t;
ll prev(ll x) {
int i = upper_bound(s + 1, s + m + 1, x) - s;
return s[i - 1];
}
ll nx(ll x) {
int i = upper_bound(s + 1, s + m + 1, x) - s;
return s[i];
}
int main() {
cin >> n >> m >> k >> a >> b >> c >> t;
for (int i = 1; i <= m; i++) {
cin >> s[i];
}
ll ans = 0;
if ((n - 1) * b <= t) ans++;
priority_queue <pair<ll, ll>> Q;
for (int i = 1; i < m; i++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |