oj.uz

Submission #358265

# Submission time Handle Problem Language Result Execution time Memory
358265 2021-01-25T09:17:41 Z Kerim Wombats (IOI13_wombats) C++17
76 / 100
 16760 ms 262148 KB 
#include "wombats.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int R=5005,C=202;
int h[R][C],v[R][C],n,m;
struct node{
	vector<vector<int> >dp;	
	void init(){
		dp.resize(m);
		for(int i=0;i<m;i++)
			dp[i].resize(m);
	}
	void fill(){
		init();
		for(int i=0;i<m;i++)
			for(int j=0;j<m;j++)
				dp[i][j]=INF;
	}
	void print(){
		for(int i=0;i<m;i++){
			for(int j=0;j<m;j++)
				printf("%d ",dp[i][j]);
			puts("");
		}
	}
}seg[R<<2];
node merge(node x,node y,int mid){
	node z;z.fill();
	for(int i=0;i<m;i++)
		for(int j=0;j<m;j++)
			for(int k=0;k<m;k++)
				umin(z.dp[i][k],x.dp[i][j]+v[mid][j]+y.dp[j][k]);
	return z;
}	
const int L=5;
int odp[L][C];
void naive(int nd,int x,int y){
	queue<PII>q;int nx,ny,id;
	for(int i=0;i<m;i++){
		memset(odp,127,sizeof odp);
		q.push(mp(x,i));odp[0][i]=0;
		while(!q.empty()){
			nx=q.front().ff;ny=q.front().ss;q.pop();id=nx-x;
			if(ny>0 and umin(odp[id][ny-1],odp[id][ny]+h[nx][ny-1]))
				q.push(mp(nx,ny-1));		
			if(ny+1<m and umin(odp[id][ny+1],odp[id][ny]+h[nx][ny]))
				q.push(mp(nx,ny+1));
			if(nx<y and umin(odp[id+1][ny],odp[id][ny]+v[nx][ny]))
				q.push(mp(nx+1,ny));				
		}
		for(int j=0;j<m;j++)
			seg[nd].dp[i][j]=odp[y-x][j];
	}	
}
void build(int nd,int x,int y){
	seg[nd].init();
	if(y-x<L){
		naive(nd,x,y);
		return;			
	}
	int mid=(x+y)>>1;
	build(nd<<1,x,mid);
	build(nd<<1|1,mid+1,y);
	seg[nd]=merge(seg[nd<<1],seg[nd<<1|1],mid);
}
void upd(int p,int nd,int x,int y){
	if(y-x<L){
		naive(nd,x,y);	
		return;
	}
	int mid=(x+y)>>1;
	if(p<=mid)upd(p,nd<<1,x,mid);
	else upd(p,nd<<1|1,mid+1,y);
	seg[nd]=merge(seg[nd<<1],seg[nd<<1|1],mid);
}
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++)
		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++)
			v[i][j]=V[i][j];
	build(1,0,n-1);
}
void changeH(int P, int Q, int W) {
	h[P][Q]=W;upd(P,1,0,n-1);
}
void changeV(int P, int Q, int W) {
	v[P][Q]=W;upd(P,1,0,n-1);
}
int escape(int V1, int V2) {
    return seg[1].dp[V1][V2];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8812 KB Output is correct
2 Correct 10 ms 8812 KB Output is correct
3 Correct 86 ms 10432 KB Output is correct
4 Correct 8 ms 8940 KB Output is correct
5 Correct 7 ms 8812 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 876 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 876 KB Output is correct
11 Correct 81 ms 1900 KB Output is correct
12 Correct 2 ms 1004 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 4204 KB Output is correct
2 Correct 1046 ms 4076 KB Output is correct
3 Correct 990 ms 4076 KB Output is correct
4 Correct 1010 ms 4040 KB Output is correct
5 Correct 1002 ms 4000 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 4950 ms 4048 KB Output is correct
10 Correct 1 ms 876 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16748 KB Output is correct
2 Correct 15 ms 16748 KB Output is correct
3 Correct 15 ms 16748 KB Output is correct
4 Correct 58 ms 17644 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 4204 KB Output is correct
2 Correct 1051 ms 4204 KB Output is correct
3 Correct 981 ms 4076 KB Output is correct
4 Correct 1022 ms 4076 KB Output is correct
5 Correct 976 ms 3948 KB Output is correct
6 Correct 14 ms 16748 KB Output is correct
7 Correct 15 ms 16748 KB Output is correct
8 Correct 14 ms 16748 KB Output is correct
9 Correct 55 ms 17644 KB Output is correct
10 Correct 8 ms 8812 KB Output is correct
11 Correct 8 ms 8812 KB Output is correct
12 Correct 88 ms 10348 KB Output is correct
13 Correct 8 ms 8812 KB Output is correct
14 Correct 8 ms 8812 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 1 ms 748 KB Output is correct
17 Correct 1 ms 748 KB Output is correct
18 Correct 1 ms 876 KB Output is correct
19 Correct 1 ms 876 KB Output is correct
20 Correct 1 ms 876 KB Output is correct
21 Correct 2 ms 876 KB Output is correct
22 Correct 1 ms 876 KB Output is correct
23 Correct 2 ms 876 KB Output is correct
24 Correct 2 ms 876 KB Output is correct
25 Correct 81 ms 1900 KB Output is correct
26 Correct 2 ms 876 KB Output is correct
27 Correct 4841 ms 3948 KB Output is correct
28 Correct 14601 ms 105296 KB Output is correct
29 Correct 12039 ms 102364 KB Output is correct
30 Correct 12028 ms 102408 KB Output is correct
31 Correct 16760 ms 107200 KB Output is correct
32 Correct 1 ms 876 KB Output is correct

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 4076 KB Output is correct
2 Correct 1031 ms 4128 KB Output is correct
3 Correct 1012 ms 4284 KB Output is correct
4 Correct 973 ms 4076 KB Output is correct
5 Correct 942 ms 4076 KB Output is correct
6 Correct 14 ms 16748 KB Output is correct
7 Correct 15 ms 16748 KB Output is correct
8 Correct 15 ms 16748 KB Output is correct
9 Correct 56 ms 17644 KB Output is correct
10 Correct 10 ms 8812 KB Output is correct
11 Correct 8 ms 8812 KB Output is correct
12 Correct 95 ms 10476 KB Output is correct
13 Correct 8 ms 8940 KB Output is correct
14 Correct 10 ms 8812 KB Output is correct
15 Runtime error 11713 ms 262148 KB Execution killed with signal 9
16 Halted 0 ms 0 KB -