Submission #163230

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
163230	2019-11-11T23:15:39 Z	qkxwsm	NLO (COCI18_nlo)	C++14	55 / 110	307 ms	65540 KB

nlo

#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define MAXN 1013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int R, C, N;
pair<pll, ll> arr[MAXN];
vector<pair<int, short> > event[MAXN * MAXN];
set<int> ok;
ll ans;

int getsqrt(ll x)
{
	ll res = sqrt(x);
	while(res * res < x) res++;
	while(res * res > x) res--;
	return res;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(12);
	cerr << fixed << setprecision(4);
	cin >> R >> C >> N;
	FOR(i, 1, N + 1)
	{
		int a, b, r; cin >> a >> b >> r; a--; b--;
		FOR(j, a - r, a + r + 1)
		{
			int d = getsqrt(1ll * r * r - (a - j) * (a - j));
			event[j].PB({b - d, i});
			event[j].PB({b + d + 1, -i});
		}
	}
	FOR(i, 0, R)
	{
		sort(ALL(event[i]));
		FOR(j, 0, SZ(event[i]))
		{
			auto p = event[i][j];
			if (!ok.empty())
			{
				ans += (*ok.rbegin()) * (p.fi - event[i][j - 1].fi);
			}
			if (p.se < 0)
			{
				// cerr << "j = " << j << endl;
				// cerr << "ERASE " << -p.se << endl;
				ok.erase(-p.se);
			}
			else
			{
				// cerr << "INSERT " << p.se << endl;
				ok.insert(p.se);
			}
		}
	}
	//find sum(latest day)
	//the # of poitns that are inside here but inside NONE OF THE FUTURE ONES
	ans = 1ll * (R * C) * N - ans;
	cout << ans << '\n';
	return 0;
}

Subtask #1

55.0 / 110.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	24824 KB	Output is correct
2	Correct	39 ms	25592 KB	Output is correct
3	Correct	33 ms	25464 KB	Output is correct
4	Correct	87 ms	31096 KB	Output is correct
5	Correct	73 ms	30076 KB	Output is correct
6	Runtime error	184 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
7	Incorrect	169 ms	42684 KB	Output isn't correct
8	Runtime error	201 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
9	Incorrect	307 ms	56652 KB	Output isn't correct
10	Runtime error	255 ms	65540 KB	Execution killed with signal 9 (could be triggered by violating memory limits)