제출 #1068054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1068054		sleepntsheep	웜뱃 (IOI13_wombats)	C++17	76 / 100	11444 ms	30540 KiB

wombats

    #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
     
    constexpr int B = 1000;
     
    int r, c, h[ROW][100], v[ROW + 1][100];
     
    int L[9999], R[9999], By[9999];
     
    int a[100][100][100];
     
    int ans[100][100];
     
    void calc(int blk) {
    	for (int ii = 0; ii < c; ++ii) {
    		static int dp[2][100];
    		/* 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[100], 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[100][100], int down[100][100], int out[100][100]) {
    	static int buf[100][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 changeH(int P, int Q, int W) {
    	h[P][Q] = W;
    	calc(By[P]);
    	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 changeV(int P, int Q, int W) {
    	v[P][Q] = W;
    	calc(By[P]);
    	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 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;
    	}
     
    	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);
    }
     
    int escape(int V1, int V2) { return ans[V1][V2]; }
     

컴파일 시 표준 에러 (stderr) 메시지

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 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 21 / 21
• Subtask 6: 0 / 24