# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25069 | kajebiii | Palembang Bridges (APIO15_bridge) | C++14 | 123 ms | 7596 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 REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
struct PT {
int x, y;
PT() {}
PT(int xx, int yy) : x(xx), y(yy) {}
bool operator<(const PT &o) const{return x+y < o.x+o.y;}
};
struct SOL {
priority_queue<int> m; //minus slope
priority_queue<int, vector<int>, greater<int> > p; //plus slope;
ll ans;
SOL() : ans(0) {}
void add(int l, int r) {
m.push(l); p.push(r);
// printf("%d %d add\n", l, r);
while(true) {
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... |