Submission #1120291

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120291		vjudge1	Tracks in the Snow (BOI13_tracks)	C++17	2.19 / 100	296 ms	16112 KiB

tracks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define run  ios_base::sync_with_stdio(false);cin.tie(0);
 
#define ll int
#define pll pair<ll, ll>
#define ull unsigned ll
#define ld double
#define endl "\n"
#define pb push_back
#define fi first
#define se second
 
#define pi acos(-1)
#define N 100007
#define minimum -9223372036854775807
#define maximum -minimum
#define mod 1000000007
 
using namespace std;
using namespace __gnu_pbds;
template <class t>
using ordered_set=tree<t, null_type,less_equal<t>, rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll gcd(ll a, ll b)
{
	if(b==0)
		return a;
	return gcd(b, a%b);
}

ll lcm(ll a, ll b)
{
	return a/gcd(a, b)*b;
}

bool isprime(ll n)
{
	if(n==1)
		return 0;
	for(ll i=2; i*i<=n; i++)
	{
		if(n%i==0)
			return 0;
	}
	return 1;
}

ll binpow(ll a, ll b)
{
    a%=mod;
    ll res=1;
    while(b>0)
	{
        if(b%2==1)
            res=(res*a)%mod;
        a=(a*a)%mod;
        b/=2;
    }
    return res;
}

int main()
{
	run;
	ll h, w;
	cin>>h>>w;
	char a[h+1][w+1];
	set<char>st;
	for(ll i=1; i<=h; i++)
	{
		for(ll j=1; j<=w; j++)
		{
			cin>>a[i][j];
			if(a[i][j]!='.')
				st.insert(a[i][j]);
		}
	}
	if(st.size()<2)
		cout<<st.size()<<endl;
	else
	{
		ll k=rng()%2;
		if(k==0)
			cout<<st.size()<<endl;
		else
			cout<<st.size()+1<<endl;
	}
}
/*



12521
*/
// By Xanlar

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