oj.uz

Submission #289122

# Submission time Handle Problem Language Result Execution time Memory
289122 2020-09-02T11:28:26 Z egekabas Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 32752 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 = 100;
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 segdis[200][5000/sq+5][200];
int cnt;
void dijkstra2(int start, int d[5000/sq+5][200]){
    for(int i = 0; i < r; i += sq){
        for(int j = 0; j < c; ++j)
            d[i/sq][j] = d[i/sq+1][j] = 1e9+7;
        cnt = max(cnt, i/sq+1);
    }
    d[0][start] = 0;
    for(int i = 0; i < r; i += sq)
        for(int j = 0; j < c; ++j)
            for(int k = 0; k < c; ++k){
                d[i/sq+1][k] = min(d[i/sq+1][k], d[i/sq][j] + dis[i/sq][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)
        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]);
    for(int j = 0; j < c; ++j)
        dijkstra2(j,  segdis[j]);
}
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())
        for(int j = 0; j < c; ++j)
            changed[j] = 1;
    for(auto u : change)
        done[u] = 0;
    change.clear();
    if(changed[V1]){
        dijkstra2(V1, segdis[V1]);
        changed[V1] = 0;
    }
    return segdis[V1][cnt][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 9 ms 12288 KB Output is correct
2 Correct 9 ms 12288 KB Output is correct
3 Correct 95 ms 13976 KB Output is correct
4 Correct 9 ms 12288 KB Output is correct
5 Correct 10 ms 12288 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 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 512 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 512 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 88 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 955 ms 1432 KB Output is correct
2 Correct 941 ms 1400 KB Output is correct
3 Correct 972 ms 1400 KB Output is correct
4 Correct 971 ms 1400 KB Output is correct
5 Correct 935 ms 1400 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 4585 ms 1400 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 16256 KB Output is correct
2 Correct 13 ms 16256 KB Output is correct
3 Correct 14 ms 16256 KB Output is correct
4 Correct 56 ms 17144 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 951 ms 1308 KB Output is correct
2 Correct 938 ms 1280 KB Output is correct
3 Correct 965 ms 1280 KB Output is correct
4 Correct 961 ms 1312 KB Output is correct
5 Correct 934 ms 1312 KB Output is correct
6 Correct 14 ms 16256 KB Output is correct
7 Correct 13 ms 16256 KB Output is correct
8 Correct 15 ms 16384 KB Output is correct
9 Correct 56 ms 17144 KB Output is correct
10 Correct 9 ms 12288 KB Output is correct
11 Correct 9 ms 12288 KB Output is correct
12 Correct 89 ms 13944 KB Output is correct
13 Correct 9 ms 12288 KB Output is correct
14 Correct 9 ms 12288 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 512 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 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 90 ms 1528 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 4579 ms 1400 KB Output is correct
28 Execution timed out 20014 ms 24912 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 969 ms 1400 KB Output is correct
2 Correct 951 ms 1280 KB Output is correct
3 Correct 968 ms 1400 KB Output is correct
4 Correct 979 ms 1280 KB Output is correct
5 Correct 940 ms 1280 KB Output is correct
6 Correct 14 ms 16256 KB Output is correct
7 Correct 14 ms 16384 KB Output is correct
8 Correct 14 ms 16256 KB Output is correct
9 Correct 57 ms 17144 KB Output is correct
10 Correct 9 ms 12288 KB Output is correct
11 Correct 9 ms 12288 KB Output is correct
12 Correct 94 ms 13944 KB Output is correct
13 Correct 9 ms 12288 KB Output is correct
14 Correct 9 ms 12288 KB Output is correct
15 Correct 3116 ms 32752 KB Output is correct
16 Execution timed out 20074 ms 32516 KB Time limit exceeded
17 Halted 0 ms 0 KB -