이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int>vi;
#define pb push_back
#define sz(v) (int)v.size()
typedef pair<int,int>pi;
#define fi first
#define se second
typedef vector<pi>vpi;
#define eb emplace_back
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)
void ckmax(int &x, int y){x=max(x,y);}
void ckmin(int &x, int y){x=min(x,y);}
const int MX=1e5+10;
//-----------------------------
int N,M,R[5000][200],D[5000][200];
void init(int N, int M, int H[5000][200], int V[5000][200]) {
::N=N; ::M=M;
FOR(i,0,N) FOR(j,0,M){
R[i][j]=H[i][j];
D[i][j]=V[i][j];
}
}
void changeH(int x, int y, int w) {
R[x][y]=w;
}
void changeV(int x, int y, int w) {
D[x][y]=w;
}
int get(int x, int l, int r){
if(l>r) swap(l,r);
int ans=0;
FOR(i,l,r) ans+=R[x][i];
return ans;
}
int escape(int V1, int V2) {
int dp[N][M];
FOR(j,0,M) dp[0][j]=get(0,V1,j);
FOR(i,1,N) FOR(j,0,M){
dp[i][j]=2e9;
FOR(k,0,M){
int x=get(i,j,k)+dp[i-1][k]+D[i-1][k];
ckmin(dp[i][j],x);
}
}
return dp[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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |