QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #76571 | #4884. Battleship: New Rules | LG_Monkey | Compile Error | / | / | C++14 | 2.4kb | 2023-02-10 20:35:48 | 2023-02-10 20:35:49 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-02-10 20:35:49]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2023-02-10 20:35:48]
- 提交
answer
/*NE Write and AFO here*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
int n, a[1010][1010];
pii dfs(int x1, int y1, int X2, int Y2) {
int x2 = X2 - 1, y2 = Y2 - 1;
int cnt = (x2 - x1 + 2) * (y2 - y1 + 2);
for (int i = y1 - 1; i <= y2 + 1; ) {
if (a[x2 + 1][i] != 1) i++, continue;
int j = i;
while (j <= y2 && a[x2 + 1][j + 1] == 1) j++;
if (i == y1 - 1 && j == y2 + 1) cnt -= y2 - y1 + 2;
else if (i == y1 - 1 || j == y2 + 1) cnt -= j - i + 1;
else cnt -= j - i + 2;
i = j + 1;
}
for (int i = y1 - 1; i <= y2 + 1; ) {
if (a[x1 - 1][i] != 1) i++, continue;
int j = i;
while (j <= y2 && a[x1 - 1][j + 1] == 1) j++;
if (i == y1 - 1 && j == y2 + 1) cnt -= y2 - y1 + 2;
else if (i == y1 - 1 || j == y2 + 1) cnt -= j - i + 1;
else cnt -= j - i + 2;
i = j + 1;
}
for (int i = x1 - 1; i <= x2 + 1; ) {
if (a[i][y1 - 1] != 1) i++, continue;
int j = i;
while (j <= x2 && a[j + 1][y1 - 1] == 1) j++;
if (i == x1 - 1 && j == x2 + 1) cnt -= x2 - x1 + 2;
else if (i == x1 - 1 || j == x2 + 1) cnt -= j - i + 1;
else cnt -= j - i + 2;
i = j + 1;
}
for (int i = x1 - 1; i <= x2 + 1; ) {
if (a[i][y2 + 1] != 1) i++, continue;
int j = i;
while (j <= x2 && a[j + 1][y2 + 1] == 1) j++;
if (i == x1 - 1 && j == x2 + 1) cnt -= x2 - x1 + 2;
else if (i == x1 - 1 || j == x2 + 1) cnt -= j - i + 1;
else cnt -= j - i + 2;
i = j + 1;
}
if (cnt % 2 == 0) return mp(-1, -1);
if (x1 == X2 && y1 && Y2) return mp(x1, y1);
if (x2 - x1 > y2 - y1) {
int mid = (x1 + x2) >> 1;
for (int j = y1; j <= y2; j++) {
if (a[mid][j] == -1) {
int x; cin >> x; a[mid][j] = x;
}
}
pii la = dfs(x1, y1, mid, Y2), ra = dfs(mid + 1, y1, X2, Y2);
if (la.first == -1) return ra; else return la;
} else {
int mid = (y1 + y2) >> 1;
for (int j = x1; j <= x2; j++) {
if (a[j][mid] == -1) {
int x; cin >> x; a[j][mid] = x;
}
}
pii la = dfs(x1, y1, X2, mid), ra = dfs(x1, mid + 1, X2, Y2);
if (la.first == -1) return ra; else return la;
}
}
signed main() {
int T;
cin >> T;
while (T--) {
cin >> n;
if (n & 1) {
cout << "! -1 -1" << endl; int x; cin >> x; continue;
}
memset(a, -1, sizeof a);
pii ans = dfs(1, 1, n + 1, n + 1);
cout << "! " << ans.first << " " << ans.second << endl; int x; cin >> x;
}
}
詳細信息
answer.code: In function ‘std::pair<long long int, long long int> dfs(long long int, long long int, long long int, long long int)’:
answer.code:13:45: error: expected primary-expression before ‘continue’
13 | if (a[x2 + 1][i] != 1) i++, continue;
| ^~~~~~~~
answer.code:22:45: error: expected primary-expression before ‘continue’
22 | if (a[x1 - 1][i] != 1) i++, continue;
| ^~~~~~~~
answer.code:31:45: error: expected primary-expression before ‘continue’
31 | if (a[i][y1 - 1] != 1) i++, continue;
| ^~~~~~~~
answer.code:40:45: error: expected primary-expression before ‘continue’
40 | if (a[i][y2 + 1] != 1) i++, continue;
| ^~~~~~~~