제출 #230460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230460		Vimmer	NLO (COCI18_nlo)	C++14	33 / 110	564 ms	65540 KiB

nlo

#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;

typedef short int si;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

queue <pair <int, int> > qr;

int step[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

int main()
{
   // freopen("input.txt", "r", stdin);// freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;

    cin >> n >> m >> k;

    int a[n][m];

    memset(a, 0, sizeof(a));

    for (int i = 0; i < k; i++)
    {
        int sx, sy, r;

        cin >> sx >> sy >> r;

        sx--; sy--;

        a[sx][sy] = i + 1;

        qr.push({sx, sy});

        while (sz(qr) > 0)
        {
            int x = qr.front().F;

            int y = qr.front().S;

            qr.pop();

            for (int j = 0; j < 4; j++)
            {
                int cx = x + step[j][0];

                int cy = y + step[j][1];

                if (0 <= cx && cx < n && 0 <= cy && cy < m && a[cx][cy] != i + 1 && abs(cx - sx) * abs(cx - sx) + abs(cy - sy) * abs(cy - sy) <= r * r)
                {
                    a[cx][cy] = i + 1;

                    qr.push({cx, cy});
                }
            }
        }
    }

    ll ans = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
          ans += k - a[i][j];

    cout << ans << endl;
}

• Subtask 1: 33 / 110