Submission #876376
Source Code Expand
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,ii ) for( typeof(gg.begin()) ii=gg.begin();ii!=gg.end();ii++)
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define sz(a) int((a).size())
#define N 100010
#define MAX 30
#define mod 1000000007
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define all(a) a.begin(),a.end()
const ll INF = 1e18+1;
set <pii> s,colo;
map <pii, int> m;
ll ans[N];
int main()
{
int n,h,w,a,b,val;
ll sum=0;
scanf("%d%d%d",&h,&w,&n);
REP(i,n)
{
scanf("%d%d",&a,&b);
colo.insert(mp(a,b));
}
foreach(colo,ii)
{
a=ii->X;
b=ii->Y;
REPP(row,max(a-2,1),min(a+1,h-1))
REPP(col,max(b-2,1),min(b+1,w-1))
{
if (s.find(mp(row,col))!=s.end()) continue;
s.insert(mp(row,col));
val=0;
REPP(j,row,row+3)
REPP(k,col,col+3)
{
if (colo.find(mp(j,k))!=colo.end())
val++;
}
sum++;
m[mp(row,col)]=val;
}
}
foreach(m,ii)
ans[ii->Y]++;
ans[0]=1ll*(h-2)*(w-2)-sum;
REP(i,10) printf("%lld\n",ans[i]);
return 0;
}
Submission Info
Submission Time
2016-09-11 21:26:36+0900
Task
D - Snuke's Coloring
User
TerryMcGinnis
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
1304 Byte
Status
AC
Exec Time
1914 ms
Memory
103424 KiB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&h,&w,&n);
^
./Main.cpp:34:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&a,&b);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
AC
Set Name
Test Cases
Sample
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, empty.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
494 ms
15616 KiB
02.txt
AC
1289 ms
76544 KiB
03.txt
AC
137 ms
6784 KiB
04.txt
AC
4 ms
256 KiB
05.txt
AC
662 ms
37760 KiB
06.txt
AC
680 ms
37760 KiB
07.txt
AC
1901 ms
103296 KiB
08.txt
AC
1914 ms
103424 KiB
09.txt
AC
1908 ms
103424 KiB
10.txt
AC
4 ms
256 KiB
11.txt
AC
1263 ms
71936 KiB
12.txt
AC
1621 ms
103040 KiB
13.txt
AC
5 ms
256 KiB
14.txt
AC
1447 ms
86144 KiB
15.txt
AC
1271 ms
72064 KiB
empty.txt
AC
4 ms
256 KiB
sample_01.txt
AC
4 ms
256 KiB
sample_02.txt
AC
4 ms
256 KiB
sample_03.txt
AC
4 ms
256 KiB