Submission #92168

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
92168	2019-01-01T19:41:10 Z	Kastanda	NLO (COCI18_nlo)	C++11	110 / 110	651 ms	504 KB

nlo

#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

nlo.cpp: In function 'int main()':
nlo.cpp:24:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < A.size(); j++)
                         ~~^~~~~~~~~~
nlo.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
nlo.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &X[i], &Y[i], &R[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

110.0 / 110.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	12 ms	256 KB	Output is correct
3	Correct	8 ms	256 KB	Output is correct
4	Correct	45 ms	376 KB	Output is correct
5	Correct	32 ms	376 KB	Output is correct
6	Correct	257 ms	396 KB	Output is correct
7	Correct	94 ms	376 KB	Output is correct
8	Correct	478 ms	504 KB	Output is correct
9	Correct	169 ms	360 KB	Output is correct
10	Correct	651 ms	376 KB	Output is correct