oj.uz

Submission #338498

# Submission time Handle Problem Language Result Execution time Memory
338498 2020-12-23T09:46:47 Z kiennguyen246 Bulldozer (JOI17_bulldozer) C++14
5 / 100
 272 ms 512 KB 
/**
 * \author : Nguyen Duc Kien
 * \date : 23/12/2020
 * \version : 6.3.1
 */

///Task name
#define TASK "BULLDOZER"

/**--------------------------------------------------**/

#include <bits/stdc++.h>

#define int int64_t

using namespace std;

const int maxn = 2005;
const int infi = 1e9 + 69;

int n;
struct point
{
    int x, y, w;

    void inp()
    {
        cin >> x >> y >> w;
    }
}a[maxn];
struct line
{
    long long a, b, c;

    void make_line(point A, point B)
    {
        int ux = B.x - A.x;
        int uy = B.y - A.y;
        a = -uy, b = ux;
        c = a * A.x + b * A.y;
        c = -c;
    }

    ///Raw distance (without abs)
    double pos(point A)
    {
        return double(a * A.x + b * A.y + c) / hypot(abs(a), abs(b));
    }
}d;

bool by_x(point u, point v)
{
    return (u.x < v.x);
}

bool by_pos(point u, point v)
{
    return (d.pos(u) < d.pos(v));
}

namespace Sub1
{
    long long sx[maxn], res;

    void Main()
    {
        sort(a + 1, a + n + 1, by_x);
        for (int i = 1; i <= n; i ++)
            sx[i] = sx[i - 1] + a[i].w;
        for (int i = 1; i <= n; i ++)
            for (int j = i; j <= n; j ++)
                res = max(res, sx[j] - sx[i - 1]);
        cout << res;
    }
}

namespace Sub2
{
    point b[maxn];
    int w[maxn], cnt;

    void Main()
    {
        b[0] = {-infi, infi, 0};
        long long res = 0;
        for (int i = 1; i <= n; i ++) res = max(res, 1ll * b[i].w);
        for (int i = 1; i <= n; i ++)
            for (int j = i + 1; j <= n; j ++)
            {
                d.make_line(a[i], a[j]);
                for (int t = 1; t <= n; t ++) b[t] = a[t];
                sort(b + 1, b + n + 1, by_pos);
                cnt = 0;
                for (int k = 1; k <= n; k ++)
                {
                    if (d.pos(b[k]) != 0 || d.pos(b[k - 1]) != 0) w[++cnt] = b[k].w;
                    else w[cnt] += b[k].w;
                }
                long long cur = 0;
                for (int k = 1; k <= n; k ++)
                {
                    cur += w[k];
                    res = max(res, cur);
                    if (cur < 0) cur = 0;
                }
            }
        cout << res;
    }
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cerr << "Processing...\n\n";
	if (fopen(TASK".INP", "r"))
	{
		freopen(TASK".INP", "r", stdin);
		freopen(TASK".OUT", "w", stdout);
	}

	cin >> n;
	for (int i = 1; i <= n; i ++) a[i].inp();
	bool all_ox = 1;
	for (int i = 1; i <= n; i ++)
        if (a[i].y != 0) all_ox = 0;
    if (all_ox) Sub1::Main();
    else Sub2::Main();
	cerr << "\n\n--------------\n";
	return 0;
}

Compilation message

bulldozer.cpp: In function 'int32_t main()':
bulldozer.cpp:118:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  118 |   freopen(TASK".INP", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bulldozer.cpp:119:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  119 |   freopen(TASK".OUT", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 492 KB Output is correct
2 Correct 249 ms 492 KB Output is correct
3 Correct 253 ms 512 KB Output is correct
4 Correct 253 ms 364 KB Output is correct
5 Correct 252 ms 364 KB Output is correct
6 Correct 253 ms 364 KB Output is correct
7 Correct 252 ms 492 KB Output is correct
8 Correct 253 ms 492 KB Output is correct
9 Correct 257 ms 416 KB Output is correct
10 Correct 272 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 492 KB Output is correct
2 Correct 249 ms 492 KB Output is correct
3 Correct 253 ms 512 KB Output is correct
4 Correct 253 ms 364 KB Output is correct
5 Correct 252 ms 364 KB Output is correct
6 Correct 253 ms 364 KB Output is correct
7 Correct 252 ms 492 KB Output is correct
8 Correct 253 ms 492 KB Output is correct
9 Correct 257 ms 416 KB Output is correct
10 Correct 272 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 492 KB Output is correct
2 Correct 249 ms 492 KB Output is correct
3 Correct 253 ms 512 KB Output is correct
4 Correct 253 ms 364 KB Output is correct
5 Correct 252 ms 364 KB Output is correct
6 Correct 253 ms 364 KB Output is correct
7 Correct 252 ms 492 KB Output is correct
8 Correct 253 ms 492 KB Output is correct
9 Correct 257 ms 416 KB Output is correct
10 Correct 272 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 250 ms 492 KB Output is correct
17 Correct 249 ms 492 KB Output is correct
18 Correct 253 ms 512 KB Output is correct
19 Correct 253 ms 364 KB Output is correct
20 Correct 252 ms 364 KB Output is correct
21 Correct 253 ms 364 KB Output is correct
22 Correct 252 ms 492 KB Output is correct
23 Correct 253 ms 492 KB Output is correct
24 Correct 257 ms 416 KB Output is correct
25 Correct 272 ms 364 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Incorrect 1 ms 364 KB Output isn't correct
29 Halted 0 ms 0 KB -