# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172093 | 2200040225 | Palembang Bridges (APIO15_bridge) | C++20 | 3 ms | 320 KiB |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
long long computeMinDistance(int N, vector<pair<char, int>> home, vector<pair<char, int>> work) {
long long total_distance = 0;
for (int i = 0; i < N; i++) {
char home_zone = home[i].first;
int home_building = home[i].second;
char work_zone = work[i].first;
int work_building = work[i].second;
if (home_zone == work_zone) {
total_distance += abs(home_building - work_building);
} else {
total_distance += abs(home_building - work_building) + 1;
}
}
return total_distance;
}
int main() {
int K, N;
cin >> K >> 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... |