oj.uz

답안 #1029570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029570 2024-07-21T04:15:48 Z TIN Domino (COCI15_domino) C++17
50 / 160
 694 ms 330068 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define FNAME "test"
 
#define int long long
 
const int N = 2005;
 
int n, k;
int grid[N][N];
int sum = 0;
vector<vector<vector<int>>> dp, mx, pmx, t;
 
void Task() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cout << fixed << setprecision(9);
	if (fopen(FNAME".inp","r")) {
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}
 
void Solve() {
	//Your Code
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> grid[i][j];
			sum += grid[i][j];
		}
	}
	dp.resize(2, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));
	mx.resize(2, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));
	pmx.resize(2, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));
	t.resize(2, vector<vector<int>>(n + 1, vector<int>(n + 1, 0)));
	for (int dom = 1; dom <= k; dom++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				// (i - 1, j) -> (i, j)
				if (i > 1) {
					dp[0][i][j] = max(pmx[0][n][j - 1], pmx[1][n][j - 1]);
					if (i - 2 >= 0) dp[0][i][j] = max(pmx[0][i - 2][n], pmx[1][i - 2][n]);
					dp[0][i][j] += grid[i - 1][j] + grid[i][j];
				} else dp[0][i][j] = 0;
				mx[0][i][j] = max(dp[0][i][j], max(mx[0][i - 1][j], mx[0][i][j - 1]));
				// (i, j - 1) -> (i, j)
				if (j > 1) {
					dp[1][i][j] = max(pmx[0][i - 1][n], pmx[1][i - 1][n]);
					if (j - 2 >= 0) dp[1][i][j] = max(pmx[0][n][j - 2], pmx[1][n][j - 2]);
					dp[1][i][j] += grid[i][j - 1] + grid[i][j];
				} else dp[1][i][j] = 0;
				mx[1][i][j] = max(dp[1][i][j], max(mx[1][i - 1][j], mx[1][i][j - 1]));
			}
		}
		pmx = mx;
		mx = t;
	}
	int res = sum - max(pmx[0][n][n], pmx[1][n][n]);
	cout << res << '\n';
}
 
signed main() {
	Task();
	Solve();
	cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
	return 37^37;
}

Compilation message

domino.cpp: In function 'void Task()':
domino.cpp:21:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   freopen(FNAME".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
domino.cpp:22:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   freopen(FNAME".out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 27356 KB Output is correct
2 Correct 21 ms 27468 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 329696 KB Output is correct
2 Correct 465 ms 330068 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 191572 KB Output is correct
2 Correct 235 ms 189524 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 134 ms 88916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 535 ms 329556 KB Output is correct
2 Incorrect 510 ms 326096 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 599 ms 329716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 3164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 622 ms 329660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 160 ms 89992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 694 ms 329696 KB Output is correct
2 Incorrect 657 ms 330064 KB Output isn't correct
3 Halted 0 ms 0 KB -