oj.uz

Submission #638879

# Submission time Handle Problem Language Result Execution time Memory
638879 2022-09-07T19:03:40 Z Alexandruabcde Gardening (RMI21_gardening) C++14
23 / 100
 35 ms 24444 KB 
#include <bits/stdc++.h>
#define DEBUG 0

using namespace std;

typedef pair <int, int> PII;
typedef pair <int, pair <int, int> > PIII;
constexpr int NMAX = 1005;

///6 10 11

int N, M, K;

vector <PIII> Values[NMAX][NMAX];

void Precompute () {
    for (int i = 2; i <= N; i += 2) {
        for (int j = 2; j <= M; j += 2) {
            if (i == 2) {
                Values[i][j].push_back({j/2, {0, 0}});

                continue;
            }

            if (j == 2) {
                Values[i][j].push_back({i/2, {0, 0}});

                continue;
            }

            vector <PIII> aux;

            for (auto it : Values[i-2][j-2]) {
                aux.push_back({it.first + 1, {i-2, j-2}});
            }

            for (auto it : Values[i-2][j]) {
                aux.push_back({it.first + j/2, {i-2, j}});
            }

            for (auto it : Values[i][j-2]) {
                aux.push_back({it.first + i/2, {i, j-2}});
            }

            sort(aux.begin(), aux.end());

            for (auto it : aux) {
                if (Values[i][j].empty() || Values[i][j].back().first != it.first)
                    Values[i][j].push_back(it);

                if (!Values[i][j].empty() && Values[i][j].back().first == it.first) {
                    Values[i][j].pop_back();

                    Values[i][j].push_back(it);
                }
            }
        }
    }
}

vector <vector <int> > ans;

void Complete_Border (PII &stsus, PII &drjos, int &who) {
    for (int i = stsus.first; i <= drjos.first; ++ i )
        ans[i][stsus.second] = ans[i][drjos.second] = who;
    for (int i = stsus.second ; i <= drjos.second; ++ i )
        ans[stsus.first][i] = ans[drjos.first][i] = who;

    ++ who;

    stsus.first ++, stsus.second ++;
    drjos.first --, drjos.second --;
}

void Complete_Column (PII &stsus, PII &drjos, int &who) {
    for (int i = stsus.first; i < drjos.first; i += 2) {
        ans[i][drjos.second] = ans[i+1][drjos.second] = who;
        ans[i][drjos.second-1] = ans[i+1][drjos.second-1] = who;

        ++ who;
    }

    drjos.second -= 2;
}

void Complete_Line (PII &stsus, PII &drjos, int &who) {
    for (int i = stsus.second; i < drjos.second; i += 2) {
        ans[drjos.first][i] = ans[drjos.first][i+1] = who;
        ans[drjos.first-1][i] = ans[drjos.first-1][i+1] = who;

        ++ who;
    }

    drjos.first -= 2;
}

void Do_Testcase() {
    cin >> N >> M >> K;

    ans.resize(N);
    for (auto &it : ans)
        it.resize(M);

    if (N % 2 == 1 || M % 2 == 1) {
        cout << "NO\n";
        return;
    }

    int Min_K_Pos = max(N, M) / 2;
    int Max_K_Pos = N * M / 4;

    if (K < Min_K_Pos || K > Max_K_Pos || (K == Min_K_Pos + 1 && N == M) || K == Max_K_Pos - 1) {
        cout << "NO\n";
        return;
    }

    cout << "YES\n";

    int who = 1;
    PII stsus = {0, 0};
    PII drjos = {N-1, M-1};

    int NrLin = N, NrCol = M;
    while (NrLin > 2 && NrCol > 2) {
        int Min_K_Pos = max(NrLin, NrCol) / 2;
        int cnt22 = min(NrLin, NrCol) / 2 - 1;
        int cnt20 = (NrLin - NrCol) / 2 + 1;

        if (NrLin == NrCol || NrCol > NrLin + 2) {
            if (K <= Min_K_Pos + cnt22) {
                Complete_Border(stsus, drjos, who);
                -- K;
            }
            else {
                Complete_Column(stsus, drjos, who);
                K -= (NrLin / 2);
            }
        }
        else {
            if (NrCol == NrLin + 2) {
                if (K <= Min_K_Pos + cnt22 - 1 || K == Min_K_Pos + cnt22 + 1) {
                    Complete_Border(stsus, drjos, who);
                    -- K;
                }
                else {
                    Complete_Column(stsus, drjos, who);
                    K -= (NrLin / 2);
                }
            }
            else {
                if (NrLin == NrCol + 2) {
                    if (K <= Min_K_Pos + cnt22 - 1 || K == Min_K_Pos + cnt22 + 1) {
                        Complete_Border(stsus, drjos, who);
                        -- K;
                    }
                    else {
                        if (K == Min_K_Pos + cnt22) {
                            Complete_Line(stsus, drjos, who);
                            K -= (NrCol / 2);
                        }
                        else {
                            Complete_Column(stsus, drjos, who);
                            K -= (NrLin / 2);
                        }
                    }
                }
                else {
                    if (K <= Min_K_Pos + cnt22 - 1) {
                        Complete_Border(stsus, drjos, who);
                        -- K;
                    }
                    else if (K <= Min_K_Pos + cnt22 + cnt20 - 1) {
                        Complete_Line(stsus, drjos, who);
                        K -= (NrCol / 2);
                    }
                    else {
                        Complete_Column(stsus, drjos, who);
                        K -= (NrLin / 2);
                    }
                }
            }
        }

        NrLin = drjos.first - stsus.first + 1;
        NrCol = drjos.second - stsus.second + 1;
    }

    if (NrLin == 2) {
        Complete_Line(stsus, drjos, who);
    }
    else Complete_Column(stsus, drjos, who);

    for (int i = 0; i < N; ++ i ) {
        for (int j = 0; j < M; ++ j )
            cout << ans[i][j] << " ";
        cout << '\n';
    }

    ans.clear();
}

void Solve () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;

    for (; T; -- T )
        Do_Testcase();
}

int main () {
    if (!DEBUG) {
        Solve();
        return 0;
    }

    cin >> N >> M;


    Precompute();

    for (auto it : Values[N][M]) {
        int cnt = it.first;
        int i = it.second.first;
        int j = it.second.second;

        cout << cnt << " " << i << " " << j << '\n';
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 24404 KB Correct! Azusa and Laika like the garden :)

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 24404 KB Correct! Azusa and Laika like the garden :)
2 Failed 25 ms 24348 KB Output does not contain all values between 1 and k
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 24404 KB Correct! Azusa and Laika like the garden :)
2 Failed 25 ms 24348 KB Output does not contain all values between 1 and k
3 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24444 KB Correct! Azusa and Laika like the garden :)
2 Correct 25 ms 24396 KB Correct! Azusa and Laika like the garden :)
3 Correct 21 ms 24416 KB Correct! Azusa and Laika like the garden :)
4 Correct 23 ms 24424 KB Correct! Azusa and Laika like the garden :)
5 Correct 21 ms 24404 KB Correct! Azusa and Laika like the garden :)
6 Correct 21 ms 24404 KB Correct! Azusa and Laika like the garden :)
7 Correct 21 ms 24404 KB Correct! Azusa and Laika like the garden :)
8 Correct 20 ms 24388 KB Correct! Azusa and Laika like the garden :)
9 Correct 20 ms 24424 KB Correct! Azusa and Laika like the garden :)
10 Correct 21 ms 24396 KB Correct! Azusa and Laika like the garden :)
11 Correct 23 ms 24404 KB Correct! Azusa and Laika like the garden :)
12 Correct 21 ms 24292 KB Correct! Azusa and Laika like the garden :)
13 Correct 22 ms 24376 KB Correct! Azusa and Laika like the garden :)

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Failed 17 ms 24148 KB Output does not contain all values between 1 and k
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 24404 KB Correct! Azusa and Laika like the garden :)
2 Failed 25 ms 24348 KB Output does not contain all values between 1 and k
3 Halted 0 ms 0 KB -