QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#232144	#5438. Half Mixed	FYBGC	WA	182ms	3980kb	C++17	2.2kb	2023-10-29 22:22:55	2023-10-29 22:22:56

Judging History

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

[2023-10-29 22:22:56]
评测

测评结果：WA
用时：182ms
内存：3980kb

查看

[2023-10-29 22:22:55]
提交

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 >= 1; i--)
            cnt += a[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];
        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();
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3468kb

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: 182ms

memory: 3980kb

input:

output:

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

result:

wrong answer 20 Mixed Submatrices Found, but 14 Expected (test case 22)