Submission #249935

#TimeUsernameProblemLanguageResultExecution timeMemory
249935MarcoMeijerWombats (IOI13_wombats)C++14
12 / 100
2574 ms40312 KiB
#include "wombats.h" #include <bits/stdc++.h> using namespace std; //macros typedef long long ll; typedef pair<int, int> ii; typedef pair<ll, ll> lll; typedef tuple<int, int, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<ll> vll; typedef vector<lll> vlll; #define REP(a,b,c) for(int a=int(b); a<int(c); a++) #define RE(a,c) REP(a,0,c) #define RE1(a,c) REP(a,1,c+1) #define REI(a,b,c) REP(a,b,c+1) #define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--) #define INF 1e9 #define pb push_back #define fi first #define se second #define sz size() const int MX = 6000; int r, c; int h[MX][200], v[MX][200]; int SEG[200][200][1000]; int dp[200][200][2]; int n; void createSeg(int x, int p) { int bg=x*20; int ed=min(x*20+20, r); int m = ed-bg; RE(i,c) RE(j,c) { int ans = 0; REP(k,i,j) ans += h[bg][k]; REV(k,j,i) ans += h[bg][k]; dp[i][j][0] = ans; } REP(y,1,m) { bool cur=y%2; RE(i,c) RE(j,c) dp[i][j][cur] = dp[i][j][!cur]+v[bg+y-1][j];; RE(i,c) { REP(j,1,c ) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j-1][cur]+h[bg+y][j-1]); REV(j,0,c-1) dp[i][j][cur] = min(dp[i][j][cur], dp[i][j+1][cur]+h[bg+y][j]); } } bool cur=!(m%2); RE(i,c) RE(j,c) SEG[i][j][p] = dp[i][j][cur]; } void combineSeg(int x, int p) { x = (x+1)*20-1; RE(i,c) { RE(j,c) { SEG[i][j][p] = INF; RE(k,c) SEG[i][j][p] = min(SEG[i][j][p], SEG[i][k][p*2+1]+SEG[k][j][p*2+2]+v[x][k]); } } } void buildSeg(int p=0, int l=0, int r=n-1) { if(l == r) { createSeg(l, p); return; } int m=(l+r)/2; buildSeg(p*2+1,l,m); buildSeg(p*2+2,m+1,r); combineSeg(p,m); } void updateSeg(int i, int p=0, int l=0, int r=n-1) { if(i < l || i > r) return; if(l == r) { createSeg(i,p); return; } int m=(l+r)/2; updateSeg(i,p*2+1,l,m); updateSeg(i,p*2+2,m+1,r); combineSeg(p,m); } void init(int R, int C, int H[5000][200], int V[5000][200]) { r=R, c=C; RE(i,r) RE(j,c) h[i][j]=H[i][j]; RE(i,r) RE(j,c) v[i][j]=V[i][j]; n = (r+19)/20; buildSeg(); } void changeH(int P, int Q, int W) { h[P][Q] = W; updateSeg(P/20); } void changeV(int P, int Q, int W) { v[P][Q] = W; updateSeg(P/20); } int escape(int V1, int V2) { return SEG[V1][V2][0]; }

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  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...