#include "treasure.h"
struct Node {
int x;
int y;
};
/*int nodecnt;
Node nodepool[10001];
Node* newnode(int px, int py) {
Node *tmp = newnode(px, py);
return &nodepool[nodecnt++];
}
struct List {
Node *head;
Node *tail;
void init() {
nodecnt = 0;
head = newnode(0, 0);
tail = newnode(0, 0);
head->next = tail;
}
};*/
Node ans[10001];
int idx = 0;
/*void func(int x1, int y1, int x2, int y2) {
if (x1 == x2 && y1 == y2) {
ans[idx].x = x1;
ans[idx].y = y1;
idx++;
}
if (countTreasure(x1, y1, x2 / 2, y2 / 2) != 0) {
}
else if (countTreasure(x1, y2 / 2, x2 / 2, y2) != 0) {
}
else if (countTreasure(x1 / 2, ))
}*/
void findTreasure(int N) {
int cnt = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
cnt = countTreasure(i, j, i, j);
if (cnt == 1) {
ans[idx].x = i;
ans[idx].y = j;
idx++;
}
}
}
for (int i = 0; i < idx; i++) {
Report(ans[i].x, ans[i].y);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
2 ms |
256 KB |
Output is partially correct - N = 5, K = 625, score = 1 |
| 2 |
Partially correct |
1 ms |
256 KB |
Output is partially correct - N = 10, K = 10000, score = 1 |
| 3 |
Partially correct |
1 ms |
376 KB |
Output is partially correct - N = 15, K = 50625, score = 1 |
| 4 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 16, K = 65536, score = 1 |
| 5 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 55, K = 9150625, score = 1 |
| 6 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 66, K = 18974736, score = 1 |
| 7 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 77, K = 35153041, score = 1 |
| 8 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 88, K = 59969536, score = 1 |
| 9 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 99, K = 96059601, score = 1 |
| 10 |
Partially correct |
2 ms |
376 KB |
Output is partially correct - N = 100, K = 100000000, score = 1 |
