# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797523 | acatmeowmeow | Palembang Bridges (APIO15_bridge) | C++11 | 292 ms | 14584 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 namespace std;
#define int long long
const int N = 1e5;
int k, n, s[N + 5], t[N + 5];
char p[N + 5], q[N + 5];
namespace sub2 {
int main(int n, int k, int s[], int t[], char p[], char q[]) {
vector<int> arr;
int init = 0;
for (int i = 1; i <= n; i++) {
if (p[i] == q[i]) init += abs(s[i] - t[i]);
else arr.push_back(s[i]), arr.push_back(t[i]), init++;
}
sort(arr.begin(), arr.end());
int ans = 0, mid = arr.size()/2;
for (auto&v : arr) ans += abs(v - arr[mid]);
return init + ans;
}
}
namespace sub5 {
void balance(multiset<int>&f, multiset<int>&se, int&fSum, int&seSum) {
if (f.size() < se.size()) f.insert(*se.begin()), fSum += *se.begin(), seSum -= *se.begin(), se.erase(se.find(*se.begin()));
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... |