oj.uz

Submission #919862

# Submission time Handle Problem Language Result Execution time Memory
919862 2024-02-01T18:24:24 Z phamducminh Zoo (COCI19_zoo) C++17
110 / 110
 48 ms 22108 KB 
//******************/
//*   I<3   C++    */
//*  I WANT ANY AC */
//* I LOVE PROGRAM!*/
//*IT'S INTERESTING*/
//* I LOVE PROGRAM!*/
//*  IN CONTESTS   */
//*   GET SCORE    */
//*    AC CODE     */
//*     LET'S      */
//*      GO        */
//*  Written by:   */
//*   Duc Minh     */
 
 
 
 
 
 
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <string>
#include <queue>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <deque>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
 
#define  file(name)  freopen(name".inp", "r", stdin);\
                     freopen(name".out", "w", stdout);
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        (1.0 * clock() / CLOCKS_PER_SEC)
#define all(a)      a.begin(),a.end()
#define endl        "\n"
#define all1(a)     a+1,a+n+1
#define unordered_map  map
// #define push_back   emplace_back
// #define gcd(a,b)    __gcd(a,b);
// #define lcm(a,b)    (a*b)/gcd(a,b);
 
const long long INF = (long long)1e9;
const long long MOD = (long long)1e9+7;
const long long MODD = 1e9; /// 998244353
const long long maxN = 2e5+9;
 
 
 
 
 
 
///--------------------------------
 
 
void solve();
 
signed main(){
 
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);



    // file("dance");
 
 
 
 
 
 
 
    long long t;
 
 
    // cin >> t;
 
    t=1;
 
 
 
    while (t--){
 
 
 
 
        solve();
 
 
    }
 
 
 
 
 
    cerr << "Time elapsed: " << TIME << "s.\n";
    cerr << "ducminh" << "\n";
    return 0;
}
 
 
 
///--------------------[PROBLEM SOLUTION]--------------------///
 


char a[2009][2009];
int dp[2009][2009],ans=-INF;
int n,m;

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

long long truoc[200009],luu[200009],fi[200009],las[200009],dep[200009],d=0;

bool valid(int x, int y){
    if (x<1 || y<1 || x>n || y>m || a[x][y]=='*') return false;
    return true;
}


void solve(){
    

    cin >> n >> m;

    memset(dp, 0x3f, sizeof dp);
    dp[1][1]=1;

    for (int i=1; i<=n; i++){
        for (int j=1; j<=m; j++){
            cin >> a[i][j];
        }
    }



    deque<pair<int,int>> q;

    q.push_front({1,1});

    while (q.empty()==false){
        int x=q.front().first, y=q.front().second; // du=q.front().second;
        q.pop_front();


        for (int k=0; k<4; k++){
            int xx=x+dx[k];
            int yy=y+dy[k];

            if (!valid(xx,yy)) continue;

            int cost=(a[xx][yy]!=a[x][y]?1:0);
            if (dp[xx][yy]>dp[x][y]+cost){
                dp[xx][yy]=dp[x][y]+cost;

                if (cost) q.push_back({xx,yy});
                else q.push_front({xx,yy});
            } 
        }
    }


    for (int i=1; i<=n; i++){
        for (int j=1; j<=m; j++){
            if (!valid(i,j)) continue;
            ans=max(ans,dp[i][j]);
        }
    }

    cout << ans;
}

Subtask #1
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18776 KB Output is correct
2 Correct 4 ms 18780 KB Output is correct
3 Correct 4 ms 18776 KB Output is correct
4 Correct 4 ms 18780 KB Output is correct
5 Correct 4 ms 18776 KB Output is correct
6 Correct 5 ms 18780 KB Output is correct
7 Correct 4 ms 18776 KB Output is correct
8 Correct 4 ms 18780 KB Output is correct
9 Correct 4 ms 18776 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18776 KB Output is correct
12 Correct 4 ms 18776 KB Output is correct
13 Correct 4 ms 18776 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 4 ms 18780 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18776 KB Output is correct
2 Correct 4 ms 18780 KB Output is correct
3 Correct 4 ms 18776 KB Output is correct
4 Correct 4 ms 18780 KB Output is correct
5 Correct 4 ms 18776 KB Output is correct
6 Correct 5 ms 18780 KB Output is correct
7 Correct 4 ms 18776 KB Output is correct
8 Correct 4 ms 18780 KB Output is correct
9 Correct 4 ms 18776 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18776 KB Output is correct
12 Correct 4 ms 18776 KB Output is correct
13 Correct 4 ms 18776 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 4 ms 18780 KB Output is correct
16 Correct 17 ms 21848 KB Output is correct
17 Correct 17 ms 21848 KB Output is correct
18 Correct 18 ms 21848 KB Output is correct
19 Correct 19 ms 21852 KB Output is correct
20 Correct 18 ms 21984 KB Output is correct
21 Correct 47 ms 21848 KB Output is correct
22 Correct 47 ms 21892 KB Output is correct
23 Correct 45 ms 21848 KB Output is correct
24 Correct 46 ms 21868 KB Output is correct
25 Correct 48 ms 21848 KB Output is correct
26 Correct 48 ms 21848 KB Output is correct
27 Correct 44 ms 21900 KB Output is correct
28 Correct 48 ms 22108 KB Output is correct
29 Correct 48 ms 21936 KB Output is correct
30 Correct 45 ms 21848 KB Output is correct