oj.uz

Submission #249940

# Submission time Handle Problem Language Result Execution time Memory
249940 2020-07-16T14:08:16 Z MarcoMeijer Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 173432 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()

const int MX = 6000, DIV=40;
int r, c;
int h[MX][200], v[MX][200];

int SEG[200][200][1000];
int dp[200][200][2];
int n;

void createSeg(int x, int p) {
    int bg=x*DIV;
    int ed=min(x*DIV+DIV, r);

    int m = ed-bg;

    RE(y,m) {
        bool cur=y%2;
        if(y == 0) {
            RE(i,c) RE(j,c) dp[i][j][0] = INF;
            RE(i,c) dp[i][i][0] = 0;
        } else {
            RE(i,c) RE(j,c) dp[i][j][cur] = dp[i][j][!cur]+v[bg+y-1][j];
        }
        RE(i,c) {
            REP(j,1,c  ) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j-1][cur]+h[bg+y][j-1]);
            REV(j,0,c-1) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j+1][cur]+h[bg+y][j]);
        }
    }
    bool cur=!(m%2);
    RE(i,c) RE(j,c) SEG[i][j][p] = dp[i][j][cur];
}
void combineSeg(int x, int p) {
    x = (x+1)*DIV-1;
    RE(i,c) {
        RE(j,c) {
            SEG[i][j][p] = INF;
            RE(k,c)
                SEG[i][j][p] = min(SEG[i][j][p], SEG[i][k][p*2+1]+SEG[k][j][p*2+2]+v[x][k]);
        }
    }
}
void buildSeg(int p=0, int l=0, int r=n-1) {
    if(l == r) {
        createSeg(l, p);
        return;
    }
    int m=(l+r)/2;
    buildSeg(p*2+1,l,m);
    buildSeg(p*2+2,m+1,r);
    combineSeg(m,p);
}
void updateSeg(int i, int p=0, int l=0, int r=n-1) {
    if(i < l || i > r) return;
    if(l == r) {
        createSeg(i,p);
        return;
    }
    int m=(l+r)/2;
    updateSeg(i,p*2+1,l,m);
    updateSeg(i,p*2+2,m+1,r);
    combineSeg(m,p);
}

void init(int R, int C, int H[5000][200], int V[5000][200]) {
    r=R, c=C;
    RE(i,r) RE(j,c) h[i][j]=H[i][j]; 
    RE(i,r) RE(j,c) v[i][j]=V[i][j];
    n = (r+DIV-1)/DIV;
    buildSeg();
}

void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    updateSeg(P/DIV);
}

void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    updateSeg(P/DIV);
}

int escape(int V1, int V2) {
    return SEG[V1][V2][0];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12032 KB Output is correct
2 Correct 8 ms 12160 KB Output is correct
3 Correct 99 ms 14200 KB Output is correct
4 Correct 7 ms 12160 KB Output is correct
5 Correct 7 ms 12160 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 2048 KB Output is correct
5 Correct 1 ms 2048 KB Output is correct
6 Correct 2 ms 2048 KB Output is correct
7 Correct 2 ms 2048 KB Output is correct
8 Correct 2 ms 2048 KB Output is correct
9 Correct 1 ms 2048 KB Output is correct
10 Correct 1 ms 1920 KB Output is correct
11 Correct 91 ms 3244 KB Output is correct
12 Correct 2 ms 2048 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1849 ms 40252 KB Output is correct
2 Correct 2710 ms 39344 KB Output is correct
3 Correct 2528 ms 40140 KB Output is correct
4 Correct 2513 ms 40188 KB Output is correct
5 Correct 2729 ms 39352 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 13636 ms 40136 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16000 KB Output is correct
2 Correct 10 ms 16000 KB Output is correct
3 Correct 11 ms 16000 KB Output is correct
4 Correct 52 ms 16888 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1843 ms 40088 KB Output is correct
2 Correct 2680 ms 39416 KB Output is correct
3 Correct 2516 ms 40184 KB Output is correct
4 Correct 2521 ms 40216 KB Output is correct
5 Correct 2674 ms 39312 KB Output is correct
6 Correct 15 ms 16000 KB Output is correct
7 Correct 11 ms 16000 KB Output is correct
8 Correct 14 ms 16000 KB Output is correct
9 Correct 52 ms 16760 KB Output is correct
10 Correct 11 ms 12032 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 94 ms 13944 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 8 ms 12032 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 2 ms 2048 KB Output is correct
19 Correct 1 ms 2048 KB Output is correct
20 Correct 1 ms 2048 KB Output is correct
21 Correct 1 ms 2048 KB Output is correct
22 Correct 1 ms 1920 KB Output is correct
23 Correct 2 ms 2048 KB Output is correct
24 Correct 1 ms 1920 KB Output is correct
25 Correct 84 ms 3064 KB Output is correct
26 Correct 1 ms 2048 KB Output is correct
27 Correct 13423 ms 40096 KB Output is correct
28 Execution timed out 20040 ms 56056 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1843 ms 40080 KB Output is correct
2 Correct 2681 ms 39416 KB Output is correct
3 Correct 2530 ms 40064 KB Output is correct
4 Correct 2561 ms 40088 KB Output is correct
5 Correct 2692 ms 39304 KB Output is correct
6 Correct 11 ms 16000 KB Output is correct
7 Correct 12 ms 16000 KB Output is correct
8 Correct 11 ms 16000 KB Output is correct
9 Correct 52 ms 16760 KB Output is correct
10 Correct 7 ms 12032 KB Output is correct
11 Correct 8 ms 12032 KB Output is correct
12 Correct 87 ms 13688 KB Output is correct
13 Correct 8 ms 12032 KB Output is correct
14 Correct 7 ms 12032 KB Output is correct
15 Correct 17445 ms 172928 KB Output is correct
16 Execution timed out 20029 ms 173432 KB Time limit exceeded
17 Halted 0 ms 0 KB -