# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
71607 |
2018-08-25T08:31:29 Z |
윤교준(#2220) |
행성 탐사 (GA8_planet) |
C++11 |
|
165 ms |
1228 KB |
#include "planet.h"
#include <bits/stdc++.h>
using namespace std;
int rd(int s, int e) { return rand() % (e-s+1) + s; }
inline int f(int i) {
if(i < 0) return 2222+i;
if(2222 <= i) return i-2222;
return i;
}
void ainta() {
for(int i = 0; i < 104; i++) paint(f(-i), f(-i));
}
void sangsoo() {
srand(time(0));
int dx = rd(0, 2221), dy = rd(0, 2221);
int x = -1, y = -1, ll = -1;
{
int i = 0;
for(int t;; i++) {
t = count_row(f(i*(i+1)/2 + dx));
if(t) break;
}
int s = i*(i+1)/2 + dx, e = s+i + dx;
for(int m; s < e;) {
m = (s+e+1) >> 1; i++;
if(count_row(f(m))) s = m;
else e = m-1;
}
x = s;
ll = i+1;
}
{
int i = 0, idx = dy;
for(int t;; i++) {
t = count_col(f(idx));
if(t) break;
idx += ll+i+1;
}
int s = idx, e = idx+ll+i;
for(int m; s < e;) {
m = (s+e+1) >> 1;
if(count_col(f(m))) s = m;
else e = m-1;
}
y = s;
}
report(f(x), f(y));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
109 ms |
988 KB |
Output is partially correct: max_calls = 108 |
2 |
Partially correct |
103 ms |
1008 KB |
Output is partially correct: max_calls = 109 |
3 |
Partially correct |
115 ms |
1068 KB |
Output is partially correct: max_calls = 109 |
4 |
Partially correct |
113 ms |
1212 KB |
Output is partially correct: max_calls = 109 |
5 |
Partially correct |
118 ms |
1212 KB |
Output is partially correct: max_calls = 109 |
6 |
Partially correct |
126 ms |
1212 KB |
Output is partially correct: max_calls = 110 |
7 |
Partially correct |
115 ms |
1212 KB |
Output is partially correct: max_calls = 109 |
8 |
Partially correct |
117 ms |
1212 KB |
Output is partially correct: max_calls = 109 |
9 |
Partially correct |
121 ms |
1212 KB |
Output is partially correct: max_calls = 108 |
10 |
Partially correct |
138 ms |
1228 KB |
Output is partially correct: max_calls = 108 |
11 |
Partially correct |
114 ms |
1228 KB |
Output is partially correct: max_calls = 109 |
12 |
Partially correct |
120 ms |
1228 KB |
Output is partially correct: max_calls = 110 |
13 |
Partially correct |
110 ms |
1228 KB |
Output is partially correct: max_calls = 110 |
14 |
Partially correct |
165 ms |
1228 KB |
Output is partially correct: max_calls = 110 |
15 |
Partially correct |
113 ms |
1228 KB |
Output is partially correct: max_calls = 110 |
16 |
Partially correct |
107 ms |
1228 KB |
Output is partially correct: max_calls = 109 |
17 |
Runtime error |
43 ms |
1228 KB |
Execution failed because the return code was nonzero |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
4 ms |
1228 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |