oj.uz

Submission #992950

# Submission time Handle Problem Language Result Execution time Memory
992950 2024-06-05T08:32:29 Z vivkostov Red-blue table (IZhO19_stones) C++14
38 / 100
 24 ms 2136 KB 
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

struct cell
{
    int br,in;
};
bool cmp(cell a1,cell a2)
{
    return a1.br<a2.br;
}
int t,n,m,h;
char a1,a2;
string s[1005];
cell a[1005];
void print(int br)
{
    cout<<br<<endl;
    if(h)
    {
        for(int i=1; i<=m; i++)
        {
            for(int j=1; j<=n; j++)
            {
                cout<<s[j][i-1];
            }
            cout<<endl;
        }
        return;
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            cout<<s[i][j-1];
        }
        cout<<endl;
    }
}
void fil(int i)
{
    for(int j=1;j<=m;j++)s[i]+=a1;
}
void prea2()
{
    int gr=(((m-1)/2)*n)/(n/2+1);
    for(int i=m-gr+1;i<=m;i++)
    {
        a[i].in=i;
    }
}
void fila2(int i)
{
    int gr=(((m-1)/2)*n)/(n/2+1);
    sort(a+m-gr+1,a+m+1,cmp);
    for(int j=1;j<=(m-1)/2;j++)
    {
        //cout<<a[m-gr+j].in<<" ";
        s[i][a[m-gr+j].in-1]=a2;
        a[m-gr+j].br++;
    }
    //cout<<endl;
}
void old()
{
    int br=0;
    if(false);
    else
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m/2+1; j++)
            {
                s[i]+=a1;
            }
            for(int j=m/2+2; j<=m; j++)
            {
                s[i]+=a2;
            }
            br++;
        }
        br+=(m-1)/2;
    }
    print(br);
}
void resheven()
{
    prea2();
    if(n<=4||m<=4)
    {
        old();
        return;
    }
    int br=n+(((m-1)/2)*n)/(n/2+1),pos=m,gr=(((m-1)/2)*n)/(n/2+1);
    //cout<<(((m-1)/2)*n)/(n/2+1)<<" "<<br<<endl;
    for(int i=1;i<=n;i++)
    {
        fil(i);
        fila2(i);
        pos--;
        if(pos<=m-gr)pos=m;
    }
    print(br);
}
void resh()
{
    int br=0;
    for(int i=1; i<=(n-1)/2; i++)
    {
        for(int j=1; j<=m/2+1; j++)
        {
            s[i]+=a1;
        }
        for(int j=m/2+2; j<=m; j++)
        {
            s[i]+=a2;
        }
        br++;
    }
    for(int i=(n-1)/2+1; i<=n-1; i++)
    {
        for(int j=1; j<=(m-1)/2; j++)
        {
            s[i]+=a2;
        }
        for(int j=(m-1)/2+1; j<=m; j++)
        {
            s[i]+=a1;
        }
        br++;
    }
    if(m>2)
    {
        for(int i=1; i<=m; i++)
        {
            s[n]+=a2;
        }
        br+=((m-1)/2)*2;
    }
    else
    {
        for(int i=1; i<=m; i++)
        {
            s[n]+=a1;
        }
        br++;
    }
    print(br);
}
void read()
{
    cin>>t;
    for(int z=1; z<=t; z++)
    {
        cin>>n>>m;
        if(n<m)
        {

            swap(n,m);
            a1='-';
            a2='+';
            h=1;
        }
        else
        {
            a1='+';
            a2='-';
        }
        if(n%2==0)resheven();
        else resh();
        h=0;
        for(int i=1; i<=n; i++)s[i].clear();
    }
}
int main()
{
    speed();
    read();
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB in the table A+B is not equal to 11
5 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1368 KB Output is correct
2 Correct 20 ms 2128 KB Output is correct
3 Correct 17 ms 2136 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1360 KB in the table A+B is not equal to 132
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB in the table A+B is not equal to 11
5 Halted 0 ms 0 KB -