제출 #1165539

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165539		HappyCapybara	웜뱃 (IOI13_wombats)	C++20	28 / 100	20081 ms	9656 KiB

wombats

#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;

int R, C;
vector<vector<int>> d, l, r;
vector<vector<int>> res;

int calc(int i, int j){
        vector<vector<bool>> seen(R, vector<bool>(C, false));
        priority_queue<pair<int,pair<int,int>>> pq;
        pq.push({0, {0, i}});
        while (!pq.empty()){
            int dist = -pq.top().first, x = pq.top().second.first, y = pq.top().second.second;
            pq.pop();
            if (seen[x][y]) continue;
            seen[x][y] = true;
            if (x == R-1 && y == j) return dist;
            if (x < R-1) pq.push({-(dist+d[x][y]), {x+1, y}});
            if (y > 0) pq.push({-(dist+l[x][y]), {x, y-1}});
            if (y < C-1) pq.push({-(dist+r[x][y]), {x, y+1}});
        }
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    ::R = R; ::C = C;
    d.resize(R, vector<int>(C));
    l.resize(R, vector<int>(C));
    r.resize(R, vector<int>(C));
    for (int i=0; i<R; i++){
        for (int j=0; j<C; j++){
            if (i < R-1) d[i][j] = V[i][j];
            if (j > 0) l[i][j] = H[i][j-1];
            if (j < C-1) r[i][j] = H[i][j];
        }
    }
    res.resize(C, vector<int>(C));
}

void changeH(int P, int Q, int W) {
    r[P][Q] = W;
    l[P][Q+1] = W;
}

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

int escape(int V1, int V2) {
    return calc(V1, V2);
}

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

wombats.cpp: In function 'int calc(int, int)':
wombats.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
   23 | }
      | ^

• Subtask 1: 0 / 9
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 24