제출 #728358

#제출 시각아이디문제언어결과실행 시간메모리
728358Rasoul006웜뱃 (IOI13_wombats)C++17
12 / 100
74 ms24936 KiB
#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] ; } for (int i = 0 ; i<m ; i++) { for (int p = 0 ; p<n ; p++) for (int j = 0 ; j<m ; j++) dis[0][i][p][j] = oo ; 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}}); } } } } 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){ return dis[0][V1][n-1][V2]; }

컴파일 시 표준 에러 (stderr) 메시지

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...