oj.uz

Submission #728366

# Submission time Handle Problem Language Result Execution time Memory
728366 2023-04-22T10:00:18 Z Rasoul006 Wombats (IOI13_wombats) C++17
12 / 100
 20000 ms 25604 KB 
#include "wombats.h"

#include <bits/stdc++.h>

#define endl "\n"

#define F first

#define S second

#define pb push_back

#define all(x) x.begin() , x.end()

typedef long long ll;

using namespace std;

const int N = 6e3+5;

const long long oo = 1e18;

ll dx[] = {1 , -1 , 0} ;
ll dy[] = {0 , 0 , 1} ;

ll n , m , h[N][204] , v[N][204] , sum , c , r ;

ll dis[24][24][24][24] ;

set < pair <ll, pair <ll, ll>> > st ;

void init(int R, int C, int H[5000][200], int V[5000][200]) {

    r = R , c = C ;

    n = r , m = c ;

    for (int i = 0 ; i<n ; i++)
    {
        for (int j = 0 ; j<m ; j++)
            v[i][j] = V[i][j] , h[i][j] = H[i][j] ;
    }

}

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

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

int escape(int V1, int V2){

    for (int p = 0 ; p<n ; p++)
        for (int j = 0 ; j<m ; j++)
            dis[0][V1][p][j] = oo ;
    
    ll i = V1 ; 
    
    st.insert({0 , {0 , i}});

    while (!st.empty())
    {
        pair <ll , pair <ll,ll>> pr = *st.begin() ;

        st.erase(st.begin());

        ll cos = pr.F , x = pr.S.F , y = pr.S.S ;

        if (cos + v[x][y] < dis[0][i][x+1][y] && x+1 < n)
        {
            dis[0][i][x+1][y] = cos + v[x][y] ;
            st.insert({dis[0][i][x+1][y] , {x+1 , y}});
        }

        if (cos + h[x][y] < dis[0][i][x][y+1] && y+1<m)
        {
            dis[0][i][x][y+1] = cos + h[x][y] ;
            st.insert({dis[0][i][x][y+1] , {x , y+1}});
        }

        if (cos + h[x][y-1] < dis[0][i][x][y-1] && y-1 >= 0)
        {
            dis[0][i][x][y-1] = cos + h[x][y-1] ;
            st.insert({dis[0][i][x][y-1] , {x , y-1}});
        }
    }

    
    return dis[0][V1][n-1][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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 21152 KB Output is correct
2 Correct 106 ms 21160 KB Output is correct
3 Execution timed out 20072 ms 22880 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 29 ms 468 KB Output is correct
5 Correct 14 ms 492 KB Output is correct
6 Correct 17 ms 536 KB Output is correct
7 Correct 33 ms 544 KB Output is correct
8 Correct 24 ms 588 KB Output is correct
9 Correct 27 ms 532 KB Output is correct
10 Correct 24 ms 512 KB Output is correct
11 Correct 12717 ms 2272 KB Output is correct
12 Correct 29 ms 468 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 1256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 746 ms 25112 KB Output is correct
2 Correct 1250 ms 25128 KB Output is correct
3 Correct 758 ms 25112 KB Output is correct
4 Execution timed out 20014 ms 25604 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 1272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 59 ms 1244 KB Output isn't correct
2 Halted 0 ms 0 KB -