oj.uz

답안 #728900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728900 2023-04-23T08:56:02 Z shadow_sami Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 973 ms 251980 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 4000+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll dx[4] = {0,1,0,-1};
ll dy[4] = {1,0,-1,0};
deque<pi> dq;
char a[mx][mx];
ll tnc[mx][mx];

bool meow(ll x,ll y){
	if(x < 0 || x >= n)
		return 0;
	if(y < 0 || y >= m)
		return 0;
	if(a[x][y] == '.')
		return 0;
	return 1;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        fip(0,n)
        	fjp(0,m)
        		cin>>a[i][j];
        memset(tnc,0ll,sizeof(tnc));
        dq.push_front({0,0});
        ans = 0;
        tnc[0][0] = 1;
        while(dq.size()){
        	auto it = dq.front();
        	dq.pop_front();
        	ans = max(ans,tnc[it.ff][it.ss]);
        	fip(0,4){
        		ll x = it.ff + dx[i];
        		ll y = it.ss + dy[i];
        		if(meow(x,y) && tnc[x][y]==0){
        			if(a[x][y]==a[it.ff][it.ss]){
        				tnc[x][y] = tnc[it.ff][it.ss];
        				dq.push_front({x,y});
        			}else{
        				tnc[x][y] = tnc[it.ff][it.ss] + 1;
        				dq.push_back({x,y});
        			}        			
        		}
        	}
        }
        cout<<ans<<nli;
        
    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 128124 KB Output is correct
2 Correct 51 ms 125900 KB Output is correct
3 Correct 58 ms 126020 KB Output is correct
4 Correct 61 ms 128424 KB Output is correct
5 Correct 56 ms 127032 KB Output is correct
6 Correct 57 ms 125832 KB Output is correct
7 Correct 60 ms 125964 KB Output is correct
8 Correct 52 ms 126032 KB Output is correct
9 Correct 49 ms 126284 KB Output is correct
10 Correct 55 ms 126820 KB Output is correct
11 Correct 55 ms 126720 KB Output is correct
12 Correct 59 ms 127044 KB Output is correct
13 Correct 66 ms 127052 KB Output is correct
14 Correct 63 ms 127100 KB Output is correct
15 Correct 70 ms 128020 KB Output is correct
16 Correct 62 ms 128076 KB Output is correct
17 Correct 62 ms 127892 KB Output is correct
18 Correct 57 ms 128372 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 140868 KB Output is correct
2 Correct 115 ms 132280 KB Output is correct
3 Correct 357 ms 157184 KB Output is correct
4 Correct 146 ms 136932 KB Output is correct
5 Correct 263 ms 146524 KB Output is correct
6 Correct 973 ms 185900 KB Output is correct
7 Correct 60 ms 141516 KB Output is correct
8 Correct 64 ms 140768 KB Output is correct
9 Correct 64 ms 125932 KB Output is correct
10 Correct 54 ms 125828 KB Output is correct
11 Correct 58 ms 141292 KB Output is correct
12 Correct 54 ms 126460 KB Output is correct
13 Correct 103 ms 132272 KB Output is correct
14 Correct 82 ms 130344 KB Output is correct
15 Correct 83 ms 130640 KB Output is correct
16 Correct 70 ms 128076 KB Output is correct
17 Correct 168 ms 137776 KB Output is correct
18 Correct 168 ms 137732 KB Output is correct
19 Correct 146 ms 136856 KB Output is correct
20 Correct 129 ms 136220 KB Output is correct
21 Correct 250 ms 147020 KB Output is correct
22 Correct 253 ms 146420 KB Output is correct
23 Correct 287 ms 143236 KB Output is correct
24 Correct 258 ms 146888 KB Output is correct
25 Correct 632 ms 157244 KB Output is correct
26 Correct 893 ms 251980 KB Output is correct
27 Correct 901 ms 208496 KB Output is correct
28 Correct 827 ms 186148 KB Output is correct
29 Correct 834 ms 180496 KB Output is correct
30 Correct 848 ms 193936 KB Output is correct
31 Correct 555 ms 149192 KB Output is correct
32 Correct 908 ms 205332 KB Output is correct