oj.uz

Submission #289081

# Submission time Handle Problem Language Result Execution time Memory
289081 2020-09-02T10:31:11 Z egekabas Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 16760 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;
int h[5000][200];
int v[5000][200];
int dis[200][200];
void dijkstra(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]);
    }
}
    
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 j = 0; j < c; ++j)
        dijkstra(0, r-1, j, dis[j]);
}
int change = 0;
void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    change = 1;
}
    
void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    change = 1;
}

int escape(int V1, int V2) {
    if(change){
        for(int j = 0; j < c; ++j)
            dijkstra(0, r-1, j, dis[j]);
        change = 0;
    }
    return dis[V2][V1];
        
}

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 19 ms 12032 KB Output is correct
2 Correct 19 ms 12032 KB Output is correct
3 Correct 104 ms 13688 KB Output is correct
4 Correct 19 ms 12032 KB Output is correct
5 Correct 19 ms 12032 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 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 1 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 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 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 384 KB Output is correct
11 Correct 95 ms 1476 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 768 KB Output is correct
2 Correct 553 ms 888 KB Output is correct
3 Correct 598 ms 888 KB Output is correct
4 Correct 656 ms 888 KB Output is correct
5 Correct 615 ms 888 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
9 Correct 248 ms 792 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 78 ms 16000 KB Output is correct
2 Correct 76 ms 16000 KB Output is correct
3 Correct 78 ms 16000 KB Output is correct
4 Correct 121 ms 16760 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 768 KB Output is correct
2 Correct 554 ms 780 KB Output is correct
3 Correct 602 ms 768 KB Output is correct
4 Correct 649 ms 768 KB Output is correct
5 Correct 611 ms 768 KB Output is correct
6 Correct 79 ms 16000 KB Output is correct
7 Correct 77 ms 16000 KB Output is correct
8 Correct 82 ms 16000 KB Output is correct
9 Correct 126 ms 16760 KB Output is correct
10 Correct 19 ms 12032 KB Output is correct
11 Correct 21 ms 12032 KB Output is correct
12 Correct 108 ms 13688 KB Output is correct
13 Correct 19 ms 12032 KB Output is correct
14 Correct 19 ms 12032 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 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 95 ms 1400 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 248 ms 768 KB Output is correct
28 Execution timed out 20065 ms 16368 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 768 KB Output is correct
2 Correct 557 ms 768 KB Output is correct
3 Correct 605 ms 768 KB Output is correct
4 Correct 663 ms 768 KB Output is correct
5 Correct 639 ms 784 KB Output is correct
6 Correct 83 ms 16120 KB Output is correct
7 Correct 81 ms 16000 KB Output is correct
8 Correct 83 ms 16032 KB Output is correct
9 Correct 133 ms 16760 KB Output is correct
10 Correct 21 ms 12032 KB Output is correct
11 Correct 27 ms 12032 KB Output is correct
12 Correct 109 ms 13692 KB Output is correct
13 Correct 19 ms 12032 KB Output is correct
14 Correct 19 ms 12032 KB Output is correct
15 Correct 6635 ms 16172 KB Output is correct
16 Execution timed out 20050 ms 16352 KB Time limit exceeded
17 Halted 0 ms 0 KB -