oj.uz

Submission #289068

# Submission time Handle Problem Language Result Execution time Memory
289068 2020-09-02T10:20:15 Z egekabas Wombats (IOI13_wombats) C++14
55 / 100
 20000 ms 19020 KB 
#include "wombats.h"
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#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 = 300;
int h[5000][200];
int v[5000][200];
int dis[5000/sq+5][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 i = 0; i < r; i += sq)
        for(int j = 0; j < c; ++j)
            dijkstra(i, min(i+sq, r-1), j, dis[i/sq][j]);
}
    
void changeH(int P, int Q, int W) {
    h[P][Q] = W;
    int gr = P/sq;
    for(int j = 0; j < c; ++j)
        dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]);
    if(gr > 0 && P%sq == 0){
        --gr;
        for(int j = 0; j < c; ++j)
            dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]);
    }
}
    
void changeV(int P, int Q, int W) {
    v[P][Q] = W;
    int gr = P/sq;
    for(int j = 0; j < c; ++j)
        dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]);
}
int curd[200];
int newd[200];

int escape(int V1, int V2) {
    for(int j = 0; j < c; ++j)
        curd[j] = newd[j] = 1e9+7;
    curd[V1] = 0;
    for(int i = 0; i < r; i += sq){
        for(int j = 0; j < c; ++j)
            for(int k = 0; k < c; ++k)
                newd[k] = min(newd[k], curd[j]+dis[i/sq][k][j]);
        for(int j = 0; j < c; ++j){
            curd[j] = newd[j];
            newd[j] = 1e9+7;
        }
    }
    return curd[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:3: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12160 KB Output is correct
2 Correct 10 ms 12160 KB Output is correct
3 Correct 161 ms 13688 KB Output is correct
4 Correct 10 ms 12160 KB Output is correct
5 Correct 10 ms 12160 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 360 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 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 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 160 ms 1400 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 1950 ms 888 KB Output is correct
2 Correct 1910 ms 888 KB Output is correct
3 Correct 1970 ms 792 KB Output is correct
4 Correct 1967 ms 788 KB Output is correct
5 Correct 1935 ms 792 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 9781 ms 796 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 20 ms 16128 KB Output is correct
2 Correct 20 ms 16128 KB Output is correct
3 Correct 20 ms 16128 KB Output is correct
4 Correct 104 ms 17016 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1947 ms 1016 KB Output is correct
2 Correct 1901 ms 768 KB Output is correct
3 Correct 1949 ms 768 KB Output is correct
4 Correct 1954 ms 796 KB Output is correct
5 Correct 1916 ms 792 KB Output is correct
6 Correct 19 ms 16120 KB Output is correct
7 Correct 19 ms 16000 KB Output is correct
8 Correct 21 ms 16128 KB Output is correct
9 Correct 103 ms 16888 KB Output is correct
10 Correct 10 ms 12160 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 139 ms 13688 KB Output is correct
13 Correct 10 ms 12160 KB Output is correct
14 Correct 10 ms 12160 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 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 163 ms 1400 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 10036 ms 796 KB Output is correct
28 Execution timed out 20077 ms 17664 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1958 ms 896 KB Output is correct
2 Correct 1915 ms 888 KB Output is correct
3 Correct 1992 ms 888 KB Output is correct
4 Correct 1975 ms 888 KB Output is correct
5 Correct 1927 ms 888 KB Output is correct
6 Correct 19 ms 16000 KB Output is correct
7 Correct 20 ms 16128 KB Output is correct
8 Correct 20 ms 16128 KB Output is correct
9 Correct 101 ms 16844 KB Output is correct
10 Correct 10 ms 12288 KB Output is correct
11 Correct 10 ms 12160 KB Output is correct
12 Correct 140 ms 13700 KB Output is correct
13 Correct 10 ms 12160 KB Output is correct
14 Correct 10 ms 12160 KB Output is correct
15 Correct 5118 ms 18848 KB Output is correct
16 Execution timed out 20028 ms 19020 KB Time limit exceeded
17 Halted 0 ms 0 KB -