oj.uz

Submission #654595

# Submission time Handle Problem Language Result Execution time Memory
654595 2022-10-31T19:51:46 Z Mohammad_Parsa T-Covering (eJOI19_covering) C++14
100 / 100
 138 ms 57572 KB 
/* in the name of allah */
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pb push_back
#define F first
#define S second
#define mk make_pair
#define int long long
 
const int N=2e3+7;
int mn,t,M,ty,x[N*N],y[N*N];
vector<int> z[N],a[N],b[N],yek[N],vis[N];
int dx[4]={-2,2,0,0},xd[4]={-1,1,0,0};
int dy[4]={0,0,-2,2},yd[4]={0,0,-1,1};
 
int sumz(int x,int y){
    int ans=0;
    for(int i=-1;i<=1;i++)
        for(int j=-1;j<=1;j++)
            ans+=z[x+i][y+j];
    return ans;
}
 
void dfs(int x,int y){
    vis[x][y]=1;M++;ty+=yek[x][y];
    b[x][y]=1;
    for(int i=0;i<4;i++){
        int p=x+dx[i],q=y+dy[i];
        if(p>=0 && q>=0 && z[p][q]){
			t++;
			if(!vis[p][q]) dfs(p,q);
		}
		if(x+xd[i]>=0 && y+yd[i]>=0) mn=min(mn,a[x+xd[i]][y+yd[i]]),b[x+xd[i]][y+yd[i]]=1;
    }
}
 
int32_t main(){
    ios:: sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int n,m;
    cin>>n>>m;
	int g=0;
	if(n>m) g=1,swap(n,m);
	for(int i=0;i<=n+5;i++){
		a[i].resize(m+5);
		b[i].resize(m+5);
		z[i].resize(m+5);
		vis[i].resize(m+5);
		yek[i].resize(m+5);
		for(int j=0;j<m+5;j++){
			a[i][j]=1007;
		}
	}
	if(g) swap(n,m);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
			if(g) swap(i,j);
            cin>>a[i][j];
			if(g) swap(i,j);
        }
    }
    int k;
    cin>>k;
    for(int i=0;i<k;i++){
        cin>>x[i]>>y[i];x[i]++;y[i]++;
		if(g) swap(x[i],y[i]);
        z[x[i]][y[i]]=1;
    }
    if(g) swap(n,m);
    int f=0;
    for(int i=0;i<k;i++){
        if((x[i]==1 && y[i]==1) || (x[i]==n && y[i]==1) || (x[i]==1 && y[i]==m) || (x[i]==n && y[i]==m)){
            if(sumz(x[i],y[i])>0) f=1;
        }
        else if(x[i]==1 || x[i]==n || y[i]==1 || y[i]==m){
            if(sumz(x[i],y[i])>1) f=1;
        }
        else{
            if(sumz(x[i],y[i])>2) f=1;
        }
    }
 
    int ans=0;
    
    for(int i=0;i<k;i++){
        int p=x[i],q=y[i];
        if(p==1 || p==n || q==1 || q==m){
            b[p][q]=b[p-1][q]=b[p+1][q]=b[p][q-1]=b[p][q+1]=1;
            yek[p][q]=1;
        }
        else if(sumz(p,q)==2){
            b[p][q]=b[p-1][q]=b[p+1][q]=b[p][q-1]=b[p][q+1]=1;
            yek[p][q]=1;
        }
    }
 
 
    for(int i=0;i<k;i++){
        if(!vis[x[i]][y[i]]){
            mn=1e9;t=0;M=0;ty=0;
            dfs(x[i],y[i]);
            t/=2;
            //cout<<M<<" "<<t<<endl;
            if(ty>1) f=1;
            if(t>M) f=1;
            if(t==M && ty==1) f=1;
            if(t==M-1 && ty==0) ans-=mn;
        }
    }
 
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            ans+=b[i][j]*a[i][j];
        }
    }
    if(n==1 || m==1) f=1;
 
    if(f){
        cout<<"No";
        return 0;
    }
    cout<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 3 ms 1748 KB Output is correct
3 Correct 8 ms 4564 KB Output is correct
4 Correct 26 ms 13312 KB Output is correct
5 Correct 83 ms 41632 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 4 ms 1748 KB Output is correct
3 Correct 9 ms 4564 KB Output is correct
4 Correct 28 ms 13184 KB Output is correct
5 Correct 81 ms 41728 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 3 ms 1748 KB Output is correct
3 Correct 13 ms 4564 KB Output is correct
4 Correct 27 ms 13308 KB Output is correct
5 Correct 92 ms 41640 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 5 ms 3708 KB Output is correct
4 Correct 5 ms 2388 KB Output is correct
5 Correct 11 ms 6820 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 556 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 3 ms 1748 KB Output is correct
3 Correct 8 ms 4564 KB Output is correct
4 Correct 26 ms 13312 KB Output is correct
5 Correct 83 ms 41632 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 9 ms 4564 KB Output is correct
9 Correct 28 ms 13184 KB Output is correct
10 Correct 81 ms 41728 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 13 ms 4564 KB Output is correct
14 Correct 27 ms 13308 KB Output is correct
15 Correct 92 ms 41640 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 5 ms 3708 KB Output is correct
19 Correct 5 ms 2388 KB Output is correct
20 Correct 11 ms 6820 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 3 ms 1860 KB Output is correct
23 Correct 9 ms 5036 KB Output is correct
24 Correct 26 ms 13252 KB Output is correct
25 Correct 92 ms 40924 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 3 ms 1748 KB Output is correct
3 Correct 8 ms 4564 KB Output is correct
4 Correct 26 ms 13312 KB Output is correct
5 Correct 83 ms 41632 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 4 ms 1748 KB Output is correct
8 Correct 9 ms 4564 KB Output is correct
9 Correct 28 ms 13184 KB Output is correct
10 Correct 81 ms 41728 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 3 ms 1748 KB Output is correct
13 Correct 13 ms 4564 KB Output is correct
14 Correct 27 ms 13308 KB Output is correct
15 Correct 92 ms 41640 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 5 ms 3708 KB Output is correct
19 Correct 5 ms 2388 KB Output is correct
20 Correct 11 ms 6820 KB Output is correct
21 Correct 1 ms 556 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 3 ms 1860 KB Output is correct
28 Correct 9 ms 5036 KB Output is correct
29 Correct 26 ms 13252 KB Output is correct
30 Correct 92 ms 40924 KB Output is correct
31 Correct 138 ms 57572 KB Output is correct
32 Correct 91 ms 42444 KB Output is correct
33 Correct 81 ms 46708 KB Output is correct
34 Correct 81 ms 44748 KB Output is correct
35 Correct 105 ms 47668 KB Output is correct