# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715706 | valerikk | Long Distance Coach (JOI17_coach) | C++17 | 2069 ms | 8740 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
const ll INF = 2e18;
int n, m;
ll X, T, W;
ll s[N];
ll d[N], c[N];
ll cost[N];
ll mn[N];
ll dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X >> n >> m >> W >> T;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
sort(s, s + n);
s[n++] = X;
{
vector<pair<ll, ll>> kek(m);
for (int i = 0; i < m; ++i) {
cin >> kek[i].first >> kek[i].second;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |