oj.uz

Submission #1002020

# Submission time Handle Problem Language Result Execution time Memory
1002020 2024-06-19T09:17:40 Z vjudge1 Robots (APIO13_robots) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;
using ll  =  long long;

#ifdef U_U
#include "algo/debug.h"
#else
#define deb(x...) 42
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define szof(x) (int)x.size()
#define int ll
#define love bool

template<class T> void MIN(T& a, const T b) { b < a ? a = b, 1 : 0; }
template<class T> void MAX(T& a, const T b) { a < b ? a = b, 1 : 0; }

const int mod = 1e9 + 7;
const int N = 2e5 + 5;
const int inf = 2147483647;
const int INF = 9223372036854775807;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
// Follow the white rabbit.

int n, w, h;
char e[505][505];
int dist[505][505];
bool check (int i, int j) {
	if (i > h || i < 1 || j > w || j < 1 || e[i][j] == 'x') return 0;
	return 1;
}
void ka () {
	cin >> n >> w >> h;
	vector <pair <int, int> > v;
	for (int i = 1; i <= h; i ++) {
		for (int j = 1; j <= w; j ++) {
			cin >> e[i][j];
			if (e[i][j] >= '1' && e[i][j] <= '9') v.pb({i, j});
		}
	}
	int ans = inf;
	for (int i = 1; i <= h; i ++) {
		int j = 1;
		queue <pair <int, int> > q;
		q.push({i, j});
		for (int I = 1; I <= h; I ++) for (int J = 1; J <= w; J ++) dist[I][J] = inf;
		dist[i][j] = 0;
		while (szof(q)) {
			pair <int, int> tmp = q.front();
			q.pop();
			for (int k = 0; k < 4; k ++) {
				int x = tmp.first, y = tmp.second;
				bool last = 0;
				while (1) {
					int X = dx[k] + x, Y = dy[k] + y;
					if (!check(X, Y)) {
						if (last) q.push({X, Y});
						break;	
					}
					if (dist[X][Y] > dist[tmp.first][tmp.second] + 1) last = 1;
					else last = 0;
					MIN(dist[X][Y], dist[tmp.first][tmp.second] + 1);
					x = X, y = Y;
				}
			}
		}
		int lol = 0;
		for (pair <int, int> c : v) lol += dist[c.first][c.second];
		MIN(ans, lol);
		j = w;
		q.push({i, j});
		for (int I = 1; I <= h; I ++) for (int J = 1; J <= w; J ++) dist[I][J] = inf;
		dist[i][j] = 0;
		while (szof(q)) {
			pair <int, int> tmp = q.front();
			q.pop();
			for (int k = 0; k < 4; k ++) {
				int x = tmp.first, y = tmp.second;
				bool last = 0;
				while (1) {
					int X = dx[k] + x, Y = dy[k] + y;
					if (!check(X, Y)) {
						if (last) q.push({X, Y});
						break;	
					}
					if (dist[X][Y] > dist[tmp.first][tmp.second] + 1) last = 1;
					else last = 0;
					MIN(dist[X][Y], dist[tmp.first][tmp.second] + 1);
					x = X, y = Y;
				}
			}
		}
		lol = 0;
		for (pair <int, int> c : v) lol += dist[c.first][c.second];
		MIN(ans, lol);
	}
	cout << (ans == inf ? -1 : ans);
}

const bool overflow = 0;

main() {
  //freopen("haircut.in"	, "r", stdin); freopen("haircut.out", "w", stdout);
  cout.setf(ios::fixed);cout.precision(12);
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  int tc = 1; 
  if (overflow) cin >> tc;
  for (int cs = 1; cs <= tc; cs ++) {
		#ifdef U_U
		cout << ":D\n";
		#endif
		ka();
		//if (cs != tc) cout << '\n';
  }
}

Compilation message

robots.cpp:106:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  106 | main() {
      | ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -