oj.uz

답안 #1010806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1010806 2024-06-29T11:37:47 Z LucaIlie Red-blue table (IZhO19_stones) C++17
100 / 100
 41 ms 2900 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000;
char mat[MAX_N][MAX_N], aux[MAX_N][MAX_N];
int sumL[MAX_N], sumC[MAX_N];

int eval( int n, int m ) {
    for ( int l = 0; l < n; l++ )
        sumL[l] = 0;
    for ( int c = 0; c < m; c++ )
        sumC[c] = 0;
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            sumL[l] += (mat[l][c] == '+' ? 1 : -1);
            sumC[c] += (mat[l][c] == '+' ? -1 : +1);
        }
    }
    int r = 0;
    for ( int l = 0; l < n; l++ )
        r += (sumL[l] > 0);
    for ( int c = 0; c < m; c++ )
        r += (sumC[c] > 0);
    return r;
}

int solve1( int n, int m ) {
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l == n - 1 && m != 1 )
                mat[l][c] = '-';
            else {
                if ( l < n / 2 ) {
                    if ( c <= m / 2 )
                        mat[l][c] = '+';
                    else
                        mat[l][c] = '-';
                } else {
                    if ( c < (m - 1) / 2 )
                        mat[l][c] = '-';
                    else
                        mat[l][c] = '+';
                }
            }
        }
    }
    return eval( n, m );
}

int solve2( int n, int m ) {
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l >= n - 2 && m != 1 )
                mat[l][c] = '-';
            else {
                if ( l < (n - 1) / 2 ) {
                    if ( c <= m / 2 )
                        mat[l][c] = '+';
                    else
                        mat[l][c] = '-';
                } else {
                    if ( c < (m - 1) / 2 )
                        mat[l][c] = '-';
                    else
                        mat[l][c] = '+';
                }
            }
        }
    }
    return eval( n, m );
}

int solve3( int n, int m ) {
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( n > m ) {
                if ( c <= m / 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            } else {
                if ( l <= n / 2 )
                    mat[l][c] = '-';
                else
                    mat[l][c] = '+';
            }
        }
    }
    return eval( n, m );
}

int solve4( int n, int m ) {
    if ( n != 6 || m != 6 )
        return 0;

    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l < 3 )
                mat[l][c] = '-';
            else if ( l == 3 ) {
                if ( c < 4 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else if ( l == 4 ) {
                if ( c < 2 || c >= 4 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else if ( l == 5 ) {
                if ( c >= 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
        }
    }
    return eval( n, m );
}

int solve5( int n, int m ) {
    bool transposed = false;
    if ( n > m ) {
        swap( n, m );
        transposed = true;
    }

    int specialLines = n / 2 + 1;
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l >= specialLines )
                mat[l][c] = '-';
            else if ( l == 0 ) {
                if ( c < m / 2 + 1 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else if ( l <= specialLines / 2 ) {
                if ( c < (m + 1) / 2 - 1 || c == (m + 1) / 2 + l * 2 - 1 || c == (m + 1) / 2 + l * 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else {
                if ( c >= (m - 1) / 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
        }
    }

    if ( transposed ) {
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                aux[c][l] = mat[l][c];
        }
        swap( n, m );
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                mat[l][c] = (aux[l][c] == '+' ? '-' : '+');
        }
    }

    return eval( n, m );
}

int solve6( int n, int m ) {
    if ( n != 5 && m != 5 )
        return 0;
    
    bool transposed = false;
    if ( n != 5 ) {
        swap( n, m );
        transposed = true;
    }

    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l < 2 )
                mat[l][c] = '-';
            else if ( l == 2 ) {
                if ( c <= (m + 1) / 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else if ( l == 3 ) {
                if ( c < (m + 1) / 2 - 1 || c >= m - 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
            else if ( l == 4 ) {
                if ( c >= m / 2 - 1 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
        }
    }

    if ( transposed ) {
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                aux[c][l] = mat[l][c];
        }
        swap( n, m );
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                mat[l][c] = (aux[l][c] == '+' ? '-' : '+');
        }
    }
    
    return eval( n, m );
}


int solve7( int n, int m ) {
    bool transposed = false;
    if ( n > m ) {
        swap( n, m );
        transposed = true;
    }

    int specialLines = n - 2;
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l >= specialLines )
                mat[l][c] = '-';
            else if ( l == 0 ) {
                if ( c < m / 2 + 1 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            } else if ( l <= specialLines / 2 ) {
                if ( c < (m + 1) / 2 - 1 || c == (m + 1) / 2 + l * 2 - 1 || c == (m + 1) / 2 + l * 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            } else {
                if ( c >= (m - 1) / 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
        }
    }

    if ( transposed ) {
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                aux[c][l] = mat[l][c];
        }
        swap( n, m );
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                mat[l][c] = (aux[l][c] == '+' ? '-' : '+');
        }
    }

    return eval( n, m );
}

int solve8( int n, int m ) {
    bool transposed = false;
    if ( n > m ) {
        swap( n, m );
        transposed = true;
    }

    int specialLines = n - 3;
    for ( int l = 0; l < n; l++ ) {
        for ( int c = 0; c < m; c++ ) {
            if ( l >= specialLines )
                mat[l][c] = '-';
            else if ( l == 0 ) {
                if ( c < m / 2 + 1 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            } else if ( l <= specialLines / 2 ) {
                if ( c < (m + 1) / 2 - 1 || c == (m + 1) / 2 + l * 2 - 1 || c == (m + 1) / 2 + l * 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            } else {
                if ( c >= (m - 1) / 2 )
                    mat[l][c] = '+';
                else
                    mat[l][c] = '-';
            }
        }
    }

    if ( transposed ) {
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                aux[c][l] = mat[l][c];
        }
        swap( n, m );
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                mat[l][c] = (aux[l][c] == '+' ? '-' : '+');
        }
    }

    return eval( n, m );
}

int main() {
    int t;

    cin >> t;
    for ( ; t > 0; t-- ) {
        int n, m;

        cin >> n >> m;

        int best = 1, r = solve1( n, m );
        if ( solve2( n, m ) > r ) {
            best = 2;
            r = solve2( n, m );
        }
        if ( solve3( n, m ) > r ) {
            best = 3;
            r = solve3( n, m );
        }
        if ( solve4( n, m ) > r ) {
            best = 4;
            r = solve4( n, m );
        }
        if ( solve5( n, m ) > r ) {
            best = 5;
            r = solve5( n, m );
        }
        if ( solve6( n, m ) > r ) {
            best = 6;
            r = solve6( n, m );
        }
        if ( solve7( n, m ) > r ) {
            best = 7;
            r = solve7( n, m );
        }
        if ( solve8( n, m ) > r ) {
            best = 8;
            r = solve8( n, m );
        }

        if ( best == 1 )
            solve1( n, m );
        if ( best == 2 )
            solve2( n, m );
        if ( best == 3 )
            solve3( n, m );
        if ( best == 4 )
            solve4( n, m );
        if ( best == 5 )
            solve5( n, m );
        if ( best == 6 )
            solve6( n, m );
        if ( best == 7 )
            solve7( n, m );
        if ( best == 8 )
            solve8( n, m );

        cout << r << "\n";
        for ( int l = 0; l < n; l++ ) {
            for ( int c = 0; c < m; c++ )
                cout << mat[l][c];
            cout << "\n";
        }
    }

    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 1608 KB Output is correct
2 Correct 31 ms 2644 KB Output is correct
3 Correct 27 ms 2896 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 1360 KB Output is correct
2 Correct 25 ms 1876 KB Output is correct
3 Correct 23 ms 1624 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 41 ms 1608 KB Output is correct
6 Correct 31 ms 2644 KB Output is correct
7 Correct 27 ms 2896 KB Output is correct
8 Correct 34 ms 1360 KB Output is correct
9 Correct 25 ms 1876 KB Output is correct
10 Correct 23 ms 1624 KB Output is correct
11 Correct 12 ms 552 KB Output is correct
12 Correct 28 ms 2600 KB Output is correct
13 Correct 36 ms 2900 KB Output is correct
14 Correct 24 ms 2388 KB Output is correct
15 Correct 33 ms 2384 KB Output is correct
16 Correct 24 ms 1876 KB Output is correct
17 Correct 13 ms 2024 KB Output is correct