Submission #728550

#TimeUsernameProblemLanguageResultExecution timeMemory
728550Rasoul006Wombats (IOI13_wombats)C++17
18 / 100
12394 ms10236 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 cost[N] , a[N][2] ; 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++) { cost[i] = H[i][0] ; for (int j = 0 ; j<m ; j++) { a[i][j] = V[i][j] ; } } } void changeH(int P, int Q, int W) { cost[P] = W ; } void changeV(int P, int Q, int W) { a[P][Q] = W ; } ll dp[N][2][2] ; ll bt (ll i , bool is , bool is2) { if (i == n) return ((is != is2) * cost[n-1]) ; ll &ret = dp[i][is][is2] ; if (~ret) return ret ; ret = bt(i+1 , is , is2) + a[i][is] ; ret = min(ret , bt(i+1 , !is , is2) + cost[i] + a[i][!is]); return ret ; } int escape(int V1, int V2) { for (int i = 0 ; i<=n+9 ; i++) { dp[i][0][0] = -1 ; dp[i][0][1] = -1 ; dp[i][1][0] = -1 ; dp[i][1][1] = -1 ; } if (bt(0 , V1 , V2) == cost[n-1]) assert(true); return bt(0 , V1 , V2) ; }

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...