oj.uz

Submission #593941

# Submission time Handle Problem Language Result Execution time Memory
593941 2022-07-11T17:47:47 Z jeroenodb Wombats (IOI13_wombats) C++14
76 / 100
 20000 ms 37700 KB 
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
#include "wombats.h"
void cmin(int& a, int b) {a=min(a,b);}
const int N = 200, K = 81, oo = 1e9;
static int HH[5000][N], VV[5000][N],R,C;

typedef array<array<int,N>,N> node;
const node identity() {
    node res = {};
    for(int i=0;i<N;++i) {
        for(int j=0;j<N;++j) res[i][j]=oo;
        res[i][i]=0;
    }
    return res;
}
node res;
void merge(const node& n1, const node& n2, int l, int r, int a, int b, int c, int d) {
    if(c==d or l==r) return;
    if(b-a<4 or r-l<6 or d-c<6) {
        for(int i=l;i<r;++i) {
            for(int j=a;j<b;++j) {
                for(int k=c;k<d;++k) {
                    cmin(res[i][k],n1[i][j]+n2[j][k]);
                }
            }
        }
        return;
    }
    int m1 = (l+r)/2, m2 = (c+d)/2;
    pi opt = {n1[m1][a]+n2[a][m2],a};
    for(int j = a+1;j<b;++j) {
        opt = min(opt, {n1[m1][j]+n2[j][m2],j});
    }
    int pos = opt.second;
    merge(n1,n2,l,m1,a,pos+1,c,m2);
    merge(n1,n2,m1,r,pos,b,m2,d);
    merge(n1,n2,l,m1,a,b,m2,d);
    merge(n1,n2,m1,r,a,b,c,m2);
}

struct segtree {
    vector<node> nds;
    int ptwo;
    segtree(){}
    segtree(int n) {
        ptwo=1;
        while(ptwo<n) ptwo*=2;
        nds.assign(ptwo*2,identity());
    }
    node& operator[](int i) {
        return nds[i+ptwo];
    }
    void update(int b) {
        for(b = (b+ptwo)/2;b>=1;b/=2) {
            for(int i=0;i<N;++i) fill(all(res[i]),oo);
            merge(nds[b*2],nds[b*2+1],0,C,0,C,0,C);
            nds[b]=res;
        }
    }
    int query(int A, int B) {
        return nds[1][A][B];
    }
} seg;

void recalculate(int b) { // recalculates a block
    int l = b*K, r = min(R,(b+1)*K);
    int ans[N] = {};
    for(int s=0;s<C;++s) {
        
        fill(ans,ans+N,oo);
        ans[s] = 0;
        for(int i=l;i<r;++i) {
            for(int j=0;j<C-1;++j) {
                cmin(ans[j+1],ans[j]+HH[i][j]);
            }
            for(int j=C-1;j>=1;--j) {
                cmin(ans[j-1],ans[j]+HH[i][j-1]);
            }
            if(i!=R-1) for(int j=0;j<C;++j) ans[j]+=VV[i][j];
        }
        copy(ans,ans+N,seg[b][s].begin());
    }
    seg.update(b);
}


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) {
        copy(H[i],H[i]+C,HH[i]);
        copy(V[i],V[i]+C,VV[i]);
    }
    int SEGSIZE = (R+K-1)/K;
    seg = segtree(SEGSIZE);
    for(int i=0;i*K<R;++i) recalculate(i);
}




void changeH(int P, int Q, int W) {
    HH[P][Q]=W;
    int B = P/K;
    recalculate(B);
}

void changeV(int P, int Q, int W) {
    VV[P][Q]=W;
    int B = P/K;
    recalculate(B);
}

int escape(int V1, int V2) {
    return seg.query(V1,V2);
}

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

# Verdict Execution time Memory Grader output
1 Correct 64 ms 32400 KB Output is correct
2 Correct 64 ms 32396 KB Output is correct
3 Correct 122 ms 33940 KB Output is correct
4 Correct 67 ms 32340 KB Output is correct
5 Correct 59 ms 32356 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 772 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 68 ms 1812 KB Output is correct
12 Correct 1 ms 852 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 1572 KB Output is correct
2 Correct 1207 ms 1564 KB Output is correct
3 Correct 1068 ms 1564 KB Output is correct
4 Correct 1087 ms 1568 KB Output is correct
5 Correct 1177 ms 1568 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 6008 ms 1572 KB Output is correct
10 Correct 1 ms 724 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 36312 KB Output is correct
2 Correct 63 ms 36320 KB Output is correct
3 Correct 68 ms 36308 KB Output is correct
4 Correct 115 ms 37052 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 766 ms 1568 KB Output is correct
2 Correct 1162 ms 1572 KB Output is correct
3 Correct 1031 ms 1492 KB Output is correct
4 Correct 1047 ms 1492 KB Output is correct
5 Correct 1131 ms 1492 KB Output is correct
6 Correct 67 ms 36308 KB Output is correct
7 Correct 62 ms 36308 KB Output is correct
8 Correct 69 ms 36308 KB Output is correct
9 Correct 94 ms 37092 KB Output is correct
10 Correct 66 ms 32340 KB Output is correct
11 Correct 65 ms 32288 KB Output is correct
12 Correct 122 ms 33908 KB Output is correct
13 Correct 67 ms 32412 KB Output is correct
14 Correct 58 ms 32340 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 1 ms 852 KB Output is correct
24 Correct 1 ms 852 KB Output is correct
25 Correct 65 ms 1736 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 5627 ms 1576 KB Output is correct
28 Correct 14126 ms 36768 KB Output is correct
29 Correct 14441 ms 33972 KB Output is correct
30 Correct 14508 ms 33828 KB Output is correct
31 Correct 14991 ms 37700 KB Output is correct
32 Correct 1 ms 724 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 777 ms 1568 KB Output is correct
2 Correct 1202 ms 1492 KB Output is correct
3 Correct 1071 ms 1492 KB Output is correct
4 Correct 1093 ms 1492 KB Output is correct
5 Correct 1174 ms 1568 KB Output is correct
6 Correct 65 ms 36308 KB Output is correct
7 Correct 72 ms 36308 KB Output is correct
8 Correct 69 ms 36308 KB Output is correct
9 Correct 107 ms 37004 KB Output is correct
10 Correct 70 ms 32376 KB Output is correct
11 Correct 62 ms 32340 KB Output is correct
12 Correct 142 ms 33932 KB Output is correct
13 Correct 69 ms 32352 KB Output is correct
14 Correct 60 ms 32416 KB Output is correct
15 Correct 9126 ms 36380 KB Output is correct
16 Execution timed out 20078 ms 36776 KB Time limit exceeded
17 Halted 0 ms 0 KB -