# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
7538 |
2014-08-10T13:59:04 Z |
kipa00 |
행성 탐사 (GA8_planet) |
C++ |
|
3000 ms |
1756 KB |
#include "planet.h"
//야! 내가 멍청이다!
int cr(int a) {
return count_row((a + 4444) % 2222);
}
int cc(int a) {
return count_col((a + 4444) % 2222);
}
//열심히 색칠하시는 분
void ainta() {
int i;
paint(0, 0);
for (i=2; i<=1112; i+=2) {
paint(i, 0);
paint(0, i);
}
}
//열심히 종횡조사하시는 분
void sangsoo() {
int i, x = -1, y = -1, ok = 0;
for (i=0; ok < 3; i+=3) {
if (x >= 0) {
if (ok & 2) cr(x);
else {
int temp = cr(x);
if (temp <= 1) {
x += 1;
} else {
ok |= 2;
}
}
} else {
int r = cr(-i);
if (r > 1) {
x = -i + 4444;
ok |= 2;
} else if (r == 1) {
x = (-i * 5 / 3 - 2) + 4444;
}
}
if (y >= 0) {
if (ok & 1) cc(y);
else {
int temp = cc(y);
if (temp <= 1) {
y += 1;
} else {
ok |= 1;
}
}
} else {
int c = cc(-i);
if (c > 1) {
y = -i + 4444;
ok |= 1;
} else if (c == 1) {
y = (-i * 5 / 3 - 2) + 4444;
}
}
}
report(x % 2222, y % 2222);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
2 |
Partially correct |
584 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
3 |
Partially correct |
584 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
4 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
5 |
Partially correct |
580 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
6 |
Partially correct |
592 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
7 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
8 |
Partially correct |
580 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
9 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
10 |
Partially correct |
584 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
11 |
Partially correct |
596 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
12 |
Partially correct |
584 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
13 |
Partially correct |
580 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
14 |
Partially correct |
580 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
15 |
Partially correct |
592 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
16 |
Partially correct |
592 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
17 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
18 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
19 |
Partially correct |
588 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
20 |
Partially correct |
684 ms |
1756 KB |
Output is partially correct : max_calls = 1113 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3000 ms |
1752 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |