oj.uz

Submission #73709

# Submission time Handle Problem Language Result Execution time Memory
73709 2018-08-28T17:56:07 Z georgerapeanu Robots (APIO13_robots) C++11
60 / 100
 1500 ms 124816 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define JUDGE 1
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <algorithm>

using namespace std;

#if JUDGE
FILE *f = stdin;
FILE *g = stdout;
#else
FILE *f = fopen("robots.in","r");
FILE *g = fopen("robots.out","w");
#endif
int n,w,h;
int dp[505][505][9][9];
pair<int,int> where_do_i_end[505][505][4];
char C[505][505];

const int dx[] = {-1,0,1,0};
const int dy[] = {0,1,0,-1};
const int inf = 1 << 28;

const int MAX_COST = 500 * 500;

vector< pair<int,int> > chestii[MAX_COST];

int start_cost = inf;
int end_cost = 0;

inline void push(int x,int y,int cost){
    if(cost >= MAX_COST){
        return ;
    }
	chestii[cost].push_back({x,y});
	start_cost = min(start_cost,cost);
	end_cost = max(end_cost,cost);
}

void solve(int st,int dr){
	for(int cost = start_cost;cost <= end_cost;cost++){
		for(auto pos:chestii[cost]){
			if(dp[pos.first][pos.second][st][dr] != cost){
				continue;
			}
			for(int k = 0;k < 4;k++){
				pair<int,int> npos = where_do_i_end[pos.first][pos.second][k];
				if(npos.first == -1 && npos.second == -1){
					continue;
				}

				if(dp[npos.first][npos.second][st][dr] > cost + 1){
					dp[npos.first][npos.second][st][dr] = cost + 1;
					push(npos.first,npos.second,cost + 1);
				}
			}
		}
		chestii[cost].clear();
	}
	start_cost = inf;
	end_cost = 0;
}

pair<int,int> get_end(int i,int j,int k){
	if(where_do_i_end[i][j][k].first)return where_do_i_end[i][j][k];
	int dir = k + (C[i][j] == 'A' ? 3:0) + (C[i][j] == 'C');dir &= 3;
	int x = i + dx[dir];
	int y = j + dy[dir];
	if(x && y && x <= h && y <= w && C[x][y] != 'x')return where_do_i_end[i][j][k] = get_end(x,y,dir);
	return where_do_i_end[i][j][k] = {i,j};
}

int main(){
	fscanf(f,"%d %d %d\n",&n,&w,&h);

	for(int i = 1;i <= h;i++){
		fgets(C[i] + 1,505,f);
	}


	for(int i = 1;i <= h;i++ ){
		for(int j = 1;j <= w;j++){
			for(int k = 0;k < 4;k++){
				where_do_i_end[i][j][k] = get_end(i,j,k);
			}
		}
	}

	for(int i = 1;i <= h;i++){
		for(int j = 1;j <= w;j++){
			for(int st = 0;st < n;st++){
				for(int dr = 0;dr < n;dr++){
					dp[i][j][st][dr] = inf;
				}
			}
		}
	}
	for(int i = 1;i <= h;i++){
		for(int j = 1;j <= w;j++){
			if('1' <= C[i][j] && C[i][j]  <= '9'){
				dp[i][j][C[i][j] - '1'][C[i][j] - '1'] = 0;
				push(i,j,0);
				solve(C[i][j] - '1',C[i][j] - '1');
			}
		}
	}
	for(int l = 1;l < 9;l++){
		for(int st = 0;st < n - l;st++){
			int dr = st + l;
			for(int i = 1;i <= h;i++){
				for(int j = 1;j <= w;j++){
						for(int k = st;k < dr;k++){
							dp[i][j][st][dr] = min(dp[i][j][st][k] + dp[i][j][k + 1][dr],dp[i][j][st][dr]);
						}
						push(i,j,dp[i][j][st][dr]);
				}
			}
			solve(st,dr);
		}
	}

	int ans = inf;

	for(int i = 1;i <= h;i++){
		for(int j = 1;j <= w;j++){
			if(ans > dp[i][j][0][n - 1]){
				ans = dp[i][j][0][n - 1];
			}
		}
	}

	fprintf(g,"%d\n",(ans == inf ? -1:ans));

	return 0;
}

Compilation message

robots.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
robots.cpp: In function 'int main()':
robots.cpp:78:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(f,"%d %d %d\n",&n,&w,&h);
  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
robots.cpp:81:8: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   fgets(C[i] + 1,505,f);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6136 KB Output is correct
2 Correct 8 ms 6248 KB Output is correct
3 Correct 8 ms 6324 KB Output is correct
4 Correct 8 ms 6504 KB Output is correct
5 Correct 10 ms 6504 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6136 KB Output is correct
2 Correct 8 ms 6248 KB Output is correct
3 Correct 8 ms 6324 KB Output is correct
4 Correct 8 ms 6504 KB Output is correct
5 Correct 10 ms 6504 KB Output is correct
6 Correct 8 ms 6504 KB Output is correct
7 Correct 8 ms 6504 KB Output is correct
8 Correct 9 ms 6504 KB Output is correct
9 Correct 9 ms 6504 KB Output is correct
10 Correct 9 ms 6504 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6136 KB Output is correct
2 Correct 8 ms 6248 KB Output is correct
3 Correct 8 ms 6324 KB Output is correct
4 Correct 8 ms 6504 KB Output is correct
5 Correct 10 ms 6504 KB Output is correct
6 Correct 8 ms 6504 KB Output is correct
7 Correct 8 ms 6504 KB Output is correct
8 Correct 9 ms 6504 KB Output is correct
9 Correct 9 ms 6504 KB Output is correct
10 Correct 9 ms 6504 KB Output is correct
11 Correct 321 ms 43704 KB Output is correct
12 Correct 67 ms 43704 KB Output is correct
13 Correct 133 ms 43704 KB Output is correct
14 Correct 543 ms 48892 KB Output is correct
15 Correct 258 ms 48892 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6136 KB Output is correct
2 Correct 8 ms 6248 KB Output is correct
3 Correct 8 ms 6324 KB Output is correct
4 Correct 8 ms 6504 KB Output is correct
5 Correct 10 ms 6504 KB Output is correct
6 Correct 8 ms 6504 KB Output is correct
7 Correct 8 ms 6504 KB Output is correct
8 Correct 9 ms 6504 KB Output is correct
9 Correct 9 ms 6504 KB Output is correct
10 Correct 9 ms 6504 KB Output is correct
11 Correct 321 ms 43704 KB Output is correct
12 Correct 67 ms 43704 KB Output is correct
13 Correct 133 ms 43704 KB Output is correct
14 Correct 543 ms 48892 KB Output is correct
15 Correct 258 ms 48892 KB Output is correct
16 Correct 565 ms 94720 KB Output is correct
17 Execution timed out 1583 ms 124816 KB Time limit exceeded
18 Halted 0 ms 0 KB -