QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#232148#5438. Half MixedFYBGCWA 173ms3988kbC++172.3kb2023-10-29 22:26:322023-10-29 22:26:32

Judging History

你现在查看的是最新测评结果

  • [2023-10-29 22:26:32]
  • 评测
  • 测评结果：WA
  • 用时：173ms
  • 内存：3988kb
查看
  • [2023-10-29 22:26:32]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int N = 1e6 + 10;

void solve()
{
    int x, y;
    cin >> x >> y;
    vector<vector<ll>> num_rec(x + 1, vector<ll>(y + 1));
    for (int i = 1; i <= x; i++)
        for (int j = 1; j <= y; j++)
        {
            num_rec[i][j] = num_rec[i][j - 1] + (i + 1) * i * j / 2;
        }

    // y
    if (num_rec[1][y] % 2 == 0)
    {
        ll sum = num_rec[1][y] / 2 - y;
        vector<int> a(y + 1);
        for (int k = y; k >= 2; k--)
        {
            a[k] = sum / (num_rec[1][k] - k);
            sum = sum % (num_rec[1][k] - k);
        }

        int cnt = 0;
        for (int i = y; i >= 2; i--)
            cnt += a[i] * i;
        a[1] = y - cnt;

        int flag = 1;
        vector<int> ans;
        for (int i = 1; i <= y; i++)
        {
            for (int j = 1; j <= a[i]; j++)
            {
                for (int z = 1; z <= i; z++)
                    ans.push_back(flag);
                flag = !flag;
            }
        }

        cout << "Yes\n";
        for (int i = 1; i <= x; i++)
        {
            for (int j = 1; j <= y; j++)
                cout << ans[j] << " ";

            cout << '\n';
        }
    }
    else if (num_rec[x][1] % 2 == 0)
    {
        ll sum = num_rec[x][1] / 2 - x;
        vector<int> b(x + 1);
        for (int k = x; k >= 2; k--)
        {
            b[k] = sum / (num_rec[k][1] - k);
            sum = sum % (num_rec[k][1] - k);
        }
        int cnt = 0;
        for (int i = x; i >= 2; i--)
            cnt += b[i] * i;
        b[1] = x - cnt;
        int flag = 1;
        vector<int> ans;
        for (int i = 1; i <= x; i++)
        {
            for (int j = 1; j <= b[i]; j++)
            {
                for (int z = 1; z <= i; z++)
                    ans.push_back(flag);
                flag = !flag;
            }
        }
        cout << "Yes\n";
        for (int i = 1; i <= x; i++)
        {
            for (int j = 1; j <= y; j++)
                cout << ans[i] << " ";

            cout << '\n';
        }
    }
    else
    {
        cout << "No\n";
    }
}

signed main()
{

    int t;
    cin >> t;
    while (t--)
        solve();
}
Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

input:

2
2 3
1 1

output:

Yes
0 1 0 
0 1 0 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 173ms
memory: 3988kb

input:

5382
1 1
1 2
2 1
1 3
2 2
3 1
1 4
2 3
3 2
4 1
1 5
2 4
3 3
4 2
5 1
1 6
2 5
3 4
4 3
5 2
6 1
1 7
2 6
3 5
4 4
5 3
6 2
7 1
1 8
2 7
3 6
4 5
5 4
6 3
7 2
8 1
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
1 10
2 9
3 8
4 7
5 6
6 5
7 4
8 3
9 2
10 1
1 11
2 10
3 9
4 8
5 7
6 6
7 5
8 4
9 3
10 2
11 1
1 12
2 11
3 10
4 9
5 8
6 ...

output:

No
No
No
Yes
0 1 0 
No
Yes
0 
1 
0 
Yes
0 1 1 0 
Yes
0 1 0 
0 1 0 
Yes
0 0 
1 1 
0 0 
Yes
0 
1 
1 
0 
No
Yes
0 1 1 0 
0 1 1 0 
Yes
0 1 0 
0 1 0 
0 1 0 
Yes
0 0 
1 1 
1 1 
0 0 
No
No
No
Yes
0 1 1 0 
0 1 1 0 
0 1 1 0 
Yes
0 1 0 
0 1 0 
0 1 0 
0 1 0 
No
No
Yes
0 0 1 1 1 1 0 
No
Yes
0 0 0 0 0 
1 1 1 1 1...

result:

wrong answer 13 Mixed Submatrices Found, but 18 Expected (test case 29)
English 繁體中文 简体中文

Server Time: 2024-12-02 23:50:40 | OpenSource Project