oj.uz

Submission #28558

# Submission time Handle Problem Language Result Execution time Memory
28558 2017-07-16T07:21:28 Z ㅁㄴㅇㄹ(#1150, TAMREF, Diuven, suhgyuho_william) Oriental P.A.D.A.K (FXCUP2_padak) C++14
0 / 1
 96 ms 65536 KB 
#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;
bool **check;
queue<pii> q;
int *tmp;
int dx[] = {0,1,0,-1},dy[] = {1,0,-1,0};

int main(){
	scanf("%d %d %d %d %d",&N,&M,&K,&B,&Z);
	a = (int**)malloc(sizeof(int*)*(N+2));
	check = (bool**)malloc(sizeof(bool*)*(N+2));
	for(int i=0; i<=N+1; i++){
		a[i] = (int*)malloc(sizeof(int)*(M+2));
		check[i] = (bool*)malloc(sizeof(bool)*(M+2));
	}
	for(int i=1; i<=K; i++){
		int x,y;
		scanf("%d %d",&x,&y);
		check[x][y] = true;
		q.push({x,y});
	}
	while(!q.empty()){
		int x,y;
		x = q.front().first;
		y = q.front().second;
		q.pop();
		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(check[x+dx[i]][y+dy[i]]) continue;
			check[x+dx[i]][y+dy[i]] = true;
			a[x+dx[i]][y+dy[i]] = a[x][y]+1;
			q.push({x+dx[i],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;
}

Compilation message

padak.cpp: In function 'int main()':
padak.cpp:22: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:31: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
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2024 KB Output is correct
2 Correct 0 ms 2024 KB Output is correct
3 Correct 89 ms 10948 KB Output is correct
4 Correct 83 ms 10860 KB Output is correct
5 Correct 96 ms 10860 KB Output is correct
6 Correct 89 ms 16872 KB Output is correct
7 Correct 76 ms 11132 KB Output is correct
8 Correct 66 ms 20596 KB Output is correct
9 Memory limit exceeded 83 ms 65536 KB Memory limit exceeded
10 Halted 0 ms 0 KB -