oj.uz

Submission #912867

# Submission time Handle Problem Language Result Execution time Memory
912867 2024-01-20T03:39:39 Z bachhoangxuan Sandwich (JOI16_sandwich) C++17
100 / 100
 1168 ms 16736 KB 
// 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=405;
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,cnt;
int c[maxn][maxn],vis[maxn][maxn],check[maxn][maxn],ans[maxn][maxn];

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

bool dfs(int x,int y,int t){
    cnt++;
    vis[x][y]=t;
    for(int i=0;i<2;i++){
        int k=(i?(1<<i)+(t^c[x][y]):t);
        int xt=x+dx[k],yt=y+dy[k];
        if(xt<=0 || yt<=0 || xt>n || yt>m) continue;
        int nt=(i?(c[x][y]^c[xt][yt]^t):t);
        if(vis[xt][yt]==nt){
            if(check[xt][yt]) continue;
            return false;
        }
        if(vis[xt][yt]==(nt^1)) return false;
        if(!dfs(xt,yt,nt)) return false;
    }
    check[x][y]=1;
    return true;
}

void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char cc;cin >> cc;
            c[i][j]=(cc=='Z');
        }
    }
    memset(ans,-1,sizeof(ans));
    for(int i=1;i<=n;i++){
        cnt=0;
        memset(vis,-1,sizeof(vis));
        memset(check,0,sizeof(check));
        for(int j=1;j<=m;j++){
            if(dfs(i,j,0)) ans[i][j]=(ans[i][j]==-1?2*cnt:min(ans[i][j],2*cnt));
            else break;
        }
    }
    for(int i=1;i<=n;i++){
        cnt=0;
        memset(vis,-1,sizeof(vis));
        memset(check,0,sizeof(check));
        for(int j=m;j>=1;j--){
            if(dfs(i,j,1)) ans[i][j]=(ans[i][j]==-1?2*cnt:min(ans[i][j],2*cnt));
            else break;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++) cout << ans[i][j] << ' ';
        cout << '\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
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 5 ms 4700 KB Output is correct
4 Correct 2 ms 4568 KB Output is correct
5 Correct 6 ms 4700 KB Output is correct
6 Correct 6 ms 4700 KB Output is correct
7 Correct 7 ms 4700 KB Output is correct
8 Correct 6 ms 4700 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 7 ms 4756 KB Output is correct
11 Correct 7 ms 4700 KB Output is correct
12 Correct 4 ms 4700 KB Output is correct
13 Correct 7 ms 4700 KB Output is correct
14 Correct 9 ms 4700 KB Output is correct
15 Correct 8 ms 4700 KB Output is correct
16 Correct 7 ms 4700 KB Output is correct
17 Correct 8 ms 4752 KB Output is correct
18 Correct 7 ms 4816 KB Output is correct
19 Correct 6 ms 4700 KB Output is correct
20 Correct 7 ms 4700 KB Output is correct
21 Correct 6 ms 4752 KB Output is correct
22 Correct 6 ms 4700 KB Output is correct
23 Correct 6 ms 4700 KB Output is correct
24 Correct 9 ms 4952 KB Output is correct
25 Correct 9 ms 4700 KB Output is correct
26 Correct 8 ms 4700 KB Output is correct
27 Correct 7 ms 4900 KB Output is correct
28 Correct 7 ms 5076 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 5 ms 4700 KB Output is correct
4 Correct 2 ms 4568 KB Output is correct
5 Correct 6 ms 4700 KB Output is correct
6 Correct 6 ms 4700 KB Output is correct
7 Correct 7 ms 4700 KB Output is correct
8 Correct 6 ms 4700 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 7 ms 4756 KB Output is correct
11 Correct 7 ms 4700 KB Output is correct
12 Correct 4 ms 4700 KB Output is correct
13 Correct 7 ms 4700 KB Output is correct
14 Correct 9 ms 4700 KB Output is correct
15 Correct 8 ms 4700 KB Output is correct
16 Correct 7 ms 4700 KB Output is correct
17 Correct 8 ms 4752 KB Output is correct
18 Correct 7 ms 4816 KB Output is correct
19 Correct 6 ms 4700 KB Output is correct
20 Correct 7 ms 4700 KB Output is correct
21 Correct 6 ms 4752 KB Output is correct
22 Correct 6 ms 4700 KB Output is correct
23 Correct 6 ms 4700 KB Output is correct
24 Correct 9 ms 4952 KB Output is correct
25 Correct 9 ms 4700 KB Output is correct
26 Correct 8 ms 4700 KB Output is correct
27 Correct 7 ms 4900 KB Output is correct
28 Correct 7 ms 5076 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 33 ms 5624 KB Output is correct
31 Correct 47 ms 6180 KB Output is correct
32 Correct 48 ms 6228 KB Output is correct
33 Correct 37 ms 5588 KB Output is correct
34 Correct 764 ms 6516 KB Output is correct
35 Correct 470 ms 6048 KB Output is correct
36 Correct 43 ms 5468 KB Output is correct
37 Correct 743 ms 6552 KB Output is correct
38 Correct 477 ms 6524 KB Output is correct
39 Correct 743 ms 6528 KB Output is correct
40 Correct 934 ms 6840 KB Output is correct
41 Correct 315 ms 5792 KB Output is correct
42 Correct 929 ms 6992 KB Output is correct
43 Correct 970 ms 7040 KB Output is correct
44 Correct 907 ms 6920 KB Output is correct
45 Correct 684 ms 6508 KB Output is correct
46 Correct 494 ms 6512 KB Output is correct
47 Correct 627 ms 6512 KB Output is correct
48 Correct 391 ms 6188 KB Output is correct
49 Correct 497 ms 6540 KB Output is correct
50 Correct 562 ms 6524 KB Output is correct
51 Correct 496 ms 6440 KB Output is correct
52 Correct 447 ms 6484 KB Output is correct
53 Correct 478 ms 6512 KB Output is correct
54 Correct 470 ms 6504 KB Output is correct
55 Correct 495 ms 6512 KB Output is correct
56 Correct 506 ms 6484 KB Output is correct
57 Correct 401 ms 6380 KB Output is correct
58 Correct 921 ms 6860 KB Output is correct
59 Correct 889 ms 6868 KB Output is correct
60 Correct 600 ms 6396 KB Output is correct
61 Correct 896 ms 6824 KB Output is correct
62 Correct 1012 ms 16476 KB Output is correct
63 Correct 1168 ms 16736 KB Output is correct