oj.uz

답안 #1067991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067991 2024-08-21T06:28:10 Z sleepntsheep 웜뱃 (IOI13_wombats) C++17
76 / 100
 7944 ms 22564 KB 
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cassert>
using namespace std;

#include "wombats.h"
#pragma GCC optimize("O3,unroll-loops")

#ifndef ROW
#define ROW 5000
#endif

#define COL 200
constexpr int B = 300;

int r, c, h[ROW][COL], v[ROW + 1][100];

int L[9999], R[9999], By[9999], a[COL][100][100], ans[100][100];

void calc(int blk) {
	for (int ii = 0; ii < c; ++ii) {
		static int dp[2][COL];
		/* find answer for (V1, V2) where V1 = ii */
		memset(dp[0], 63, sizeof dp[0]);
		dp[0][ii] = 0;
		int I = 0;

		for (int i = L[blk]; i <= R[blk]; ++i, I ^= 1) {
			static int pre[COL], suf[100], ph[100]; /* annoying ahh math */ 
			ph[0] = 0;
			for (int j = 0; j + 1 < c; ++j)
				ph[j + 1] = ph[j] + h[i][j];

			pre[0] = dp[I][0];
			for (int j = 1; j < c; ++j) pre[j] = min(pre[j - 1], dp[I][j] - ph[j]);
			suf[c - 1] = dp[I][c - 1] + ph[c - 1];
			for (int j = c - 2; j >= 0; --j) suf[j] = min(suf[j + 1], dp[I][j] + ph[j]);

			for (int j = 0; j < c; ++j)
				dp[I][j] = min(ph[j] + pre[j], suf[j] - ph[j]);
			for (int j = 0; j < c; ++j)
				dp[!I][j] = dp[I][j] + v[i][j];
		}
		for (int jj = 0; jj < c; ++jj)
			a[blk][ii][jj] = dp[I][jj];
	}
}

void merg(int up[COL][100], int down[100][100], int out[100][100]) {
	static int buf[COL][100];
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) {
		buf[i][j] = 1e9;
		for (int k = 0; k < c; ++k)
			buf[i][j] = min({buf[i][j], up[i][k]+ down[k][j]});
	}
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) out[i][j] = buf[i][j];
}

void CalcAns() {
	for (int i = 0; i < c; ++i) for (int j = 0; j < c; ++j) ans[i][j] = a[0][i][j];
	for (int i = 1; i * B < r; ++i)
		merg(ans, a[i], ans);
}

void changeH(int P, int Q, int W) {
	h[P][Q] = W;
	calc(By[P]);
	CalcAns();
}

void changeV(int P, int Q, int W) {
	v[P][Q] = W;
	calc(By[P]);
	CalcAns();
}

void init(int R, int C, int H[ROW][200], int V[ROW][200]) {
	r = R, c = C;
	for (int i = 0; i + 1 < r; ++i) for (int j = 0; j < c; ++j) v[i][j] = V[i][j];
	for (int i = 0 ; i < r; ++i) for (int j = 0; j + 1 < c; ++j) h[i][j] = H[i][j];

	for (int i = 0; i * B < r; ++i) {
		L[i] = i * B;
		::R[i] = min(r - 1, i * B + B - 1);
		calc(i);
		for (int j = L[i]; j <= ::R[i]; ++j) By[j] = i;
	}

	CalcAns();
}

int escape(int V1, int V2) { return ans[V1][V2]; }

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6236 KB Output is correct
2 Correct 3 ms 6236 KB Output is correct
3 Correct 38 ms 8776 KB Output is correct
4 Correct 3 ms 6236 KB Output is correct
5 Correct 3 ms 6236 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 36 ms 2644 KB Output is correct
12 Correct 0 ms 604 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 848 KB Output is correct
2 Correct 190 ms 856 KB Output is correct
3 Correct 193 ms 860 KB Output is correct
4 Correct 192 ms 860 KB Output is correct
5 Correct 199 ms 888 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 997 ms 888 KB Output is correct
10 Correct 0 ms 432 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14168 KB Output is correct
2 Correct 10 ms 14296 KB Output is correct
3 Correct 9 ms 14128 KB Output is correct
4 Correct 28 ms 15360 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 856 KB Output is correct
2 Correct 190 ms 856 KB Output is correct
3 Correct 195 ms 900 KB Output is correct
4 Correct 198 ms 900 KB Output is correct
5 Correct 196 ms 888 KB Output is correct
6 Correct 9 ms 14172 KB Output is correct
7 Correct 9 ms 14300 KB Output is correct
8 Correct 9 ms 14076 KB Output is correct
9 Correct 28 ms 15344 KB Output is correct
10 Correct 3 ms 6232 KB Output is correct
11 Correct 4 ms 6236 KB Output is correct
12 Correct 44 ms 8768 KB Output is correct
13 Correct 3 ms 6232 KB Output is correct
14 Correct 4 ms 6236 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 432 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 50 ms 2344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 965 ms 884 KB Output is correct
28 Correct 7617 ms 17224 KB Output is correct
29 Correct 6922 ms 14624 KB Output is correct
30 Correct 6872 ms 15624 KB Output is correct
31 Correct 7944 ms 19956 KB Output is correct
32 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 884 KB Output is correct
2 Correct 190 ms 860 KB Output is correct
3 Correct 192 ms 860 KB Output is correct
4 Correct 207 ms 1108 KB Output is correct
5 Correct 207 ms 860 KB Output is correct
6 Correct 10 ms 14168 KB Output is correct
7 Correct 9 ms 14172 KB Output is correct
8 Correct 9 ms 14172 KB Output is correct
9 Correct 51 ms 15588 KB Output is correct
10 Correct 5 ms 6232 KB Output is correct
11 Correct 3 ms 6236 KB Output is correct
12 Correct 76 ms 9000 KB Output is correct
13 Correct 4 ms 6236 KB Output is correct
14 Correct 4 ms 6332 KB Output is correct
15 Incorrect 994 ms 22564 KB Output isn't correct
16 Halted 0 ms 0 KB -