Submission #910617

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
910617	2024-01-18T06:23:43 Z	oblantis	Tracks in the Snow (BOI13_tracks)	C++17	97.8125 / 100	770 ms	1048576 KB

tracks

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
const int inf = 1e9 + 10000;
const int mod = 1e9+7;
const int maxn = 4e3 + 12;
char a[maxn][maxn];
bool was[maxn][maxn];
queue<pii> q;
void go(int x, int y, char s){
	if(a[x][y] != s)return;
	q.push({x, y});
	was[x][y] = 1;
	if(!was[x - 1][y])go(x - 1, y, s);
	if(!was[x + 1][y])go(x + 1, y, s);
	if(!was[x][y - 1])go(x, y - 1, s);
	if(!was[x][y + 1])go(x, y + 1, s);	
}
void solve() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		was[i][0] = was[i][m + 1] = 1;
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			if(a[i][j] == '.')was[i][j] = 1;
		}
	}
	for(int i = 1; i <= m; i++)was[0][i] = was[n + 1][i] = 1;
	int ans = 0;
	char s = a[n][m];
	go(n, m, s);
	while(!q.empty()){
		pii nw = q.front();
		q.pop();
		int x = nw.ff, y = nw.ss;
		if(a[x][y] == s){
			ans++, s = (s == 'R' ? 'F' : 'R');
		}
		if(!was[x - 1][y])go(x - 1, y, s);
		if(!was[x + 1][y])go(x + 1, y, s);
		if(!was[x][y - 1])go(x, y - 1, s);
		if(!was[x][y + 1])go(x, y + 1, s);
	}
	cout << ans;
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	7004 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	4700 KB	Output is correct
4	Correct	6 ms	8284 KB	Output is correct
5	Correct	3 ms	6748 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	4700 KB	Output is correct
8	Correct	1 ms	4700 KB	Output is correct
9	Correct	1 ms	4700 KB	Output is correct
10	Correct	3 ms	6744 KB	Output is correct
11	Correct	3 ms	5212 KB	Output is correct
12	Correct	5 ms	6748 KB	Output is correct
13	Correct	3 ms	6744 KB	Output is correct
14	Correct	3 ms	6748 KB	Output is correct
15	Correct	8 ms	6748 KB	Output is correct
16	Correct	10 ms	7004 KB	Output is correct
17	Correct	8 ms	6744 KB	Output is correct
18	Correct	7 ms	8284 KB	Output is correct

Subtask #2

67.8125 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	31580 KB	Output is correct
2	Correct	32 ms	13212 KB	Output is correct
3	Correct	223 ms	32632 KB	Output is correct
4	Correct	61 ms	19348 KB	Output is correct
5	Correct	131 ms	28024 KB	Output is correct
6	Correct	597 ms	137408 KB	Output is correct
7	Correct	7 ms	32092 KB	Output is correct
8	Correct	6 ms	31580 KB	Output is correct
9	Correct	2 ms	2908 KB	Output is correct
10	Correct	1 ms	2908 KB	Output is correct
11	Correct	6 ms	31836 KB	Output is correct
12	Correct	1 ms	4700 KB	Output is correct
13	Correct	31 ms	13148 KB	Output is correct
14	Correct	19 ms	11100 KB	Output is correct
15	Correct	18 ms	10844 KB	Output is correct
16	Correct	16 ms	7000 KB	Output is correct
17	Correct	78 ms	19284 KB	Output is correct
18	Correct	69 ms	19336 KB	Output is correct
19	Correct	59 ms	19284 KB	Output is correct
20	Correct	52 ms	17232 KB	Output is correct
21	Correct	135 ms	27792 KB	Output is correct
22	Correct	122 ms	27988 KB	Output is correct
23	Correct	151 ms	23772 KB	Output is correct
24	Correct	127 ms	27816 KB	Output is correct
25	Correct	279 ms	32660 KB	Output is correct
26	Runtime error	764 ms	1048576 KB	Execution killed with signal 9
27	Correct	743 ms	394180 KB	Output is correct
28	Correct	613 ms	145624 KB	Output is correct
29	Correct	590 ms	136524 KB	Output is correct
30	Correct	650 ms	219984 KB	Output is correct
31	Correct	377 ms	36268 KB	Output is correct
32	Correct	770 ms	474000 KB	Output is correct