## Submission #163226

# Submission time Handle Problem Language Result Execution time Memory
163226 2019-11-11T23:08:33 Z qkxwsm NLO (COCI18_nlo) C++14
55 / 110
234 ms 65540 KB
```#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];
vpl event[MAXN * MAXN / 5];
set<ll> ok;
ll ans;

ll 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)
{
ll a, b, r; cin >> a >> b >> r; a--; b--;
FOR(j, a - r, a + r + 1)
{
ll d = r * r - (a - j) * (a - j);
d = getsqrt(d);
event[j].PB({b - d, i});
event[j].PB({b + d + 1, -i});
// cerr << "EVENT " << j << " BIRTH " << b - d << " DEATH " << b + d + 1 << " VAL " << i << endl;
}
}
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 10 ms 5884 KB Output is correct
2 Correct 21 ms 7416 KB Output is correct
3 Correct 15 ms 7032 KB Output is correct
4 Correct 83 ms 18552 KB Output is correct
5 Correct 59 ms 16248 KB Output is correct
6 Runtime error 222 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Incorrect 196 ms 40792 KB Output isn't correct
8 Runtime error 234 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 213 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 227 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)