# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561981 | maximath_1 | Palembang Bridges (APIO15_bridge) | C++11 | 95 ms | 6936 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 ll long long
int k, n;
vector<pair<int, int> > p;
ll ans = 0ll;
ll solvek1(){
if(p.empty()) return 0ll;
ll res = 0ll;
vector<int> cr;
for(int i = 0; i < p.size(); i ++){
cr.push_back(p[i].first);
cr.push_back(p[i].second);
res -= (ll)(p[i].first + p[i].second);
}
sort(cr.begin(), cr.end());
for(int i = 2 * (int)p.size() - 1; i >= (int)p.size(); i --)
res += 2ll * cr[i];
return res + (int)p.size();
}
bool cmp(pair<int, int> a, pair<int, int> b){
return a.first + a.second < b.first + b.second;
}
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... |