oj.uz

Submission #659202

# Submission time Handle Problem Language Result Execution time Memory
659202 2022-11-17T01:37:01 Z as111 Treasure (different grader from official contest) (CEOI13_treasure2) C++14
0 / 100
 3 ms 724 KB 
#include "treasure.h"
#include <iostream>

#define MAXN 100

using namespace std;
int ps[MAXN + 5][MAXN + 5]; // partial sum # treasure
int ans[MAXN + 5][MAXN + 5];
int findTreasure(int N) {
	ps[N][N] = countTreasure(1, 1, N, N);
	for (int r = N; r >= 2; r--) {
		for (int c = N; c >= 2; c--) {
			if (!ps[r][c - 1]) {
				ps[r][c - 1] = countTreasure(1, 1, r, c - 1);
			}
			if (!ps[r - 1][c - 1]) {
				ps[r - 1][c - 1] = countTreasure(1, 1, r - 1, c - 1);
			}
			if (!ps[r - 1][c]) {
				ps[r - 1][c] = countTreasure(1, 1, r - 1, c);
			}
			ans[r][c] = ps[r][c] - ps[r - 1][c] - ps[r][c - 1] + ps[r - 1][c - 1];
		}
	}
	for (int r = N; r >= 1; r--) {
		ans[r][1] = ps[r][2] - ps[r - 1][2] - ans[r][2];
	}
	for (int c = N; c >= 1; c--) {
		ans[1][c] = ps[2][c] - ps[2][c-1] - ans[2][c];
	}

	for (int r = 1; r <= N; r++) {
		for (int c = 1; c <= N; c++) {
			cout << ans[r][c];
		}
		cout << endl;
	}
}

Compilation message

treasure.cpp: In function 'int findTreasure(int)':
treasure.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
   38 | }
      | ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Runtime error 1 ms 468 KB Execution killed with signal 11
4 Runtime error 1 ms 420 KB Execution killed with signal 11
5 Runtime error 2 ms 596 KB Execution killed with signal 11
6 Runtime error 2 ms 596 KB Execution killed with signal 11
7 Runtime error 2 ms 724 KB Execution killed with signal 11
8 Runtime error 2 ms 724 KB Execution killed with signal 11
9 Runtime error 2 ms 724 KB Execution killed with signal 11
10 Runtime error 3 ms 724 KB Execution killed with signal 11