제출 #784039

#제출 시각아이디문제언어결과실행 시간메모리
784039qwerasdfzxcl웜뱃 (IOI13_wombats)C++17
39 / 100
20096 ms13092 KiB
#include "wombats.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr int INF = 2e9 + 100;

int (*H)[200], (*V)[200], n, m;
int sum[5000][200];

inline int dist(int x, int i, int j){
    if (i<=j) return sum[x][j] - sum[x][i];
    return sum[x][i] - sum[x][j];
}

struct Node{
    int a[202][202], nxt[202][202];

    Node(){}

    void init(){
        for (int i=0;i<m;i++){
            for (int j=0;j<m;j++){
                a[i][j] = dist(0, i, j);
            }
        }
    }

    void push(int x){
        for (int i=0;i<m;i++){
            for (int j=0;j<m;j++){
                nxt[i][j] = INF;
                for (int k=0;k<m;k++){
                    nxt[i][j] = min(nxt[i][j], a[i][k] + V[x-1][k] + dist(x, k, j));
                }
            }
        }

        for (int i=0;i<m;i++){
            for (int j=0;j<m;j++) a[i][j] = nxt[i][j];
        }
    }
}ans;

void initH(int x){
    for (int i=1;i<m;i++) sum[x][i] = sum[x][i-1] + H[x][i-1];
}

void solve(){
    ans.init();
    for (int i=1;i<n;i++) ans.push(i);
}

void init(int R, int C, int h[5000][200], int v[5000][200]) {
    n = R, m = C;
    H = h, V = v;
    for (int i=0;i<R;i++) initH(i);

    solve();
}

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

    solve();
}

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

    solve();
}

int escape(int V1, int V2) {
    return ans.a[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;
      |      ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...