# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282630 | DystoriaX | Long Distance Coach (JOI17_coach) | C++14 | 2061 ms | 14292 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>
#define fi first
#define se second
using namespace std;
long long x, t;
int n, m, w;
long long s[200010];
pair<long long, int> v[200010];
long long pos[200010], spos[200010];
long long dp[200010], ans;
long long Get(long long x){
return x - (x % t);
}
int main(){
scanf("%lld%d%d%d%lld", &x, &n, &m, &w, &t);
for(int i = 1; i <= n; i++) scanf("%lld", &s[i]);
for(int i = 1; i <= m; i++) scanf("%lld%d", &v[i].fi, &v[i].se), pos[i] = v[i].fi;
sort(v + 1, v + 1 + m);
sort(pos + 1, pos + 1 + m);
memset(spos, -1, sizeof(spos));
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... |