Submission #403412

#	Time	Username	Problem	Language	Result	Execution time	Memory
403412		shenxy	조개 줍기 (KOI17_shell)	C++11	46 / 100	628 ms	26464 KiB

shell

#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
typedef pair<int, int> ii;
int main() {
	int N;
	scanf("%d", &N);
	if (N <= 100) {
		int A[N][N], S[N][N];
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) scanf("%d", &A[i][j]);
		}
		int r, c, ans = 0;
		char op;
		S[0][0] = A[0][0];
		for (int i = 1; i < N; ++i) S[i][0] = S[i - 1][0] + A[i][0], S[0][i] = S[0][i - 1] + A[0][i];
		for (int i = 1; i < N; ++i) {
			for (int j = 1; j < N; ++j) S[i][j] = max(S[i - 1][j], S[i][j - 1]) + A[i][j];
		}
		for (int i = 0; i < N; ++i) {
			for (int j = 0; j < N; ++j) ans += S[i][j];
		}
		printf("%d\n", ans);
		for (int i = 0; i < N; ++i) {
			scanf(" %c %d %d", &op, &r, &c);
			if (op == 'U') ++A[r - 1][c - 1];
			else --A[r - 1][c - 1];
			S[0][0] = A[0][0];
			ans = 0;
			for (int i = 1; i < N; ++i) S[i][0] = S[i - 1][0] + A[i][0], S[0][i] = S[0][i - 1] + A[0][i];
			for (int i = 1; i < N; ++i) {
				for (int j = 1; j < N; ++j) S[i][j] = max(S[i - 1][j], S[i][j - 1]) + A[i][j];
			}
			for (int i = 0; i < N; ++i) {
				for (int j = 0; j < N; ++j) ans += S[i][j];
			}
			printf("%d\n", ans);
		}
	} else {
		int A[N + 1][N + 1], S[N + 1][N + 1];
		for (int i = 1; i <= N; ++i) {
			for (int j = 1; j <= N; ++j) scanf("%d", &A[i][j]);
		}
		int r[N], c[N], ans[N + 1];
		char op;
		for (int i = 0; i < N; ++i) scanf(" %c %d %d", &op, &r[i], &c[i]), --A[r[i]][c[i]];
		for (int i = 0; i <= N; ++i) S[0][i] = S[i][0] = 0;
		for (int i = 1; i <= N; ++i) {
			for (int j = 1; j <= N; ++j) S[i][j] = max(S[i - 1][j], S[i][j - 1]) + A[i][j];
		}
		ans[N] = 0;
		for (int i = 1; i <= N; ++i) {
			for (int j = 1; j <= N; ++j) ans[N] += S[i][j];
		}
		for (int i = N - 1; i >= 0; --i) {
			++A[r[i]][c[i]];
			queue<ii> pq;
			pq.push(ii(r[i], c[i]));
			ans[i] = ans[i + 1] + 1;
			++S[r[i]][c[i]];
			while (!pq.empty()) {
				int j = pq.front().first, k = pq.front().second;
				pq.pop();
				if (j != N && S[j + 1][k] != max(S[j][k], S[j + 1][k - 1]) + A[j + 1][k]) {
					S[j + 1][k] = max(S[j][k], S[j + 1][k - 1]) + A[j + 1][k];
					++ans[i];
					pq.push(ii(j + 1, k));
				}
				if (k != N && S[j][k + 1] != max(S[j - 1][k + 1], S[j][k]) + A[j][k + 1]) {
					S[j][k + 1] = max(S[j - 1][k + 1], S[j][k]) + A[j][k + 1];
					++ans[i];
					pq.push(ii(j, k + 1));
				}
			}
		}
		for (int i = 0; i <= N; ++i) printf("%d\n", ans[i]);
	}
	return 0;
}

Compilation message (stderr)

shell.cpp: In function 'int main()':
shell.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
shell.cpp:12:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |    for (int j = 0; j < N; ++j) scanf("%d", &A[i][j]);
      |                                ~~~~~^~~~~~~~~~~~~~~~
shell.cpp:26:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |    scanf(" %c %d %d", &op, &r, &c);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
shell.cpp:43:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |    for (int j = 1; j <= N; ++j) scanf("%d", &A[i][j]);
      |                                 ~~~~~^~~~~~~~~~~~~~~~
shell.cpp:47:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   for (int i = 0; i < N; ++i) scanf(" %c %d %d", &op, &r[i], &c[i]), --A[r[i]][c[i]];
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 34 / 34
• Subtask 3: 0 / 54