# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
126141 |
2019-07-07T05:55:14 Z |
nxteru |
Wombats (IOI13_wombats) |
C++14 |
|
843 ms |
175936 KB |
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000001
#define B 10
struct node{
int n,d[200][200];
void ini(int x){
n=x;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INF;
}
}
}
node plus(node &q){
node res;
res.ini(n);
int a[205][205],s;
for(int i=n-1;i>-n;i--){
for(int j=max(-i,0);i+j<n&&j<n;j++){
s=INF;
int x,y;
if(j-1>=0)x=a[i+j][j-1];
else x=0;
if(i+j+1<n)y=a[i+j+1][j];
else y=n-1;
for(int k=x;k<=y;k++){
if(d[i+j][k]+q.d[k][j]<s){
x=k;
s=d[i+j][k]+q.d[k][j];
}
}
a[i+j][j]=x;
res.d[i+j][j]=min(s,INF);
}
}
return res;
}
};
struct SEG{
int n;
node seg[1<<10];
void ini(int x){
n=x;
for(int i=0;i<1<<10;i++)seg[i].ini(n);
}
void up(int a,node &q){
a+=(1<<9)-1;
seg[a]=q;
while(a>0){
a=(a-1)/2;
seg[a]=seg[a*2+1].plus(seg[a*2+2]);
}
}
};
int h[5005][205],w[5005][205],n,m,p[205][205];
SEG s;
node res[B];
void change(int x){
x=x/B;
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
if(i==j)p[i][j]=0;
else p[i][j]=INF;
}
}
for(int i=0;i<B&&x*B+i<n;i++){
for(int j=0;j<m;j++){
for(int k=1;k<m;k++)p[j][k]=min(p[j][k],p[j][k-1]+h[x*B+i][k-1]);
for(int k=m-2;k>=0;k--)p[j][k]=min(p[j][k],p[j][k+1]+h[x*B+i][k]);
for(int k=0;k<m;k++)p[j][k]+=w[x*B+i][k];
}
}
node res;
for(int i=0;i<m;i++)for(int j=0;j<m;j++)res.d[i][j]=p[i][j];
s.up(x,res);
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n=R,m=C;
s.ini(m);
for(int i=0;i<n;i++)for(int j=0;j<m-1;j++)h[i][j]=H[i][j];
for(int i=0;i<n-1;i++)for(int j=0;j<m;j++)w[i][j]=V[i][j];
for(int i=0;i<n;i++)change(i);
}
void changeH(int a, int b, int x) {
h[a][b]=x;
change(a);
}
void changeV(int a, int b, int x) {
w[a][b]=x;
change(a);
}
int escape(int a, int b) {
return s.seg[0].d[a][b];
}
Compilation message
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 time |
Memory |
Grader output |
1 |
Correct |
824 ms |
165136 KB |
Output is correct |
2 |
Incorrect |
812 ms |
165188 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
6268 KB |
Output is correct |
2 |
Incorrect |
7 ms |
6264 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
306 ms |
175816 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
843 ms |
173064 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
315 ms |
175936 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
308 ms |
175896 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |