oj.uz

Submission #289136

# Submission time Handle Problem Language Result Execution time Memory
289136 2020-09-02T12:01:00 Z egekabas Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 32368 KB 
#include "wombats.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int r, c;
const int sq = 150;
int h[5000][200];
int v[5000][200];
int dis[5000/sq+5][200][200];
void dijkstra1(int beg, int end, int imp, int dis[200]){
    for(int j = 0; j < c; ++j)
        dis[j] = 1e9+7;
    dis[imp] = 0;
    for(int i = end; i >= beg; --i){
        for(int j = 1; j < c; ++j)
            dis[j] = min(dis[j], dis[j-1]+h[i][j-1]);
        for(int j = c-2; j >= 0; --j)
            dis[j] = min(dis[j], dis[j+1]+h[i][j]);
        for(int j = 0; j < c && i != beg; ++j)
            dis[j] = min((int)1e9+7, dis[j] + v[i-1][j]);
    }
}
int cnt;
int segdis[(5000/sq)*4+5][200][200];
void calc(int v, int tl, int tr){
    if(tl == tr){
        for(int i = 0; i < c; ++i)
            for(int j = 0; j < c; ++j){
                if(i == j)
                    segdis[v][i][j] == 0;
                else
                    segdis[v][i][j] = 1e9;
            }
        return;
    }
    if(tl == tr-1){
        for(int i = 0; i < c; ++i)
            for(int j = 0; j < c; ++j){
                segdis[v][i][j] = dis[tl][j][i];
            }
        return;
    }
    int tm = (tl+tr)/2;
    calc(2*v, tl, tm);
    calc(2*v+1, tm, tr);
    for(int i = 0; i < c; ++i)
        for(int j = 0; j < c; ++j){
            segdis[v][i][j] = 1e9+7;
            for(int k = 0; k < c; ++k)
                segdis[v][i][j] = min(segdis[v][i][j], segdis[2*v][i][k] + segdis[2*v+1][k][j]);
        }    
}


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 += sq)
        cnt = max(cnt, i/sq+1);
    for(int i = 0; i < r; ++i)
        for(int j = 0; j < c; ++j){
            h[i][j] = H[i][j];
            v[i][j] = V[i][j];
        }
    for(int i = 0; i < r; i += sq)
        for(int j = 0; j < c; ++j)
            dijkstra1(i, min(i+sq, r-1), j, dis[i/sq][j]);
    calc(1, 0, cnt);
}
vector<int> change;
void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    int gr = P/sq;
    change.pb(gr);
    if(gr > 0 && P%sq == 0){
        change.pb(gr-1);
    }
}
    
void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    int gr = P/sq;
    change.pb(gr);
}
int curd[200];
int newd[200];
int done[sq+5];
int changed[200];
int escape(int V1, int V2) {
    for(auto u : change){
        if(done[u]) continue;
        for(int j = 0; j < c; ++j)
            dijkstra1(u*sq, min(r-1, (u+1)*sq), j, dis[u][j]);
    }
    if(change.size())
        calc(1, 0, cnt);

    for(auto u : change)
        done[u] = 0;
    change.clear();
    return segdis[1][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;
      |      ^~~
wombats.cpp: In function 'void calc(int, int, int)':
wombats.cpp:41:37: warning: statement has no effect [-Wunused-value]
   41 |                     segdis[v][i][j] == 0;
      |                     ~~~~~~~~~~~~~~~~^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12544 KB Output is correct
2 Correct 9 ms 12544 KB Output is correct
3 Correct 99 ms 14072 KB Output is correct
4 Correct 9 ms 12544 KB Output is correct
5 Correct 8 ms 12544 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 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 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 105 ms 1528 KB Output is correct
12 Correct 1 ms 512 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 956 ms 892 KB Output is correct
2 Correct 934 ms 876 KB Output is correct
3 Correct 976 ms 888 KB Output is correct
4 Correct 963 ms 768 KB Output is correct
5 Correct 936 ms 880 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 4576 ms 888 KB Output is correct
10 Correct 0 ms 384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16512 KB Output is correct
2 Correct 14 ms 16512 KB Output is correct
3 Correct 15 ms 16512 KB Output is correct
4 Correct 57 ms 17272 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 960 ms 888 KB Output is correct
2 Correct 934 ms 888 KB Output is correct
3 Correct 962 ms 888 KB Output is correct
4 Correct 964 ms 888 KB Output is correct
5 Correct 942 ms 892 KB Output is correct
6 Correct 14 ms 16512 KB Output is correct
7 Correct 14 ms 16512 KB Output is correct
8 Correct 15 ms 16640 KB Output is correct
9 Correct 57 ms 17400 KB Output is correct
10 Correct 9 ms 12544 KB Output is correct
11 Correct 9 ms 12544 KB Output is correct
12 Correct 96 ms 14072 KB Output is correct
13 Correct 9 ms 12544 KB Output is correct
14 Correct 9 ms 12544 KB Output is correct
15 Correct 1 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 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 86 ms 1492 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 4599 ms 884 KB Output is correct
28 Execution timed out 20085 ms 24568 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 963 ms 888 KB Output is correct
2 Correct 931 ms 888 KB Output is correct
3 Correct 963 ms 888 KB Output is correct
4 Correct 969 ms 888 KB Output is correct
5 Correct 936 ms 1016 KB Output is correct
6 Correct 14 ms 16512 KB Output is correct
7 Correct 14 ms 16512 KB Output is correct
8 Correct 14 ms 16512 KB Output is correct
9 Correct 58 ms 17272 KB Output is correct
10 Correct 10 ms 12544 KB Output is correct
11 Correct 9 ms 12544 KB Output is correct
12 Correct 94 ms 14200 KB Output is correct
13 Correct 9 ms 12544 KB Output is correct
14 Correct 9 ms 12544 KB Output is correct
15 Correct 3387 ms 31976 KB Output is correct
16 Execution timed out 20063 ms 32368 KB Time limit exceeded
17 Halted 0 ms 0 KB -