QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#234649#5438. Half MixedbigJWA 144ms3664kbC++202.1kb2023-11-01 20:16:522023-11-01 20:16:53

Judging History

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

  • [2023-11-01 20:16:53]
  • 评测
  • 测评结果:WA
  • 用时:144ms
  • 内存:3664kb
  • [2023-11-01 20:16:52]
  • 提交

answer

#include <bits/stdc++.h>

template<typename P, typename Q> std::istream& operator>>(std::istream& is, std::pair<P, Q>& v) { std::cin >> v.first >> v.second; return is; }
template<typename P, typename Q> std::ostream& operator<<(std::ostream& os, std::pair<P, Q>& v) { std::cout << v.first << ' ' << v.second; return os; }
template<typename T, std::size_t N> std::istream& operator>>(std::istream& is, std::array<T, N>& v) { for (auto& i : v) is >> i; return is; }
template<typename T, std::size_t N> std::ostream& operator<<(std::ostream& os, std::array<T, N>& v) { for (auto& i : v) os << i << ' '; return os; }
template<typename T> std::istream& operator>>(std::istream& is, std::vector<T>& v) { for (auto& i : v) is >> i; return is; }
template<typename T> std::ostream& operator<<(std::ostream& os, std::vector<T>& v) { for (auto& i : v) os << i << ' '; return os; }
template<typename...Args> void debug(Args...args) { ((std::cerr << args << ' '), ...); std::cerr << '\n'; }
template<typename...Args> void println(Args...args) { ((std::cout << args << ' '), ...); std::cout << '\n'; }
template<typename P, typename Q> auto chmax(P& a, Q b) { a = (b > a ? b : a); return a == b; }
template<typename P, typename Q> auto chmin(P& a, Q b) { a = (b < a ? b : a); return a == b; }

using i64 = int64_t;

auto solve() {
    int n, m;
    std::cin >> n >> m;

    int tot = 0;
    int s1 = i64(1 + n) * n / 2 % 2;

    for (int i = 1; i <= m; i++) {
        tot ^= 1LL * s1 * i;
    }

    if (tot & 1) {
        std::cout << "No\n";
        return;
    }

    std::cout << "Yes\n";
    std::vector<int> a(m, 1);

    if (n == 1) {
        a.front() = 0, a.back() = 0;
        std::cout << a << "\n";
        return;
    }

    auto b = a;
    b.front() = 0;
    auto c = a;
    c.back() = 0;
    std::cout << b << "\n";
    for (int i = 0; i < n - 2; i++) {
        std::cout << a << "\n";
    }
    std::cout << c << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int c;
    std::cin >> c;

    while (c--) {
        solve();
    }

    return 0;
}

詳細信息

Test #1:

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

input:

2
2 3
1 1

output:

Yes
0 1 1 
1 1 0 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 144ms
memory: 3664kb

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 1 
1 1 0 
Yes
0 1 
1 1 
1 0 
Yes
0 
1 
1 
0 
No
Yes
0 1 1 1 
1 1 1 0 
Yes
0 1 1 
1 1 1 
1 1 0 
Yes
0 1 
1 1 
1 1 
1 0 
No
No
No
Yes
0 1 1 1 
1 1 1 1 
1 1 1 0 
Yes
0 1 1 
1 1 1 
1 1 1 
1 1 0 
No
No
Yes
0 1 1 1 1 1 0 
No
Yes
0 1 1 1 1 
1 1 1 1 1...

result:

wrong answer 13 Mixed Submatrices Found, but 15 Expected (test case 12)