Submission #909952

#	Time	Username	Problem	Language	Result	Execution time	Memory
909952		bachhoangxuan	JOI 문장 (JOI14_ho_t1)	C++17	100 / 100	48 ms	2540 KiB

2014_ho_t1

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m;
string s[maxn];
string c[2];

void solve(){
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> s[i];
    cin >> c[0] >> c[1];
    auto cal = [&](int x,int y){
        for(int i=0;i<2;i++) for(int j=0;j<2;j++) if(c[i][j]!=s[x+i][y+j]) return 0;
        return 1;
    };
    int Max=0,res=0;
    for(int i=0;i<n-1;i++) for(int j=0;j<m-1;j++) res+=cal(i,j);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int cnt=0;
            char cc=s[i][j];
            if(i<n-1 && j<m-1) cnt+=cal(i,j);
            if(i && j<m-1) cnt+=cal(i-1,j);
            if(i<n-1 && j) cnt+=cal(i,j-1);
            if(i && j) cnt+=cal(i-1,j-1);

            int d=0;s[i][j]='J';
            if(i<n-1 && j<m-1) d+=cal(i,j);
            if(i && j<m-1) d+=cal(i-1,j);
            if(i<n-1 && j) d+=cal(i,j-1);
            if(i && j) d+=cal(i-1,j-1);
            Max=max(Max,d-cnt);

            d=0;s[i][j]='O';
            if(i<n-1 && j<m-1) d+=cal(i,j);
            if(i && j<m-1) d+=cal(i-1,j);
            if(i<n-1 && j) d+=cal(i,j-1);
            if(i && j) d+=cal(i-1,j-1);
            Max=max(Max,d-cnt);

            d=0;s[i][j]='I';
            if(i<n-1 && j<m-1) d+=cal(i,j);
            if(i && j<m-1) d+=cal(i-1,j);
            if(i<n-1 && j) d+=cal(i,j-1);
            if(i && j) d+=cal(i-1,j-1);
            Max=max(Max,d-cnt);

            s[i][j]=cc;
        }
    }
    cout << res+Max << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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