Submission #59184498

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <map>
#define int long long
using namespace std;
const int N=2e5+10;
int n,m;
int ans;
int a[N],b[N];
map<pair<int,int>,bool>mp;
int dx[8]={2,1,-1,-2,-2,-1,1,2},dy[8]={1,2,2,1,-1,-2,-2,-1};
signed main()
{
    cin>>n>>m;
    ans=m;
    for(int i=1;i<=m;i++)   cin>>a[i]>>b[i],mp[{a[i],b[i]}]=true;;
    for(int j=1;j<=m;j++)
    {
        for(int i=0;i<8;i++)
        {
            int x=a[j]+dx[i],y=b[j]+dy[i];
            if(x<=0||x>n||y<=0||y>n)    continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <map>
#define int long long
using namespace std;
const int N=2e5+10;
int n,m;
int ans;
int a[N],b[N];
map<pair<int,int>,bool>mp;
int dx[8]={2,1,-1,-2,-2,-1,1,2},dy[8]={1,2,2,1,-1,-2,-2,-1};
signed main()
{
    cin>>n>>m;
    ans=m;
    for(int i=1;i<=m;i++)   cin>>a[i]>>b[i],mp[{a[i],b[i]}]=true;;
    for(int j=1;j<=m;j++)
    {
        for(int i=0;i<8;i++)
        {
            int x=a[j]+dx[i],y=b[j]+dy[i];
            if(x<=0||x>n||y<=0||y>n)    continue;
            else
            {
                if(mp[{x,y}]==false)    ans++,mp[{x,y}]=true;
            }
        }
    }
    cout<<n*n-ans<<endl;
    return 0;
}

Submission Info

Judge Result