Submission #777430

#	Time	Username	Problem	Language	Result	Execution time	Memory
777430		OrazB	Tracks in the Snow (BOI13_tracks)	C++17	2.19 / 100	2070 ms	35044 KiB

tracks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int X[] = {-1, 1, 0, 0};
int Y[] = {0, 0, -1, 1};

void calc(char ch, int x, int y, vector<vector<bool>>&vis, vector<vector<char>> c, int n, int m){
	queue<pii> q; q.push({x, y});
	while(!q.empty()){
		int x = q.front().ff, y = q.front().ss;
		q.pop();
		if (vis[x][y]) continue;
		vis[x][y] = 1;
		for (int i = 0; i < 4; i++){
			int a = x+X[i], b = y+Y[i];
			if (a > 0 and b > 0 and a <= n and b <= m and c[a][b] == ch and !vis[a][b]){
				q.push({a, b});
			}
		}
	}
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<vector<char>> c(n+1, vector<char>(m+1));
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++) cin >> c[i][j];
	}
	int ans = 0;
	vector<vector<bool>> vis(n+1, vector<bool>(m+1, 0));
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			if (vis[i][j] or c[i][j] == '.') continue;
			ans++;
			calc(c[i][j], i, j, vis, c, n, m);
		}
	}
	int x = (ans+1)/2;
	cout << x << '\n';
}	

• Subtask 1: 0 / 30
• Subtask 2: 2.1875 / 70