oj.uz

Submission #1001012

# Submission time Handle Problem Language Result Execution time Memory
1001012 2024-06-18T12:47:31 Z GrindMachine Red-blue table (IZhO19_stones) C++17
100 / 100
 73 ms 3408 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

read some accepted submissions a long time ago, didnt understand the idea behind them back then

*/

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

char a[N][N], ans[N][N];

void solve(int test_case)
{
    int n,m; cin >> n >> m;
    int best = -inf1;

    auto go = [&](){
        int cost = 0;

        rep1(i,n){
            int cnt = 0;
            rep1(j,m){
                if(a[i][j] == 'x') cnt++;
            }
            if(cnt > m/2) cost++;
        }

        rep1(j,m){
            int cnt = 0;
            rep1(i,n){
                if(a[i][j] == '.') cnt++;
            }
            if(cnt > n/2) cost++;
        }

        if(cost > best){
            best = cost;
            rep1(i,n) rep1(j,m) ans[i][j] = a[i][j];
        }
    };

    rep(ignore_rows,min(n+1,5)){
        rep(ignore_cols,min(m+1,5)){
            rep1(i,n) rep1(j,m) a[i][j] = '.';
            int ptr = 1;
            rep1(i,n-ignore_rows){
                for(int j = m-ignore_cols+1; j <= m; ++j){
                    a[i][j] = 'x';
                }
                int need = (m/2+1)-ignore_cols;
                while(need >= 1){
                    a[i][ptr] = 'x';
                    need--;
                    ptr++;
                    if(ptr >= m-ignore_cols+1) ptr = 1;
                }
            }

            go();
        }
    }   

    cout << best << endl;
    rep1(i,n){
        rep1(j,m){
            if(ans[i][j] == 'x') cout << '+';
            else cout << '-'; 
        }
        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 4 ms 600 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 1620 KB Output is correct
2 Correct 64 ms 2640 KB Output is correct
3 Correct 60 ms 3152 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 1616 KB Output is correct
2 Correct 58 ms 2488 KB Output is correct
3 Correct 52 ms 2164 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 62 ms 1620 KB Output is correct
6 Correct 64 ms 2640 KB Output is correct
7 Correct 60 ms 3152 KB Output is correct
8 Correct 72 ms 1616 KB Output is correct
9 Correct 58 ms 2488 KB Output is correct
10 Correct 52 ms 2164 KB Output is correct
11 Correct 15 ms 536 KB Output is correct
12 Correct 56 ms 2648 KB Output is correct
13 Correct 58 ms 2844 KB Output is correct
14 Correct 45 ms 2388 KB Output is correct
15 Correct 73 ms 3408 KB Output is correct
16 Correct 53 ms 2540 KB Output is correct
17 Correct 24 ms 1880 KB Output is correct