Submission #1075923

#TimeUsernameProblemLanguageResultExecution timeMemory
1075923TheQuantiXWombats (IOI13_wombats)C++17
12 / 100
54 ms10908 KiB
#include <bits/stdc++.h> #include "wombats.h" using namespace std; using ll = long long; constexpr ll INF = 1000000000000000000LL; ll n, m, q, k, x, y, a, b, c, l; vector< vector<ll> > dp[100]; vector< vector<ll> > h; vector< vector<ll> > v; void make_dp(ll c) { dp[c].assign(n, vector<ll> (m, INF)); dp[c][n - 1][c] = 0; for (int i = n - 1; i >= 0; i--) { if (i != n - 1) { for (int j = 0; j < m; j++) { dp[c][i][j] = min(dp[c][i][j], dp[c][i + 1][j] + v[i][j]); } } for (int j = 1; j < m; j++) { dp[c][i][j] = min(dp[c][i][j], dp[c][i][j - 1] + h[i][j - 1]); } for (int j = m - 2; j >= 0; j--) { dp[c][i][j] = min(dp[c][i][j], dp[c][i][j + 1] + h[i][j]); } } } void init(int R, int C, int H[5000][200], int V[5000][200]) { n = R; m = C; h.assign(n, vector<ll> (m - 1)); for (int i = 0; i < n; i++) { for (int j = 0; j < m - 1; j++) { h[i][j] = H[i][j]; } } v.assign(n - 1, vector<ll> (m)); for (int i = 0; i < n - 1; i++) { for (int j = 0; j < m; j++) { v[i][j] = V[i][j]; } } for (int i = 0; i < C; i++) { make_dp(i); } } void changeH(int P, int Q, int W) { } void changeV(int P, int Q, int W) { } int escape(int V1, int V2) { return dp[V2][0][V1]; }

Compilation message (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...