QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #485836 | #6743. water235 | duckindog | WA | 1ms | 3776kb | C++23 | 629b | 2024-07-21 10:17:40 | 2024-07-21 10:17:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
int n, m; cin >> n >> m;
vector<vector<int>> a(n + 1, vector<int>(m + 1));
for (int i = 5; i <= n; i += 2) a[i][m] = 1;
if (n >= 3) a[3][1] = 1;
if (!(n & 1)) a[n][m] = 1;
if (n == 1) a[1][m] = 1;
for (int j = 1; j <= m; j += 2) a[1][j] = 1;
int answer = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) answer += a[i][j];
}
cout << answer << "\n";
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) cout << a[i][j] << " \n"[j == m];
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
input:
2 1
output:
2 1 1
result:
ok The answer is correct.
Test #2:
score: 0
Accepted
time: 0ms
memory: 3464kb
input:
3 3
output:
3 1 0 1 0 0 0 1 0 0
result:
ok The answer is correct.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
1 4
output:
3 1 0 1 1
result:
ok The answer is correct.
Test #4:
score: 0
Accepted
time: 0ms
memory: 3776kb
input:
2 2
output:
2 1 0 0 1
result:
ok The answer is correct.
Test #5:
score: 0
Accepted
time: 0ms
memory: 3464kb
input:
2 4
output:
3 1 0 1 0 0 0 0 1
result:
ok The answer is correct.
Test #6:
score: 0
Accepted
time: 0ms
memory: 3524kb
input:
4 3
output:
4 1 0 1 0 0 0 1 0 0 0 0 1
result:
ok The answer is correct.
Test #7:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
4 4
output:
4 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1
result:
ok The answer is correct.
Test #8:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
1 789
output:
395 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 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 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 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 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...
result:
ok The answer is correct.
Test #9:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
2 444
output:
223 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 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 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 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 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...
result:
ok The answer is correct.
Test #10:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
2 445
output:
224 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 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 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 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 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...
result:
ok The answer is correct.
Test #11:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
3 333
output:
168 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 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 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 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 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...
result:
ok The answer is correct.
Test #12:
score: -100
Wrong Answer
time: 0ms
memory: 3460kb
input:
3 332
output:
167 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 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 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 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 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 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 ...
result:
wrong answer The answer is wrong: expected = 168, found = 167