oj.uz

Submission #728375

# Submission time Handle Problem Language Result Execution time Memory
728375 2023-04-22T10:04:28 Z Rasoul006 Wombats (IOI13_wombats) C++17
28 / 100
 12216 ms 24276 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[105][105] ;

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

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

    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[p][j] = oo ;

    st.insert({0 , {0 , V1}});

    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[x+1][y] && x+1 < n)
        {
            dis[x+1][y] = cos + v[x][y] ;
            st.insert({dis[x+1][y] , {x+1 , y}});
        }

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

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


    return dis[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 Incorrect 13 ms 20168 KB Output isn't correct
2 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 22 ms 452 KB Output is correct
5 Correct 13 ms 440 KB Output is correct
6 Correct 14 ms 444 KB Output is correct
7 Correct 21 ms 340 KB Output is correct
8 Correct 20 ms 340 KB Output is correct
9 Correct 24 ms 420 KB Output is correct
10 Correct 21 ms 340 KB Output is correct
11 Correct 12216 ms 1480 KB Output is correct
12 Correct 27 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 1004 KB Output is correct
2 Correct 241 ms 1364 KB Output is correct
3 Correct 193 ms 988 KB Output is correct
4 Correct 188 ms 980 KB Output is correct
5 Correct 193 ms 980 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 209 ms 1044 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 880 KB Output is correct
2 Correct 238 ms 1336 KB Output is correct
3 Correct 196 ms 980 KB Output is correct
4 Correct 199 ms 980 KB Output is correct
5 Correct 196 ms 980 KB Output is correct
6 Incorrect 21 ms 24240 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 892 KB Output is correct
2 Correct 208 ms 1316 KB Output is correct
3 Correct 204 ms 992 KB Output is correct
4 Correct 220 ms 984 KB Output is correct
5 Correct 186 ms 972 KB Output is correct
6 Incorrect 19 ms 24276 KB Output isn't correct
7 Halted 0 ms 0 KB -