# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64278 | kingpig9 | Palembang Bridges (APIO15_bridge) | C++11 | 602 ms | 57496 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))
bool cmp (pii p1, pii p2) {
return p1.fi + p1.se < p2.fi + p2.se;
}
int K, N;
vector<pll> A;
void go (vector<ll> &vres) {
set<pll> st = {pll(A[0].fi, 0), pll(A[0].se, 1)};
auto it = st.begin();
ll ans = A[0].se - A[0].fi;
vres.push_back(ans);
for (int i = 1; i < A.size(); i++) {
ll x = A[i].fi, y = A[i].se;
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... |