# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156374 | georgerapeanu | Bulldozer (JOI17_bulldozer) | C++11 | 1249 ms | 32120 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 <cstdio>
#include <algorithm>
using namespace std;
struct point_t{
int x,y,c;
bool operator < (const point_t &other)const{
if(x != other.x){
return x < other.x;
}
return y < other.y;
}
};
struct line_t{
int a,b;
int i,j;
};
struct node_t{
long long pref_sum;
long long suff_sum;
long long best_sum;
long long total_sum;
node_t(long long a = 0LL){
pref_sum = max(a,0LL);
suff_sum = max(a,0LL);
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... |