QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #95617 | #6309. Aqre | khoray | RE | 2ms | 3452kb | C++14 | 3.9kb | 2023-04-10 21:15:59 | 2023-04-10 21:16:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int d[4] = {-1, 0, 1, 0};
bool check(vector<vector<int>> &mp) {
int n = mp.size() - 1, m = mp[1].size() - 1;
queue<pair<int, int>> q;
vector<vector<int>> vis(n + 1, vector<int> (m + 1));
int found = 0;
for(int i = 1; i <= n && !found; i++) {
for(int j = 1; j <= m && !found; j++) {
if(mp[i][j] == 1) {
q.emplace(i, j);
vis[i][j] = 1;
found = 1;
}
}
}
while(q.size()) {
auto [x, y] = q.front(); q.pop();
for(int i = 0; i < 4; i++) {
int nx = x + d[i];
int ny = y + d[3 - i];
if(nx >= 1 && ny >= 1 && nx <= n && ny <= m && !vis[nx][ny] && mp[nx][ny] == 1) {
vis[nx][ny] = 1;
q.emplace(nx, ny);
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(mp[i][j] == 1 && !vis[i][j]) {
return 0;
}
}
}
return 1;
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> ans(n + 1, vector<int> (m + 1));
if(n <= 3 && m <= 3) {
cout << n * m << "\n";
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cout << 1;
}
cout << "\n";
}
return;
}
if(m % 4 == 1) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(i % 4 == 1) {
if(j % 4 != 2) ans[i][j] = 1;
} else if(i % 4 == 2) {
if(j % 4 != 0) ans[i][j] = 1;
} else if(i % 4 == 3) {
if(j % 4 != 3) ans[i][j] = 1;
} else if(i % 4 == 0) {
if(j % 4 != 1) ans[i][j] = 1;
}
}
}
} else if(m % 4 == 2) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(i % 4 == 1) {
if(j % 4 != 3) ans[i][j] = 1;
} else if(i % 4 == 2) {
if(j % 4 != 2) ans[i][j] = 1;
} else if(i % 4 == 3) {
if(j % 4 != 0) ans[i][j] = 1;
} else if(i % 4 == 0) {
if(j % 4 != 1) ans[i][j] = 1;
}
}
}
} else if(m % 4 == 3) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(i % 4 == 1) {
if(j % 4 != 0) ans[i][j] = 1;
} else if(i % 4 == 2) {
if(j % 4 != 2) ans[i][j] = 1;
} else if(i % 4 == 3) {
if(j % 4 != 3) ans[i][j] = 1;
} else if(i % 4 == 0) {
if(j % 4 != 1) ans[i][j] = 1;
}
}
}
} else if(m % 4 == 0) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
if(i % 4 == 1) {
if(j % 4 != 1) ans[i][j] = 1;
} else if(i % 4 == 2) {
if(j % 4 != 3) ans[i][j] = 1;
} else if(i % 4 == 3) {
if(j % 4 != 2) ans[i][j] = 1;
} else if(i % 4 == 0) {
if(j % 4 != 0) ans[i][j] = 1;
}
}
}
}
int anscnt = 0;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
anscnt += ans[i][j];
}
}
cout << anscnt << "\n";
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cout << ans[i][j];
}
cout << "\n";
}
assert(check(ans));
}
signed main() {
int t; cin >> t;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3452kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 0111 1101 1011 18 01110111 11011101 10111011
result:
ok ok (3 test cases)
Test #2:
score: -100
Dangerous Syscalls
input:
361 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 4 12 4 13 4 14 4 15 4 16 4 17 4 18 4 19 4 20 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 1...
output:
4 11 11 6 111 111 6 0111 1101 8 10111 11101