oj.uz

답안 #593937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593937 2022-07-11T17:44:42 Z jeroenodb 웜뱃 (IOI13_wombats) C++14
76 / 100
 20000 ms 57880 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 = 75, 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<5 or r-l==1 or d-c==1) {
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 52456 KB Output is correct
2 Correct 78 ms 52476 KB Output is correct
3 Correct 159 ms 54300 KB Output is correct
4 Correct 114 ms 52428 KB Output is correct
5 Correct 92 ms 52440 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 704 KB Output is correct
8 Correct 1 ms 724 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 2 ms 832 KB Output is correct
5 Correct 1 ms 832 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 852 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 1952 KB Output is correct
12 Correct 1 ms 852 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 648 ms 1652 KB Output is correct
2 Correct 1193 ms 1636 KB Output is correct
3 Correct 1043 ms 1644 KB Output is correct
4 Correct 1061 ms 1584 KB Output is correct
5 Correct 1150 ms 1620 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 5632 ms 1648 KB Output is correct
10 Correct 1 ms 704 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 56340 KB Output is correct
2 Correct 105 ms 56312 KB Output is correct
3 Correct 105 ms 56268 KB Output is correct
4 Correct 117 ms 57116 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 657 ms 1648 KB Output is correct
2 Correct 1224 ms 1620 KB Output is correct
3 Correct 1075 ms 1612 KB Output is correct
4 Correct 1026 ms 1620 KB Output is correct
5 Correct 1204 ms 1652 KB Output is correct
6 Correct 94 ms 56296 KB Output is correct
7 Correct 83 ms 56396 KB Output is correct
8 Correct 99 ms 56416 KB Output is correct
9 Correct 121 ms 57332 KB Output is correct
10 Correct 80 ms 52384 KB Output is correct
11 Correct 91 ms 52372 KB Output is correct
12 Correct 149 ms 54176 KB Output is correct
13 Correct 87 ms 52428 KB Output is correct
14 Correct 92 ms 52424 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 2 ms 836 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 2 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 92 ms 2036 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 5670 ms 1644 KB Output is correct
28 Correct 16273 ms 56956 KB Output is correct
29 Correct 13801 ms 34120 KB Output is correct
30 Correct 13328 ms 34016 KB Output is correct
31 Correct 15068 ms 57880 KB Output is correct
32 Correct 1 ms 724 KB Output is correct

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 596 ms 1764 KB Output is correct
2 Correct 1144 ms 1640 KB Output is correct
3 Correct 1012 ms 1748 KB Output is correct
4 Correct 977 ms 1620 KB Output is correct
5 Correct 1113 ms 1652 KB Output is correct
6 Correct 84 ms 56384 KB Output is correct
7 Correct 78 ms 56404 KB Output is correct
8 Correct 88 ms 56524 KB Output is correct
9 Correct 112 ms 57372 KB Output is correct
10 Correct 75 ms 52388 KB Output is correct
11 Correct 86 ms 52368 KB Output is correct
12 Correct 143 ms 54184 KB Output is correct
13 Correct 83 ms 52468 KB Output is correct
14 Correct 75 ms 52400 KB Output is correct
15 Correct 10551 ms 56644 KB Output is correct
16 Execution timed out 20026 ms 56896 KB Time limit exceeded
17 Halted 0 ms 0 KB -