oj.uz

답안 #1012531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012531 2024-07-02T09:31:21 Z parsadox2 웜뱃 (IOI13_wombats) C++17
39 / 100
 20000 ms 36040 KB 
#include <bits/stdc++.h>
#include "wombats.h"
#define F first
#define S second
using namespace std;
 
const int N = 5e3 + 10 , M = 2e2 + 10 , Sq = 130 , inf = 1e9 + 10 , TOF = N / Sq + 10;
 
int r , c , h[N][M] , v[N][M] , nex[TOF][M][M] , adj[M][M] , ans[M][M] , dis[N][M] , dis2[TOF][M] , las;
bool is_update , marked[N][M];
 
void Dij(int num , int Qs)
{
	int Ps = num * Sq , R = min(r - 1 , Ps + Sq);
	las = max(las , num);
	for(int i = Ps ; i <= R ; i++)  for(int j = 0 ; j < c ; j++)
	{
		marked[i][j] = false;
		dis[i][j] = inf;
	}
	dis[Ps][Qs] = 0;
	priority_queue <pair<int , pair<int , int>> , vector <pair<int , pair<int , int>>> , greater<pair<int , pair<int , int>>>> pq;
	pq.push({Ps , {0 , Qs}});
	while(!pq.empty())
	{
		auto now = pq.top();  pq.pop();
		int D = now.S.F , p = now.F , q = now.S.S;
		if(marked[p][q])
			continue;
		marked[p][q] = true;
		if(q + 1 < c && D + h[p][q] < dis[p][q + 1])
		{
			dis[p][q + 1] = D + h[p][q];
			pq.push({p , {dis[p][q + 1] , q + 1}});
		}
		if(q - 1 >= 0 && D + h[p][q - 1] < dis[p][q - 1])
		{
			dis[p][q - 1] = D + h[p][q - 1];
			pq.push({p , {dis[p][q - 1] , q - 1}});
		}
		if(p + 1 <= R && D + v[p][q] < dis[p + 1][q])
		{
			dis[p + 1][q] = D + v[p][q];
			pq.push({p + 1 , {dis[p + 1][q] , q}});
		}
	}
	for(int i = 0 ; i < c ; i++)
	{
		//cout << Ps << " " << Qs << " " << R << " " << i << " : " << dis[R][i] << endl;
		nex[num][Qs][i] = dis[R][i];
	}
	if(num == 0)
	{
		for(int i = 0 ; i < c ; i++)
			adj[Qs][i] = dis[Ps][i];
	}
}
 
void Solve(int Qs)
{
	for(int i = 0 ; i < las + 2 ; i++)  for(int j = 0 ; j < c ; j++)
	{
		dis2[i][j] = inf;
	}
	for(int i = 0 ; i < c ; i++)
		dis2[0][i] = adj[Qs][i];
	for(int i = 0 ; i <= las ; i++)
	{
		for(int j = 0 ; j < c ; j++)  for(int k = 0 ; k < c ; k++)
		{
			dis2[i + 1][k] = min(dis2[i + 1][k] , dis2[i][j] + nex[i][j][k]);
			//cout << i << " " << j << " " << k << " " << dis2[i][j] << " " << nex[i][j][k] << endl;
		}
	}
	for(int i = 0 ; i < c ; i++)
	{
		//cout << Qs << " " << i << " : " << dis2[las + 1][i] << endl;
		ans[Qs][i] = dis2[las + 1][i];
	}
}
 
void init(int R , int C , int H[5000][200] , int V[5000][200])
{
	r = R;  c = C;
	for(int i = 0 ; i < R ; i++)  for(int j = 0 ; j + 1 < C ; j++)
		h[i][j] = H[i][j];
	for(int i = 0 ; i + 1 < R ; i++)  for(int j = 0 ; j < C ; j++)
		v[i][j] = V[i][j];
	for(int i = 0 ; i < R ; i += Sq)  for(int j = 0 ; j < C ; j++)
		Dij(i / Sq , j);
}
 
void changeH(int P , int Q , int W)
{
	is_update = false;
	h[P][Q] = W;
	for(int j = 0 ; j < c ; j++)
	{
		Dij(P / Sq , j);
		if(P > 0 && P % Sq == 0)
			Dij((P - 1) / Sq , j);
	}
}
 
void changeV(int P , int Q , int W)
{
	is_update = false;
	v[P][Q] = W;
	for(int j = 0 ; j < c ; j++)
		Dij(P / Sq , j);
}
 
int escape(int v1 , int v2)
{
	if(!is_update)
	{
		for(int i = 0 ; i < c ; i++)
			Solve(i);
		is_update = true;
	}
	return ans[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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 13656 KB Output is correct
2 Correct 7 ms 13660 KB Output is correct
3 Correct 43 ms 16464 KB Output is correct
4 Correct 7 ms 13656 KB Output is correct
5 Correct 6 ms 13784 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 52 ms 2940 KB Output is correct
12 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8851 ms 1144 KB Output is correct
2 Correct 7113 ms 1212 KB Output is correct
3 Correct 8911 ms 1376 KB Output is correct
4 Correct 8882 ms 1148 KB Output is correct
5 Correct 8893 ms 1224 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Execution timed out 20089 ms 1056 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21848 KB Output is correct
2 Correct 20 ms 21916 KB Output is correct
3 Correct 19 ms 21852 KB Output is correct
4 Correct 33 ms 23120 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8751 ms 1140 KB Output is correct
2 Correct 6934 ms 1048 KB Output is correct
3 Correct 9297 ms 1104 KB Output is correct
4 Correct 9724 ms 1240 KB Output is correct
5 Correct 9209 ms 1232 KB Output is correct
6 Correct 21 ms 21852 KB Output is correct
7 Correct 17 ms 21848 KB Output is correct
8 Correct 15 ms 21848 KB Output is correct
9 Correct 31 ms 23124 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Correct 5 ms 14940 KB Output is correct
12 Correct 39 ms 17780 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 5 ms 14928 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 41 ms 8860 KB Output is correct
26 Correct 2 ms 6488 KB Output is correct
27 Execution timed out 20090 ms 6912 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9047 ms 3204 KB Output is correct
2 Correct 7242 ms 3180 KB Output is correct
3 Correct 9188 ms 3204 KB Output is correct
4 Correct 9751 ms 3204 KB Output is correct
5 Correct 9424 ms 3192 KB Output is correct
6 Correct 15 ms 21852 KB Output is correct
7 Correct 17 ms 21852 KB Output is correct
8 Correct 15 ms 21964 KB Output is correct
9 Correct 47 ms 23260 KB Output is correct
10 Correct 8 ms 13660 KB Output is correct
11 Correct 7 ms 13760 KB Output is correct
12 Correct 68 ms 16860 KB Output is correct
13 Correct 9 ms 13656 KB Output is correct
14 Correct 8 ms 13660 KB Output is correct
15 Correct 12267 ms 36040 KB Output is correct
16 Execution timed out 20052 ms 35060 KB Time limit exceeded
17 Halted 0 ms 0 KB -