oj.uz

답안 #819984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
819984 2023-08-10T16:58:04 Z TimDee 웜뱃 (IOI13_wombats) C++17
100 / 100
 9581 ms 185328 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(), x.end()
#define pi pair<int,int>
#define f first
#define s second

const int inf=1e9;

const int N=5120;
const int C=205;

int opt[C][C];

int n,c;

int getopt(int i, int j) {
    if (i<0 || j<0) return 0;
    if (i>=c || j>=c) return c-1;
    return opt[i][j];
}

struct sgt {

    struct node {
        int empty=1;
        vector<vector<int>> v; 
        node() {
            empty=1;
        }
    };
    vector<node> t; int sz=1;
    sgt(int n) {
        while (sz<n) sz<<=1;
        t.assign(2*sz,node());
    }
    void merge(int v, int a, int b) {
        if (t[b].empty) {
            t[v]=t[a];
            return;
        }
        if (t[a].empty) {
            t[v]=t[b];
            return;
        }
        t[v].empty=0;
        t[v].v.assign(c,vector<int>(c,inf));
        for (int k=-c+1; k<c; ++k) {
            for (int l=0; l<c; ++l) {
                int r = l-k;
                if (r<0 || r>=c) continue;
                for (int m=getopt(l-1,r); m<=getopt(l,r+1); ++m) {
                    if (t[a].v[l][m]+t[b].v[m][r] < t[v].v[l][r]) {
                        t[v].v[l][r] = t[a].v[l][m]+t[b].v[m][r];
                        opt[l][r] = m;
                    }
                }
            }
        }
    }

    void upd(int v, int l, int r, int i) {
        if (r-l==1) return;
        int m=(l+r)>>1;
        if (i<m) upd(2*v+1,l,m,i);
        else upd(2*v+2,m,r,i);
        merge(v,2*v+1,2*v+2);
    }
    void set(int i, vector<vector<int>>&v) {
        t[sz-1+i].v=v;
        t[sz-1+i].empty=0;
        upd(0,0,sz,i);
    }

};

const int K=10;
sgt st(N/K);

int d[K*C][C];

int h[N][C];
int v[N][C];
bitset<2*C> vis;

void work(int i) {
    vector<vector<int>> t(c,vector<int>(c,1e9));

    if (i>=n-1) return;

    forn(i,K*c) forn(j,c) d[i][j]=inf;
    for(int j=i; j<min(i+K,n-1); ++j) {
        forn(p,c) {
            d[p+(j-i)*c][p]=0;
            for (int q=0; q<c-1; ++q) {
                d[p+(j-i)*c][q+1]=min(d[p+(j-i)*c][q+1],d[p+(j-i)*c][q]+h[j][q]);
            }
            for (int q=c-1; q>0; --q) {
                d[p+(j-i)*c][q-1]=min(d[p+(j-i)*c][q-1],d[p+(j-i)*c][q]+h[j][q-1]);
            }
            forn(q,c) d[p+(j-i)*c][q]+=v[j][q];
            for (int q=0; q<c-1; ++q) {
                d[p+(j-i)*c][q+1]=min(d[p+(j-i)*c][q+1],d[p+(j-i)*c][q]+h[j+1][q]);
            }
            for (int q=c-1; q>0; --q) {
                d[p+(j-i)*c][q-1]=min(d[p+(j-i)*c][q-1],d[p+(j-i)*c][q]+h[j+1][q-1]);
            }
        }
    }
    auto f=t;
    auto s=f;
    forn(p,c) forn(q,c) s[p][q]=d[p][q];
    for(int j=i+1; j<min(i+K,n-1); ++j) {
        forn(p,c) {
            forn(q,c) {
                if (s[p][q]+d[q+(j-i)*c][p] < f[p][p]) {
                    f[p][p] = s[p][q]+d[q+(j-i)*c][p];
                    opt[p][p] = q;
                }
            }
        }
        for(int k=1; k<c; ++k) {
            for (int l=0; l+k<c; ++l) {
                int r=l+k;
        
                for (int m=opt[l][r-1]; m<=opt[l+1][r]; ++m) {
                    if (s[l][m]+d[m+(j-i)*c][r] < f[l][r]) {
                        f[l][r] = s[l][m]+d[m+(j-i)*c][r];
                        opt[l][r]=m;
                    }
                }
            }
        }
        for(int k=1; k<c; ++k) {
            for (int l=0; l+k<c; ++l) {
                int r=l+k;
        
                for (int m=opt[r-1][l]; m<=opt[r][l+1]; ++m) {
                    if (s[r][m]+d[m+(j-i)*c][l] < f[r][l]) {
                        f[r][l] = s[r][m]+d[m+(j-i)*c][l];
                        opt[r][l]=m;
                    }
                }
            }
        }
        s=f;
        f=t;
    }
    st.set(i/K,s);
}

void init(int _n, int _c, int _h[][200], int _v[][200]) {
    n=_n, c=_c;
    forn(i,n) forn(j,c-1) h[i][j]=_h[i][j];
    forn(i,n-1) forn(j,c) v[i][j]=_v[i][j];

    for (int i=0; i<n-1; i+=K) {
        work(i);
    }

}

void changeH(int i, int j, int w) {

    h[i][j]=w;
    work((i/K)*K);
    if ((i+1)/K*K != i/K*K) work((i+1)/K*K);
    if (i) if ((i-1)/K*K != i/K*K) work((i-1)/K*K);

}
void changeV(int i, int j, int w) {
        
    v[i][j]=w;
    work((i/K)*K);

}

int escape(int i, int j) {
    return st.t[0].v[i][j];
}

Compilation message

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.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8276 KB Output is correct
2 Correct 6 ms 8276 KB Output is correct
3 Correct 61 ms 10196 KB Output is correct
4 Correct 4 ms 8296 KB Output is correct
5 Correct 4 ms 8276 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 52 ms 1884 KB Output is correct
12 Correct 1 ms 596 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 2880 KB Output is correct
2 Correct 160 ms 2856 KB Output is correct
3 Correct 258 ms 3004 KB Output is correct
4 Correct 200 ms 2860 KB Output is correct
5 Correct 223 ms 2860 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 870 ms 3112 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16468 KB Output is correct
2 Correct 9 ms 16340 KB Output is correct
3 Correct 9 ms 16340 KB Output is correct
4 Correct 36 ms 17276 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 2900 KB Output is correct
2 Correct 155 ms 2772 KB Output is correct
3 Correct 252 ms 2880 KB Output is correct
4 Correct 200 ms 2884 KB Output is correct
5 Correct 233 ms 2868 KB Output is correct
6 Correct 9 ms 16424 KB Output is correct
7 Correct 9 ms 16336 KB Output is correct
8 Correct 11 ms 16468 KB Output is correct
9 Correct 36 ms 17296 KB Output is correct
10 Correct 4 ms 8276 KB Output is correct
11 Correct 4 ms 8276 KB Output is correct
12 Correct 56 ms 10108 KB Output is correct
13 Correct 4 ms 8276 KB Output is correct
14 Correct 5 ms 8296 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 67 ms 1868 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 862 ms 2884 KB Output is correct
28 Correct 2062 ms 60832 KB Output is correct
29 Correct 2240 ms 50996 KB Output is correct
30 Correct 2207 ms 50960 KB Output is correct
31 Correct 2093 ms 62384 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #6
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 2892 KB Output is correct
2 Correct 166 ms 2852 KB Output is correct
3 Correct 238 ms 2900 KB Output is correct
4 Correct 200 ms 2896 KB Output is correct
5 Correct 225 ms 2864 KB Output is correct
6 Correct 12 ms 16340 KB Output is correct
7 Correct 11 ms 16340 KB Output is correct
8 Correct 8 ms 16340 KB Output is correct
9 Correct 42 ms 17360 KB Output is correct
10 Correct 4 ms 8276 KB Output is correct
11 Correct 6 ms 8276 KB Output is correct
12 Correct 74 ms 10104 KB Output is correct
13 Correct 4 ms 8276 KB Output is correct
14 Correct 4 ms 8276 KB Output is correct
15 Correct 3795 ms 183172 KB Output is correct
16 Correct 9581 ms 185328 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 612 KB Output is correct
23 Correct 1 ms 608 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 53 ms 2368 KB Output is correct
28 Correct 1 ms 608 KB Output is correct
29 Correct 871 ms 2880 KB Output is correct
30 Correct 2037 ms 61440 KB Output is correct
31 Correct 7911 ms 184352 KB Output is correct
32 Correct 7833 ms 184348 KB Output is correct
33 Correct 2216 ms 50872 KB Output is correct
34 Correct 8801 ms 152324 KB Output is correct
35 Correct 2224 ms 50768 KB Output is correct
36 Correct 8333 ms 152260 KB Output is correct
37 Correct 2024 ms 62268 KB Output is correct
38 Correct 8381 ms 184916 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 8893 ms 151516 KB Output is correct