Language: C++

/* goes here */
#include<bits/stdc++.h> //1
using namespace std; //2
typedef signed long long ll; //3
#define INF 0x3f3f3f3f //4
vector<pair<long long, long long>> rekkyo; //1
#define int ll //2
bool isvalid (ll i, ll j, ll h, ll w) { //3
    if(i<0 || h<=i || j<0 || w<=j){    //4
        return false; //1
    } return true; //2
} signed main(void){ //3
    int H,W,N;    //4
    cin >> H >> W >> N; //1
    int a[114514],b[114514]; //2
    for (ll i = 0; i < N; i++) { //3
        cin>>a[i]>>b[i];    //4
        for(int j = 0; j < 3; ++j){ //1
            for(int k=0;k<3;++k){ //2
                if (!j && !k) {a[i]--; b[i]--;} //3
                ;    //4
            } //1
        } //2
        for (ll j = -1; j <= +1; j++) { //3
            int c;    //4
            for(ll k = -1; k <= +1; ++k)if(isvalid(a[i] + j - 1, b[i] + k - 1, H, W) && isvalid(a[i] + j + 1, b[i] + k + 1, H, W))rekkyo.emplace_back(a[i] + j, b[i] + k); //1 †悪魔的行為†
        } //2
        if ("POKAIKO" == "RYONAIKO") std::sort( //3
        rekkyo.begin(),rekkyo.end());    //4
    } //1
    int Ans[10]={}; //2
    while (!rekkyo.empty()) { //3
    break;}    //4
    //pair<long long, long long> i, previous; //1
    for(int j=0;j<rekkyo.size();j++){ //2
        ll k; for (k = j; k < rekkyo.size() && rekkyo[k] == rekkyo[j]; k++); //3
    }    //4
    for(auto i : rekkyo){ //1
    } //2
    ll samebegin = 0, sameend; while (samebegin < rekkyo.size()) { //3
        ll samepunch;    //4
    break;}map<pair<long long, long long>, long long> taplis; //1
    for(auto i : rekkyo){ //2
    if (taplis.find(i) == taplis.end()) taplis.insert( //3
        i);    //4
        ++taplis[i]; //1
    } //2
    Ans[0] = H * W - taplis.size(); //3
    for(pair<pair<long long,long long>,long long> PP:taplis){    //4
        ++Ans[PP.second]; //1
        ; //2
    } Ans[0] = (H - 2) * (W - 2); for (ll viine = 1; viine <= 9; viine++) { //3
        Ans[0]-=Ans[i];    //4
    } for(auto i : Ans)cout << i << endl; //1
    int Gabriel,Satanichia,Raphiel; //2
    char* ukuku09 = "Ukunichia"; Satanichia = (int)ukuku09; //3
    return 0;    //4
} // 1 end

Compiler output:
a.cc: In function 'int main()':
a.cc:44:54: error: no matching function for call to 'std::map<std::pair<long long int, long long int>, long long int>::insert(std::pair<long long int, long long int>&)'
   44 |     if (taplis.find(i) == taplis.end()) taplis.insert( //3
      |                                         ~~~~~~~~~~~~~^~~~~
   45 |         i);    //4
      |         ~~                                            
In file included from /usr/include/c++/14/map:63,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:152,
                 from a.cc:2:
/usr/include/c++/14/bits/stl_map.h:847:9: note: candidate: 'template<class _Pair> std::__enable_if_t<((bool)std::is_constructible<std::pair<const _Key, _Val>, _Pair>::value), std::pair<typename std::_Rb_tree<_Key, std::pair<const _Key, _Val>, std::_Select1st<std::pair<const _Key, _Val> >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> >::other>::iterator, bool> > std::map<_Key, _Tp, _Compare, _Alloc>::insert(_Pair&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]'
  847 |         insert(_Pair&& __x)
      |         ^~~~~~
/usr/include/c++/14/bits/stl_map.h:847:9: note:   template argument deduction/substitution failed:
In file included from /usr/include/c++/14/bits/stl_pair.h:60,
                 from /usr/include/c++/14/bits/stl_algobase.h:64,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/type_traits: In substitution of 'template<bool _Cond, class _Tp> using std::__enable_if_t = typename std::enable_if::type [with bool _Cond = false; _Tp = std::pair<std::_Rb_tree_iterator<std::pair<const std::pair<long long int, long long int>, long long int> >, bool>]':
/usr/include/c++/14/bits/stl_map.h:847:2:   required by substitution of 'template<class _Pair> std::__enable_if_t<((bool)std::is_constructible<std::pair<const std::pair<long long int, long long int>, long long int>, _Pair>::value), std::pair<std::_Rb_tree_iterator<std::pair<const std::pair<long long int, long long int>, long long int> >, bool> > std::map<std::pair<long long int, long long int>, long long int>::insert(_Pair&&) [with _Pair = std::pair<long long int, long long int>&]'
a.cc:44:54:   required from here
   44 |     if (taplis.find(i) == taplis.end()) taplis.insert( //3
      |                                         ~~~~~~~~~~~~~^~~~~
   45 |         i);    //4
      |         ~~                                            
/usr/include/c++/14/type_traits:138:11: error: no type named 'type' in 'struct std::enable_if<false, std::pair<std::_Rb_tree_iterator<std::pair<const std::pair<long long int, long long int>, long long int> >, bool> >'
  138 |     using __enable_if_t = typename enable_if<_Cond, _Tp>::type;
      |           ^~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_map.h:924:9: note: candidate: 'template<class _Pair> std::__enable_if_t<((bool)std::is_constructible<std::pair<const _Key, _Val>, _Pair>::value), typename std::_Rb_tree<_Key, std::pair<const _Key, _Val>, std::_Select1st<std::pair<const _Key, _Val> >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> >::other>::iterator> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, _Pair&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]'
  924 |         insert(const_iterator __position, _Pair&& __x)
      |         ^~~~~~
/usr/include/c++/14/bits/stl_map.h:924:9: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/stl_map.h:942:9: note: candidate: 'template<class _InputIterator> void std::map<_Key, _Tp, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >]'
  942 |         insert(_InputIterator __first, _InputIterator __last)
      |         ^~~~~~
/usr/include/c++/14/bits/stl_map.h:942:9: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/stl_map.h:661:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::insert_return_type std::map<_Key, _Tp, _Compare, _Alloc>::insert(node_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >; insert_return_type = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::insert_return_type; node_type = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::node_type]'
  661 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_map.h:661:26: note:   no known conversion for argument 1 from 'std::pair<long long int, long long int>' to 'std::map<std::pair<long long int, long long int>, long long int>::node_type&&' {aka 'std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::node_type&&'}
  661 |       insert(node_type&& __nh)
      |              ~~~~~~~~~~~~^~~~
/usr/include/c++/14/bits/stl_map.h:666:7: note: candidate: 'std::map<_Key, _Tp, _Compare, _Alloc>::iterator std::map<_Key, _Tp, _Compare, _Alloc>::insert(const_iterator, node_type&&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >; iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::iterator; const_iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::const_iterator; node_type = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::node_type]'
  666 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/14/bits/stl_map.h:666:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/stl_map.h:834:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, std::pair<const _Key, _Val>, std::_Select1st<std::pair<const _Key, _Val> >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> >::other>::iterator, bool> std::map<_Key, _Tp, _Compare, _Alloc>::insert(const value_type&) [with _Key = std::pair<long long int, long long int>; _Tp = long long int; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >; typename std::_Rb_tree<_Key, std::pair<const _Key, _Val>, std::_Select1st<std::pair<const _Key, _Val> >, _Compare, typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> >::other>::iterator = std::_Rb_tree<std::pair<long long int, long long int>, std::pair<const std::pair<long long int, long long int>, long long int>, std::_Select1st<std::pair<const std::pair<long long int, long long int>, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> > >::iterator; typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> >::other = std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >; typename __gnu_cxx::__alloc_traits<_Allocator>::rebind<std::pair<const _Key, _Val> > = __gnu_cxx::__alloc_traits<std::allocator<std::pair<const std::pair<long long int, long long int>, long long int> >, std::pair<const std::pair<long long int, long long int>, long long int> >::rebind<std::pair<const std::pair<long long int, long long int>, long long int> >; typename _Allocator::value_type = std::pair<const std::pair<long long int, long long int>, long long int>; value_type = std::pair<const std::pair<long long int, long long int>, long long int>]'
  834 |       insert(const value_type& __x)
      |