oj.uz

답안 #919284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919284 2024-01-31T14:24:31 Z TIN Domino (COCI15_domino) C++17
50 / 160
 838 ms 330320 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++) {
				if (i == 1 && j == 1) continue;
				// (i - 1, j) -> (i, j)
				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];
				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)
				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];
				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 24 ms 26456 KB Output is correct
2 Correct 25 ms 26456 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 639 ms 314488 KB Output is correct
2 Incorrect 619 ms 326160 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 10.0

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

Subtask #14
0 / 10.0

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

Subtask #15
0 / 10.0

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

Subtask #16
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 824 ms 314732 KB Output is correct
2 Incorrect 838 ms 330320 KB Output isn't correct
3 Halted 0 ms 0 KB -