oj.uz

답안 #857002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857002 2023-10-05T07:45:54 Z alexdd Gardening (RMI21_gardening) C++17
5 / 100
 21 ms 12636 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> mat[200005];
int color;
bool verif(int n, int m, int k)
{
    if(n%2==1 || m%2==1)
        return 0;
    if(k > n*m/4)
        return 0;
    if(k < max(n,m)/2)
        return 0;
    if(k == n*m/4 - 1)
        return 0;
    if(k == max(n,m)/2 + 1)
        return 0;
    return 1;
}
void solve(int coltx, int colty, int n, int m, int k)
{
    if(n==0 || m==0)
        return;
    //cout<<coltx<<" "<<colty<<"   "<<n<<" "<<m<<"  "<<k<<"\n";
    if(n==2 && m==2)
    {
        color++;
        mat[coltx][colty]=color;
        mat[coltx][colty+1]=color;
        mat[coltx+1][colty]=color;
        mat[coltx+1][colty+1]=color;
        return;
    }
    if(n>2 && m>2 && verif(n-2,m-2,k-1))
    {
        color++;
        for(int i=0;i<m;i++)
        {
            mat[coltx][colty+i]=color;
            mat[coltx+n-1][colty+i]=color;
        }
        for(int i=0;i<n;i++)
        {
            mat[coltx+i][colty]=color;
            mat[coltx+i][colty+m-1]=color;
        }
        solve(coltx+1,colty+1,n-2,m-2,k-1);
        return;
    }
    if(verif((n/4)*2,m,k/2) && verif(n-(n/4)*2,m,k-k/2))
    {
        solve(coltx, colty, (n/4)*2, m, k/2);
        solve(coltx+(n/4)*2, colty, n-(n/4)*2, m, k-k/2);
        return;
    }
    if(verif(n,(m/4)*2,k/2) && verif(n,m-(m/4)*2,k-k/2))
    {
        solve(coltx,colty,n,(m/4)*2,k/2);
        solve(coltx,colty+(m/4)*2,n,m-(m/4)*2,k-k/2);
        return;
    }
    for(int i=2;i<=n-2;i+=2)
    {
        for(int kst=1;kst<k;kst++)
        {
            if(verif(i,m,kst) && verif(n-i,m,k-kst))
            {
                solve(coltx,colty,i,m,kst);
                solve(coltx+i,colty,n-i,m,k-kst);
                return;
            }
        }
    }
    for(int i=2;i<=m-2;i+=2)
    {
        for(int kst=1;kst<k;kst++)
        {
            if(verif(n,i,kst) && verif(n,m-i,k-kst))
            {
                solve(coltx,colty,n,i,kst);
                solve(coltx,colty+i,n,m-i,k-kst);
                return;
            }
        }
    }
    assert(1==0);
    while(1)
        n=0;
    //cout<<-1<<" zzz\n";
    return;
}
int cv[10];
int processed[200005];
bool visited[10][200005];
void dfs(int x, int y, int c, int n, int m)
{
    if(x<1 || x>n || y<1 || y>m)
        return;
    int i=x,j=y;
    if(mat[i][j]!=c || visited[i][j])
        return;
    visited[i][j]=1;
    dfs(i,j-1,c,n,m);
    dfs(i,j+1,c,n,m);
    dfs(i-1,j,c,n,m);
    dfs(i+1,j,c,n,m);
}
void check(int n, int m, int k)
{
    if(color!=k)
    {
        cout<<"k is not good\n";
    }
    for(int i=1;i<=k;i++)
        processed[i]=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            visited[i][j]=0;
            int cnt=0;
            if(i>1)cv[cnt++]=mat[i-1][j];
            if(i<n)cv[cnt++]=mat[i+1][j];
            if(j>1)cv[cnt++]=mat[i][j-1];
            if(j<m)cv[cnt++]=mat[i][j+1];
            if((cnt>=3 && cv[0]==cv[1] && cv[1]==cv[2]) || (cnt>=4 && cv[1]==cv[2] && cv[2]==cv[3]))
            {
                cout<<"too many same color neighbours\n";
            }
            if((cnt<2 || cv[0]!=cv[1]) && (cnt<3 && cv[1]!=cv[2]) && (cnt<4 || cv[2]!=cv[3]))
            {
                cout<<"too few same color neighbours\n";
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(!visited[i][j])
            {
                if(processed[mat[i][j]])
                {
                    cout<<"color isn't connected  zzzzzzzzzzzzz\n";
                }
                processed[mat[i][j]]=1;
                dfs(i,j,mat[i][j],n,m);
            }
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t,n,m,k;
    cin>>t;
    while(t--)
    {
        cin>>n>>m>>k;
        if(!verif(n,m,k))
        {
            cout<<"NO\n";
        }
        else
        {
            cout<<"YES\n";
            for(int i=1;i<=n;i++)
                mat[i].resize(m+2);
            color=0;
            solve(1,1,n,m,k);
            //check(n,m,k);
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=m;j++)cout<<mat[i][j]<<" ";cout<<"\n";
                mat[i].clear();
            }
        }
    }
    return 0;
}
/**
1
22 22 12
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:174:17: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  174 |                 for(int j=1;j<=m;j++)cout<<mat[i][j]<<" ";cout<<"\n";
      |                 ^~~
Main.cpp:174:59: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  174 |                 for(int j=1;j<=m;j++)cout<<mat[i][j]<<" ";cout<<"\n";
      |                                                           ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 6744 KB Correct! Azusa and Laika like the garden :)

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 6744 KB Correct! Azusa and Laika like the garden :)
2 Failed 8 ms 6492 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 6744 KB Correct! Azusa and Laika like the garden :)
2 Failed 8 ms 6492 KB Incorrect output
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 12632 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 12636 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 6744 KB Correct! Azusa and Laika like the garden :)
2 Failed 8 ms 6492 KB Incorrect output
3 Halted 0 ms 0 KB -