oj.uz

답안 #135979

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135979 2019-07-24T14:59:16 Z MetB Bulldozer (JOI17_bulldozer) C++14
0 / 100
 2000 ms 632 KB 
#include <algorithm>
#include <iostream>
#include <string.h>
#include <cstdlib>
#include <vector>
#include <string>
#include <bitset>
#include <math.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
 
typedef long long ll;
typedef long double ld;
 
const ll MOD = 1e9 + 7, INF = 1e18 + 1;
 
using namespace std;

ll p[1000000], to[10000], n;

struct SegTree
{
	ll t[800000][4], start;
 
	ll operator[] (const int& i)
	{
		return t[i][0];
	}
 
	void build (ll n)
	{
		start = 1;
 
		while (start < n) start <<= 1;
 
		for (ll i = 2 * start - 1; i; i--)
			merge (i);
	}
 
	void merge (ll node)
	{
		if (node >= start) 
		{
			t[node][3] = p[node - start];
			t[node][2] = max (0LL, p[node - start]);
			t[node][1] = max (0LL, p[node - start]);
			t[node][0] = max (0LL, p[node - start]);
		}
		else
		{
			t[node][3] = t[2 * node][3] + t[2 * node + 1][3];
			t[node][2] = max (t[2 * node][3] + t[2 * node + 1][2], t[2 * node][2]);
			t[node][1] = max (t[2 * node][1] + t[2 * node + 1][3], t[2 * node + 1][1]);
			t[node][0] = max (max (t[2 * node][0], t[2 * node + 1][0]), t[2 * node][1] + t[2 * node + 1][2]);
		}
	}
 
	void update (ll x, ll d)
	{
		p[x] = d;
		x += start;
 
		while (x)
		{
			merge (x);
			x /= 2;
		}
	}
} t;

struct point
{
	int x, y, c;

	bool operator < (const point& b) const
	{
		return y < b.y;
	}

} a[1000];

struct fraction
{
	int a, b;

	int p1, p2;

	bool operator < (const fraction& d) const
	{
		if (!d.b) return true;
		if (!b) return false;
		return (a * d.b) < (b * d.a);
	}
};

vector <fraction> d;

int main ()
{
	cin >> n;

	for (int i = 0; i < n; i++)
		scanf ("%d%d%d", &a[i].x, &a[i].y, &a[i].c);

	sort (a, a + n);

	for (int i = 0; i < n; i++)
		for (int j = i + 1; j < n; j++)
		{
			int A = a[i].y - a[j].y;
			int B = a[j].x - a[i].x;
			int C = a[i].y * B - a[j].y * A;

			d.push_back ({B, A, i, j});

			to[i] = i;
			to[j] = j;

			p[i] = a[i].c;
			p[j] = a[j].c;
		}

	sort (d.begin(), d.end());

	t.build (n);

	ll ans = 0;

	for (auto f : d)
	{
		if (f.b == 0) break;
		int l = p[to[f.p1]], r = p[to[f.p2]];

		t.update (to[f.p1], r);
		t.update (to[f.p2], l);

		swap (to[f.p1], to[f.p2]);

		ans = max (ans, t[1]);
	}

	cout << ans;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:114:8: warning: unused variable 'C' [-Wunused-variable]
    int C = a[i].y * B - a[j].y * A;
        ^
bulldozer.cpp:105:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d%d", &a[i].x, &a[i].y, &a[i].c);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2037 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2037 ms 504 KB Time limit exceeded
2 Halted 0 ms 0 KB -