# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211250 | Alexa2001 | Long Distance Coach (JOI17_coach) | C++17 | 197 ms | 18476 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 ll inf = 1e19;
const int Nmax = 2e5 + 5;
const ll eps = 1e-6;
int n, m, T, W, nr;
ll S[Nmax], P[Nmax];
int st[Nmax];
ll sumC[Nmax], need[Nmax], C[Nmax], dp[Nmax], sep[Nmax], coef[Nmax];
ll X;
void read()
{
cin >> X >> n >> m >> W >> T;
int i;
for(i=1; i<=n; ++i) cin >> S[i];
vector<pair<ll,int>> a(m+1);
for(i=1; i<=m; ++i) cin >> a[i].first >> a[i].second;
sort(a.begin() + 1, a.end());
for(i=1; i<=m; ++i)
Compilation message (stderr)
# | 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... |