# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697318 | tengiz05 | Long Distance Coach (JOI17_coach) | C++17 | 1 ms | 320 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 i64 = long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
i64 _X, n, m, w, t;
std::cin >> _X >> n >> m >> w >> t;
std::vector<i64> a(n + 2);
std::map<i64, i64> end_map, cnt_end;
for (int i = 1; i <= n; i++) {
std::cin >> a[i];
}
a[n + 1] = _X;
std::sort(a.begin(), a.end());
for (int i = 1; i <= n + 1; i++) {
if (!end_map.count(a[i] % t)) {
end_map[a[i] % t] = a[i];
if (i != n + 1)
cnt_end[a[i] % t]++;
}
}
std::vector<std::pair<i64, i64>> p(m);
std::set<std::pair<i64, i64>> s;
for (int i = 0; i < m; i++) {
std::cin >> p[i].first >> p[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... |