# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21833 | gs12117 | Palembang Bridges (APIO15_bridge) | C++11 | 1096 ms | 11748 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<stdio.h>
#include<algorithm>
#include<queue>
int p, tn;
long long int ansd;
struct psn {
int a, b;
bool operator<(const psn&r)const {
return a + b < r.a + r.b;
}
};
psn pl[100100];
int n;
long long int dp[3][100100];
int cmin[3][100100];
int sl[100100];
long long int ans;
struct pqn {
int x;
int idx;
bool operator<(const pqn&r)const {
return x < r.x;
}
};
int dist(int x, int y) {
if (x < y)return y - x;
return x - y;
}
int main() {
scanf("%d%d", &p, &tn);
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... |