제출 #28564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
28564		ㅁㄴㅇㄹ (#68)	Oriental P.A.D.A.K (FXCUP2_padak)	C++14	1 / 1	806 ms	52840 KiB

padak

#include <bits/stdc++.h>
#include <unistd.h>

#define pii pair<int,int>
#define pll pair<lld,lld>
#define pb push_back
#define lld long long
#define Inf 1000000000
#define get gett

using namespace std;

int N,M,K,B,Z;
int ans1,ans2;
int **a;
int *tmp;
int dx[] = {0,1,0,-1},dy[] = {1,0,-1,0};
int qx[1000002],qy[1000002],rear,top;

int main(){
	scanf("%d %d %d %d %d",&N,&M,&K,&B,&Z);
	a = (int**)malloc(sizeof(int*)*(N+2));
	for(int i=0; i<=N+1; i++){
		a[i] = (int*)malloc(sizeof(int)*(M+2));
	}
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) a[i][j] = Inf;
	for(int i=1; i<=K; i++){
		int x,y;
		scanf("%d %d",&x,&y);
		rear++;
		qx[rear] = x; qy[rear] = y;
		a[x][y] = 0;
	}
	while(top < rear){
		int x,y;
		top++;
		x = qx[top];
		y = qy[top];
		for(int i=0; i<4; i++){
			if(x+dx[i] < 1 || x+dx[i] > N || y+dy[i] < 1 || y+dy[i] > M) continue;
			if(a[x+dx[i]][y+dy[i]] <= a[x][y]+1) continue;
			a[x+dx[i]][y+dy[i]] = a[x][y]+1;
			rear++;
			qx[rear] = x+dx[i];
			qy[rear] = y+dy[i];
		}
	}
	tmp = (int*)malloc(sizeof(int)*(N*M+1));
	for(int i=1; i<=N; i++) for(int j=1; j<=M; j++) tmp[(i-1)*M+j] = a[i][j];
	sort(tmp+1,tmp+N*M+1);
	int it,cnt;
	cnt = 0; it = 1;
	while(it <= N*M){
		while(it <= N*M && tmp[it] <= cnt) it++;
		for(int i=1; i<=Z && it <= N*M; i++){
			it++;
			ans2++;
		}
		cnt++;
	}
	reverse(tmp+1,tmp+N*M+1);
	cnt = 0; it = 1;
	while(it <= N*M){
		for(int i=1; i<=Z && it <= N*M; i++){
			if(tmp[it] > cnt) ans1++;
			it++;
		}
		cnt++;
	}
	printf("%d %d\n",ans1,ans2);

	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

padak.cpp: In function 'int main()':
padak.cpp:21:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d %d",&N,&M,&K,&B,&Z);
                                        ^
padak.cpp:29:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
                       ^

• Subtask 1: 1 / 1