# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338579 | theshadow_04 | Bulldozer (JOI17_bulldozer) | C++14 | 163 ms | 516 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.
// V T An
#include <bits/stdc++.h>
#define Task "BULLDOZER"
#define F first
#define S second
using namespace std;
const int maxn = 2005;
int n;
struct data {
long long x, y, w;
bool operator < (const data A) {
return x < A.x;
}
} point[maxn];
namespace Sub1 {
long long s[maxn], ans = 0;
void Solve() {
sort(point + 1, point + n + 1);
for(int i = 1; i <= n; ++ i) {
s[i] = s[i - 1] + point[i].w;
}
for(int i = 1; i <= n; ++ i) {
for(int j = i; j <= n; ++ j) {
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... |