oj.uz

Submission #684533

# Submission time Handle Problem Language Result Execution time Memory
684533 2023-01-21T14:01:26 Z NintsiChkhaidze Red-blue table (IZhO19_stones) C++14
69 / 100
 47 ms 19992 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
const int NN = 2005;
int a[NN][NN],y[NN],x[NN],f[NN],ans,n,m,b[NN][NN];
 
void solve(){
    ans=0;
    //sworia
    int N = n - n/2 - 1,P = 0; // N -> ramdeni cell sheudzlia daakldes
    for (int p = 0; p <= m; p++){
        int k = m/2 + 1 - p,ig = 0; // k -> ramdeni schirdeba
 
        if (k>0) ig = min(n, ((m - p)/k)*N);
        else ig = n;
 
        if (ans <= m - p + ig){
            P = p;
            ans = m - p + ig;
        }
    }
    
    //sworia
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            a[i][j] = 0;
    
    //sworia
    int k = m/2 + 1 - P;
    for (int j = 1; j <= P; j++) y[j] = 0;
    for (int j = P+1; j <= m; j++) y[j] = n-n/2-1;
    for (int i = 1; i <= n; i++){
        int cnt = 0;
        for (int j = 1; j <= m; j++) f[j] = 0;
        for (int j = P+1; j <= m; j++){
            if (y[j]>0) {
                y[j]--;
                f[j] = 1;
                cnt++;
            }
            if (cnt == k) break;
        }
        if (cnt < k) break;
        for (int j = 1; j <= m; j++)
            if (f[j]) a[i][j] = 1;
    }
    
    for(int i=1;i<=n;i++)
        for(int j=1;j<=P;j++)
            a[i][j]=1;
            
    //////////////////////////////////////
    
    int ans1=ans;
    ans=0;
    
    //sworia
    N = m - m/2 - 1,P = 0;
    for (int p = 0; p <= n; p++){
        int k = max(0LL,n/2 + 1 - p),ig = 0;
        int rm = (n - p)*(m - m/2 - 1);
        if (k) ig = min(m, rm/k);
        else ig = m;

        if (ans <= n - p + ig){
            P = p;
            ans = n - p + ig;
        }
    }

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            b[i][j] = 1;
    
    //sworia
    k = n/2 + 1 - P;
    for (int i = 1; i <= P; i++) x[i] = 0;
    for (int i = P+1; i <= n; i++) x[i] = N;
    
    //sworia
    for (int j = 1; j <= m; j++){
        int cnt=0;
        for (int i = 1; i <= n; i++) f[i] = 0;
        for (int i = P+1; i <= n; i++){
            if (x[i]>0){
                x[i]--;
                f[i] = 1;
                cnt++;
            }
            if (cnt == k) break;
        }
        if (cnt < k) break;
        for (int i = 1; i <= n; i++)
            if (f[i]) b[i][j] = 0;
    }
    
    for(int i=1;i<=P;i++)
        for(int j=1;j<=m;j++)
            b[i][j]=0;
 
    int ans2 = ans;
    if (ans1 < ans2){
        ans = ans2;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                a[i][j] = b[i][j];
    }else{
        ans = ans1;
    }
 
}
signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
 
    int T;
    cin>>T;
 
    while (T--){
        cin>>n>>m;
        solve();
        cout<<ans<<endl;
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                if (a[i][j]) cout<<"+";
                else cout<<"-";
            }
            cout<<endl;
        }
        
    }
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 10 ms 724 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2284 KB Output is correct
2 Correct 31 ms 17632 KB Output is correct
3 Correct 30 ms 19992 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 2808 KB Output is correct
2 Correct 27 ms 15056 KB Output is correct
3 Correct 24 ms 10832 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 10 ms 724 KB Output is correct
5 Correct 47 ms 2284 KB Output is correct
6 Correct 31 ms 17632 KB Output is correct
7 Correct 30 ms 19992 KB Output is correct
8 Correct 37 ms 2808 KB Output is correct
9 Correct 27 ms 15056 KB Output is correct
10 Correct 24 ms 10832 KB Output is correct
11 Incorrect 24 ms 724 KB in the table A+B is not equal to 31
12 Halted 0 ms 0 KB -