이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main()
{
size_t n, k;
cin >> k >> n;
vector<long> home, work;
vector<long> positions;
long cost = 0;
for (size_t i = 0; i < n; i++)
{
char p, q;
long s, t;
cin >> p >> s >> q >> t;
if (p != q)
{
home.push_back(s);
work.push_back(t);
positions.push_back(s);
positions.push_back(t);
}
else
{
cost += abs(s - t);
}
}
if (positions.empty())
{
cout << cost << '\n';
return 0;
}
sort(positions.begin(), positions.end());
long median = positions[positions.size() / 2];
for (size_t i = 0; i < home.size(); i++)
{
cost += abs(home[i] - median) + abs(work[i] - median) + 1;
}
cout << cost << '\n';
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |