제출 #586682

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586682		AlperenT	Wombats (IOI13_wombats)	C++17	39 / 100	20067 ms	262144 KiB

wombats

#include <bits/stdc++.h>
#include "wombats.h"

using namespace std;

const int N = 5000 + 1, M = 100, INF = 1e9 + 5;

int n, m, h[N][M], v[N][M], dist[M][N][M];

bool vis[M];

void calc_dist(){
	for(int lst = 0; lst < m; lst++){
		for(int c = 0; c < m; c++) dist[lst][n][c] = INF;
		dist[lst][n][lst] = 0;

		for(int r = n - 1; r >= 0; r--){
			priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

			for(int c = 0; c < m; c++){
				dist[lst][r][c] = dist[lst][r + 1][c] + v[r][c];

				pq.push({dist[lst][r][c], c});
			}

			memset(vis, 0, sizeof(vis));

			while(!pq.empty()){
				int c = pq.top().second;
				pq.pop();

				if(!vis[c]){
					vis[c] = true;

					if(c != 0){
						if(dist[lst][r][c] + h[r][c - 1] < dist[lst][r][c - 1]){
							dist[lst][r][c - 1] = dist[lst][r][c] + h[r][c - 1];
							pq.push({dist[lst][r][c - 1], c - 1});
						}
					}

					if(c != m - 1){
						if(dist[lst][r][c] + h[r][c] < dist[lst][r][c + 1]){
							dist[lst][r][c + 1] = dist[lst][r][c] + h[r][c];
							pq.push({dist[lst][r][c + 1], c + 1});
						}
					}
				}
			}
		}
	}
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    n = R, m = C;

    for(int i = 0; i < n; i++){
    	for(int j = 0; j < m - 1; j++){
    		h[i][j] = H[i][j];
    	}
    }

    for(int i = 0; i < n - 1; i++){
    	for(int j = 0; j < m; j++){
    		v[i][j] = V[i][j];
    	}
    }

    calc_dist();
}

void changeH(int P, int Q, int W) {
    h[P][Q] = W;

    calc_dist();
}

void changeV(int P, int Q, int W) {
    v[P][Q] = W;

    calc_dist();
}

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

컴파일 시 표준 에러 (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: 0 / 16
• Subtask 4: 18 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 24