oj.uz

Submission #120984

# Submission time Handle Problem Language Result Execution time Memory
120984 2019-06-25T21:08:49 Z luciocf Krave (COI14_krave) C++14
0 / 100
 905 ms 66368 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;
const int inf = 1e9+10;

typedef pair<int, int> pii;
typedef long long ll;

set<int> tree[2][4*maxn];

int n, A, B;

void upd(int node, int l, int r, int a, int b, int v, bool q)
{
	if (l > r) return;
	if (l > b || r < a) return;

	if (l >= a && r <= b)
	{
		tree[q][node].insert(v);
		return;
	}

	int mid = (l+r)>>1;

	upd(2*node, l, mid, a, b, v, q); upd(2*node+1, mid+1, r, a, b, v, q);
}

// rightmost
int query1(int node, int l, int r, int pos, int x, bool q)
{
	if (l > r) return 0;
	int ans = 0;

	set<int>::iterator it = tree[q][node].upper_bound(x);
	if (tree[q][node].size() > 0 && it != tree[q][node].begin())
	{
		--it;
		ans = *it;
	}

	if (l == r) return ans;

	int mid = (l+r)>>1;

	if (pos <= mid) return max(ans, query1(2*node, l, mid, pos, x, q));
	return max(ans, query1(2*node+1, mid+1, r, pos, x, q));
}

// leftmost
int query2(int node, int l, int r, int pos, int x, bool q)
{
	if (l > r) return inf;
	int ans = inf;

	set<int>::iterator it = tree[q][node].lower_bound(x);
	if (tree[q][node].size() > 0 && it != tree[q][node].end())
		ans = *it;

	if (l == r) return ans;

	int mid = (l+r)>>1;

	if (pos <= mid) return min(ans, query2(2*node, l, mid, pos, x, q));
	return min(ans, query2(2*node+1, mid+1, r, pos, x, q));
}

int main(void)
{
	scanf("%d %d %d", &A, &B, &n);

	for (int i = 1; i <= n; i++)
	{
		int x, y, d;
		scanf("%d %d %d", &x, &y, &d);

		if (d == 1)
		{
			int l = query1(1, 1, B, y, x-1, 0);
			int r = min(A, query2(1, 1, B, y, x+1, 0));

			int h1 = min(B, query2(1, 1, A, l, y+1, 1));
			int h2 = query1(1, 1, A, l, y-1, 1);

			ll area1 = 1ll*(r-l)*(h1-y), area2 = 1ll*(r-l)*(y-h2);
			printf("%lld %lld\n", min(area1, area2), max(area1, area2));

			upd(1, 1, A, max(l, 1), r, y, 1);
		}
		else
		{
			int l = query1(1, 1, A, x, y-1, 1);
			int r = min(B, query2(1, 1, A, x, y+1, 1));

			int h1 = min(A, query2(1, 1, B, l, x+1, 0));
			int h2 = query1(1, 1, B, l, x-1, 0);

			ll area1 = 1ll*(r-l)*(h1-x), area2 = 1ll*(r-l)*(x-h2);
			printf("%lld %lld\n", min(area1, area2), max(area1, area2));

			upd(1, 1, B, max(l, 1), r, x, 0);
		}
	}
}

Compilation message

krave.cpp: In function 'int main()':
krave.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &A, &B, &n);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
krave.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &x, &y, &d);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 38016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 38392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 154 ms 42912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 152 ms 42916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 42800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 373 ms 51592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 901 ms 65912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 832 ms 65360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 905 ms 66140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 893 ms 66368 KB Output isn't correct
2 Halted 0 ms 0 KB -