제출 #384087

#제출 시각아이디문제언어결과실행 시간메모리
384087kshitij_sodani웜뱃 (IOI13_wombats)C++14
55 / 100
20089 ms28076 KiB
//#pragma GCC optimize("Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; typedef long long llo; #define mp make_pair #define pb push_back #define a first #define b second #define endl '\n' #include "wombats.h" int aa[5000][201]; int bb[5000][201]; int dp[5000][201]; int n,m; int su=0; 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-1;j++){ aa[i][j]=H[i][j]; su+=aa[i][j]; } } for(int j=0;j<m;j++){ for(int i=0;i<n-1;i++){ bb[i][j]=V[i][j]; su+=bb[i][j]; } } /* ... */ } void changeH(int p, int q, int w) { /* ... */ aa[p][q]=w; } void changeV(int p, int q, int w) { /* ... */ bb[p][q]=w; } int escape(int c, int d) { //return 0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ dp[i][j]=1e9; } } dp[0][c]=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(i>0){ dp[i][j]=min(dp[i][j],dp[i-1][j]+bb[i-1][j]); } } for(int j=0;j<m-1;j++){ dp[i][j+1]=min(dp[i][j+1],dp[i][j]+aa[i][j]); } for(int j=m-1;j>0;j--){ dp[i][j-1]=min(dp[i][j-1],dp[i][j]+aa[i][j-1]); } } /*for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cout<<dp[i][j]<<","; } cout<<endl; } */ return dp[n-1][d]; }

컴파일 시 표준 에러 (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...