QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#590039 | #6418. Ah, It's Yesterday Once More | ji_114514 | WA | 0ms | 3668kb | C++20 | 950b | 2024-09-25 21:10:28 | 2024-09-25 21:10:30 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e3 + 10, mod = 1e9 + 7;
int c[30][30], n = 20, m = 20;
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
void solve()
{
int st = rand() % 4, x = 1, y = 1, cnt = 0;c[x][y] = 1;
while (cnt < 10)
{
x = x + dx[st], y = y + dy[st];
if (x > n || y > m || x == 0 || y == 0 || c[x + dx[st]][y + dy[st]] || c[x][y]) {
x -= dx[st], y -= dy[st];
//cout << x << ' ' << y << endl;
st = (st + 1) % 4, cnt++;
continue;
}
c[x][y] = 1, cnt = 0;
}
c[x][y] = 0;
cout << 20 << ' ' << 20 << endl;
for (int i = 1; i <= 20; i++)
{
for (int j = 1; j <= 20; j++)cout << c[i][j];
cout << endl;
}
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 1;
while (t--)solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3668kb
input:
output:
20 20 11111111111111111111 00000000000000000001 11111111111111111101 10000000000000000101 10111111111111110101 10100000000000010101 10101111111111010101 10101000000001010101 10101011111101010101 10101010000101010101 10101010100101010101 10101010111101010101 10101010000001010101 10101011111111010101 ...
result:
wrong answer 86 successful hack.