#include "coloring.h"
int next[101];
int prev[101];
int chk[101];
int n;
int list[101];
int findprev(int x, int *l, int n) {
int f=1, r=n;
while (f<r) {
int m = (f + r + 1) / 2;
for (int i = f; i < m; i++) Color(l[i]);
if(GetColor(x) == 0) r = m - 1;
else f = m;
}
return l[f];
}
void ColoringSame(int N){
n = N;
int x = 1;
chk[1] = 1;
for (int i = 1; i < n; i++) list[i] = i+1;
int s = n-1;
for (int i = 1; i <= 10 && i < n; i++) {
prev[x] = findprev(x, list, s);
next[prev[x]] = x;
x = prev[x];
chk[x] = 1;
int j;
for (j = 1; list[j] != x; j++);
for (; j < s; j++) list[j] = list[j + 1];
s--;
}
Color(1);
for (int i = 1; i <= N-29; i++) {
for (int j = 1; j <= N; j++) {
if (!chk[j]) Color(j);
}
}
while (x != 1) {
Color(x);
x = next[x];
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1124 KB |
Output is correct |
2 |
Correct |
0 ms |
1124 KB |
Output is correct |
3 |
Correct |
0 ms |
1124 KB |
Output is correct |
4 |
Correct |
0 ms |
1124 KB |
Output is correct |
5 |
Correct |
0 ms |
1124 KB |
Output is correct |
6 |
Incorrect |
0 ms |
1124 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |