# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15671 | cki86201 | Palembang Bridges (APIO15_bridge) | C++98 | 393 ms | 12892 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.
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
int k, n, np;
ll ans;
struct Pair{
Pair(){}
Pair(int x, int y) :x(x), y(y){}
int x, y;
bool operator<(const Pair &l)const{
return x + y < l.x + l.y;
}
}p[100010];
ll dp[2][100010];
multiset <int> S;
multiset <int>::iterator it, jt;
void Do(int t){
S.clear();
S.insert(p[0].x), S.insert(p[0].y);
it = S.begin();
dp[t][0] = abs(p[0].x - p[0].y);
for (int i = 1; i < np; i++){
int cnt = (*it <= p[i].x) + (*it <= p[i].y);
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... |