oj.uz

Submission #28605

# Submission time Handle Problem Language Result Execution time Memory
28605 2017-07-16T07:56:03 Z 맞왜틀 맞왜틀 신나는노래~ 헤이! 나도한번 불러보자(#1216, skdudn321, choiking10) Oriental P.A.D.A.K (FXCUP2_padak) C++14
0 / 1
 509 ms 65536 KB 
#include<bits/stdc++.h>

using lint = long long int;
using pii = std::pair<int, int>;

using std::vector;
using std::queue;

int xx[4] = { 0, 0, 1, -1 };
int yy[4] = { 1, -1, 0, 0 };
vector<int> graph[1001000];
int cou[1001000];
int temp_cou[1001000];
queue<pii> qu;

int main(void) {
	int N, M, K, B, Z;
	scanf("%d %d %d %d %d", &N, &M, &K, &B, &Z);
	
	for (int i = 1; i <= N; i++) {
		graph[i].resize(M + 1, 1001000);
	}

	for (int i = 1; i <= K; i++) {
		int t1, t2;
		scanf("%d %d", &t1, &t2);
		graph[t1][t2] = 0;
		qu.push(pii(t1, t2));
	}

	int val = 1;
	while (!qu.empty()) {
		int cou = qu.size();
		for(int asdf = 1; asdf <= cou; asdf++){
			int x = qu.front().first;
			int y = qu.front().second;
			qu.pop();

			for (int i = 0; i < 4; i++) {
				if (0 < x + xx[i] && x + xx[i] <= N && 0 < y + yy[i] && y + yy[i] <= M) {
					if (graph[x + xx[i]][y + yy[i]] > val) {
						graph[x + xx[i]][y + yy[i]] = val;
						qu.push(pii(x + xx[i], y + yy[i]));
					}
				}
			}
		}
		val++;
	}

	int maxi = 0;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= M; j++) {
			maxi = std::max(maxi, graph[i][j]);
			cou[graph[i][j]]++;
		}
	}

	int ans1 = 0, ans2 = 0;
	for (int i = 1; i <= maxi; i++) {
		temp_cou[i] = cou[i];
	}
	int rest = 0;
	for (int i = 1; i <= maxi; i++) {
		if (Z <= temp_cou[i]) {
			ans1 += Z;
			if (temp_cou[i] - Z >= rest) {
				ans1 += rest;
				rest = 0;
			}
			else {
				ans1 += temp_cou[i] - Z;
				rest -= temp_cou[i] - Z;
			}
		}
		else {
			ans1 += temp_cou[i];
			rest += Z - temp_cou[i];
		}
	}
	int ind = maxi;
	for (int i = 1; i <= maxi; i++) {
		if (i > ind) {
			break;
		}
		int cur = 0;
		while (cur < Z) {
			if (temp_cou[ind] >= Z - cur) {
				temp_cou[ind] -= Z - cur;
				cur = Z;
			}
			else {
				cur += temp_cou[ind];
				ind--;
			}
			if (i > ind) {
				break;
			}
		}
		ans2 += cur;
		if (i > ind) {
			break;
		}
	}

	printf("%d %d", ans2, ans1);

	return 0;
}

Compilation message

padak.cpp: In function 'int main()':
padak.cpp:18:45: 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:26:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t1, &t2);
                           ^

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 33304 KB Output is correct
2 Correct 0 ms 33304 KB Output is correct
3 Correct 33 ms 37264 KB Output is correct
4 Correct 23 ms 37292 KB Output is correct
5 Correct 23 ms 37244 KB Output is correct
6 Correct 39 ms 39508 KB Output is correct
7 Correct 49 ms 37288 KB Output is correct
8 Correct 49 ms 37212 KB Output is correct
9 Correct 89 ms 64588 KB Output is correct
10 Correct 36 ms 37264 KB Output is correct
11 Correct 43 ms 37292 KB Output is correct
12 Correct 39 ms 37244 KB Output is correct
13 Correct 53 ms 39640 KB Output is correct
14 Correct 43 ms 37288 KB Output is correct
15 Correct 39 ms 37212 KB Output is correct
16 Correct 139 ms 64588 KB Output is correct
17 Correct 43 ms 37528 KB Output is correct
18 Correct 53 ms 37952 KB Output is correct
19 Correct 46 ms 37508 KB Output is correct
20 Correct 56 ms 39772 KB Output is correct
21 Correct 106 ms 38212 KB Output is correct
22 Correct 43 ms 37212 KB Output is correct
23 Correct 269 ms 64588 KB Output is correct
24 Correct 479 ms 45580 KB Output is correct
25 Correct 423 ms 45580 KB Output is correct
26 Correct 479 ms 45620 KB Output is correct
27 Correct 509 ms 47908 KB Output is correct
28 Correct 419 ms 45564 KB Output is correct
29 Correct 403 ms 45456 KB Output is correct
30 Memory limit exceeded 109 ms 65536 KB Memory limit exceeded
31 Halted 0 ms 0 KB -