# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92168 | Kastanda | NLO (COCI18_nlo) | C++11 | 651 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m, k, X[N], Y[N], R[N];
long long tot;
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= k; i++)
scanf("%d%d%d", &X[i], &Y[i], &R[i]);
tot = 1LL * n * m * k;
for (int i = 1; i <= n; i++)
{
set < int > S;
vector < pair < int , int > > A;
for (int j = 1; j <= k; j++)
if (abs(i - X[j]) <= R[j])
{
int delta = (int)floor(sqrt(1.0 * R[j] * R[j] - 1.0 * (i - X[j]) * (i - X[j])));
A.push_back({Y[j] - delta, j});
A.push_back({Y[j] + delta + 1, -j});
}
sort(A.begin(), A.end());
for (int j = 0; j < A.size(); j++)
{
if (S.size())
tot -= 1LL * (A[j].first - A[j -1].first) * (*S.rbegin());
if (A[j].second > 0)
S.insert(A[j].second);
else
S.erase(-A[j].second);
}
}
return !printf("%lld\n", tot);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |