제출 #289081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289081		egekabas	웜뱃 (IOI13_wombats)	C++14	55 / 100	20065 ms	16760 KiB

wombats

#include "wombats.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int r, c;
int h[5000][200];
int v[5000][200];
int dis[200][200];
void dijkstra(int beg, int end, int imp, int dis[200]){
    for(int j = 0; j < c; ++j)
        dis[j] = 1e9+7;
    dis[imp] = 0;
    for(int i = end; i >= beg; --i){
        for(int j = 1; j < c; ++j)
            dis[j] = min(dis[j], dis[j-1]+h[i][j-1]);
        for(int j = c-2; j >= 0; --j)
            dis[j] = min(dis[j], dis[j+1]+h[i][j]);
        for(int j = 0; j < c && i != beg; ++j)
            dis[j] = min((int)1e9+7, dis[j] + v[i-1][j]);
    }
}
    
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r = R;
    c = C;
    for(int i = 0; i < r; ++i)
        for(int j = 0; j < c; ++j){
            h[i][j] = H[i][j];
            v[i][j] = V[i][j];
        }
    for(int j = 0; j < c; ++j)
        dijkstra(0, r-1, j, dis[j]);
}
int change = 0;
void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    change = 1;
}
    
void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    change = 1;
}

int escape(int V1, int V2) {
    if(change){
        for(int j = 0; j < c; ++j)
            dijkstra(0, r-1, j, dis[j]);
        change = 0;
    }
    return dis[V2][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: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 24