QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#138503 | #5438. Half Mixed | Kronos# | TL | 915ms | 6312kb | C++20 | 2.3kb | 2023-08-11 20:41:57 | 2023-08-11 20:42:01 |
Judging History
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;
while (req_len > 0 and req_sum > 0) {
for (long long opt = x; 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(opt);
req_len -= opt;
req_sum -= opt * (opt + 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);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3476kb
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: 0
Accepted
time: 150ms
memory: 3608kb
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 0 1 0 Yes 0 1 0 0 1 0 Yes 0 0 1 1 0 0 Yes 0 0 1 0 No Yes 0 0 1 0 0 0 1 0 Yes 0 0 0 1 1 1 0 0 0 Yes 0 0 0 0 1 1 0 0 No No No Yes 0 0 0 0 1 1 1 1 0 0 0 0 Yes 0 0 0 0 0 0 1 1 1 0 0 0 No No Yes 0 0 0 0 1 1 0 No Yes 0 0 0 0 0 1 1 1 1 1...
result:
ok OK, Accepted. (5382 test cases)
Test #3:
score: 0
Accepted
time: 137ms
memory: 3528kb
input:
1177 50 50 50 51 51 50 50 52 51 51 52 50 50 53 51 52 52 51 53 50 50 54 51 53 52 52 53 51 54 50 50 55 51 54 52 53 53 52 54 51 55 50 50 56 51 55 52 54 53 53 54 52 55 51 56 50 50 57 51 56 52 55 53 54 54 53 55 52 56 51 57 50 50 58 51 57 52 56 53 55 54 54 55 53 56 52 57 51 58 50 50 59 51 58 52 57 53 56 5...
output:
No Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 1...
result:
ok OK, Accepted. (1177 test cases)
Test #4:
score: 0
Accepted
time: 126ms
memory: 3632kb
input:
420 100 100 100 101 101 100 100 102 101 101 102 100 100 103 101 102 102 101 103 100 100 104 101 103 102 102 103 101 104 100 100 105 101 104 102 103 103 102 104 101 105 100 100 106 101 105 102 104 103 103 104 102 105 101 106 100 100 107 101 106 102 105 103 104 104 103 105 102 106 101 107 100 100 108 ...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
ok OK, Accepted. (420 test cases)
Test #5:
score: 0
Accepted
time: 156ms
memory: 6312kb
input:
6 900 900 900 901 901 900 900 902 901 901 902 900
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok OK, Accepted. (6 test cases)
Test #6:
score: 0
Accepted
time: 825ms
memory: 3688kb
input:
3152 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 1 ...
output:
No Yes 0 0 0 0 0 0 0 1 1 0 1 Yes 0 0 0 0 0 0 0 1 1 1 1 0 No No Yes 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 Yes 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 No No Yes 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 1 ...
result:
ok OK, Accepted. (3152 test cases)
Test #7:
score: 0
Accepted
time: 769ms
memory: 3652kb
input:
3152 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61 1 62 1 63 1 64 1 65 1 66 1 67 1 68 ...
output:
No Yes 0 0 0 0 0 0 0 1 1 0 1 Yes 0 0 0 0 0 0 0 1 1 1 1 0 No No Yes 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 Yes 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 No No Yes 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 No No Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 0 Yes 0 0 0 0 ...
result:
ok OK, Accepted. (3152 test cases)
Test #8:
score: 0
Accepted
time: 822ms
memory: 3720kb
input:
3064 100 1 101 1 102 1 103 1 104 1 105 1 106 1 107 1 108 1 109 1 110 1 111 1 112 1 113 1 114 1 115 1 116 1 117 1 118 1 119 1 120 1 121 1 122 1 123 1 124 1 125 1 126 1 127 1 128 1 129 1 130 1 131 1 132 1 133 1 134 1 135 1 136 1 137 1 138 1 139 1 140 1 141 1 142 1 143 1 144 1 145 1 146 1 147 1 148 1 1...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 ...
result:
ok OK, Accepted. (3064 test cases)
Test #9:
score: 0
Accepted
time: 777ms
memory: 3644kb
input:
3064 1 100 1 101 1 102 1 103 1 104 1 105 1 106 1 107 1 108 1 109 1 110 1 111 1 112 1 113 1 114 1 115 1 116 1 117 1 118 1 119 1 120 1 121 1 122 1 123 1 124 1 125 1 126 1 127 1 128 1 129 1 130 1 131 1 132 1 133 1 134 1 135 1 136 1 137 1 138 1 139 1 140 1 141 1 142 1 143 1 144 1 145 1 146 1 147 1 148 1...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 No No Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
result:
ok OK, Accepted. (3064 test cases)
Test #10:
score: 0
Accepted
time: 915ms
memory: 3712kb
input:
2316 1000 1 1001 1 1002 1 1003 1 1004 1 1005 1 1006 1 1007 1 1008 1 1009 1 1010 1 1011 1 1012 1 1013 1 1014 1 1015 1 1016 1 1017 1 1018 1 1019 1 1020 1 1021 1 1022 1 1023 1 1024 1 1025 1 1026 1 1027 1 1028 1 1029 1 1030 1 1031 1 1032 1 1033 1 1034 1 1035 1 1036 1 1037 1 1038 1 1039 1 1040 1 1041 1 1...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok OK, Accepted. (2316 test cases)
Test #11:
score: 0
Accepted
time: 847ms
memory: 3520kb
input:
2316 1 1000 1 1001 1 1002 1 1003 1 1004 1 1005 1 1006 1 1007 1 1008 1 1009 1 1010 1 1011 1 1012 1 1013 1 1014 1 1015 1 1016 1 1017 1 1018 1 1019 1 1020 1 1021 1 1022 1 1023 1 1024 1 1025 1 1026 1 1027 1 1028 1 1029 1 1030 1 1031 1 1032 1 1033 1 1034 1 1035 1 1036 1 1037 1 1038 1 1039 1 1040 1 1041 1...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...
result:
ok OK, Accepted. (2316 test cases)
Test #12:
score: -100
Time Limit Exceeded
input:
488 10000 1 10001 1 10002 1 10003 1 10004 1 10005 1 10006 1 10007 1 10008 1 10009 1 10010 1 10011 1 10012 1 10013 1 10014 1 10015 1 10016 1 10017 1 10018 1 10019 1 10020 1 10021 1 10022 1 10023 1 10024 1 10025 1 10026 1 10027 1 10028 1 10029 1 10030 1 10031 1 10032 1 10033 1 10034 1 10035 1 10036 1 ...
output:
Yes 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...