QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#138508#5438. Half MixedKronos#RE 1ms3584kbC++202.6kb2023-08-11 20:49:502023-08-11 20:49:53

Judging History

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

  • [2023-08-11 20:49:53]
  • 评测
  • 测评结果:RE
  • 用时:1ms
  • 内存:3584kb
  • [2023-08-11 20:49:50]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t; cin >> t;
    while (t--) {
        long long n, m; cin >> n >> m;
        long long tot_rects = n * (n + 1) / 2 * m * (m + 1) / 2;
        if (tot_rects & 1) {
            cout << "No\n";
            continue;
        }

        auto get = [](long long x) {
            long long req_sum = x * (x + 1) / 4, req_len = x;
            vector <long long> groups;
            /*
            x * (x + 1) / 2 + (L - x) <= S

            */
            while (req_len > 0 and req_sum > 0) {
                long long l = 1, r = req_len;
                while (r - l > 1) {
                    long long mid = (l + r) >> 1;
                    if (mid * (mid + 1) / 2 + (req_len - mid) <= req_sum) l = mid;
                    else r = mid;
                }
                // for (long long opt = req_len; opt > 0; --opt) {
                //     long long rest_ones = req_len - opt;
                //     if (opt <= req_len and opt * (opt + 1) / 2 + rest_ones <= req_sum) {
                groups.push_back(l);
                req_len -= l;
                req_sum -= l * (l + 1) / 2;           
                //         break;
                //     }
                // }
            }
            assert(req_len == 0 and req_sum == 0);
            vector <int> ret;
            int st = 0;
            for (auto x : groups) {
                for (int i = 0; i < x; ++i) ret.push_back(st);
                st ^= 1;
            }
            return ret;
        };

        if (n * (n + 1) / 2 % 2 == 0) {
            cout << "Yes\n";
            auto f = get(n);
            vector <vector <int>> a(n, vector <int>(m));
            for (int i = 0; i < m; ++i) {
                for (int j = 0; j < n; ++j) {
                    a[j][i] = f[j];
                }
            }
            for (auto v : a) {
                for (auto x : v) {
                    cout << x << ' ';
                }
                cout << '\n';
            }
        } else if (m * (m + 1) / 2 % 2 == 0) {
            cout << "Yes\n";
            auto f = get(m);
            vector <vector <int>> a(n, vector <int>(m));
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < m; ++j) {
                    a[i][j] = f[j];
                }
            }
            for (auto v : a) {
                for (auto x : v) {
                    cout << x << ' ';
                }
                cout << '\n';
            }
        } else assert(0);
    }   
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3584kb

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
Dangerous Syscalls

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:


result: