| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 339679 | blue | Palembang Bridges (APIO15_bridge) | C++11 | 115 ms | 4472 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 <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int K, N;
cin >> K >> N;
if(K == 1)
{
long long res = 0;
char c1, c2;
long long e1, e2;
vector<long long> A;
for(int i = 1; i <= N; i++)
{
cin >> c1 >> e1 >> c2 >> e2;
if(c1 == c2) res += abs(e1 - e2);
else
{
A.push_back(e1);
A.push_back(e2);
res += 1;
}
}
sort(A.begin(), A.end());
for(int i = 0; i < A.size(); i++) res += abs(A[i] - A[A.size()/2]);
cout << res << '\n';
return 0;
}
else
{
return 0;
}
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
