# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173501 | sleepntsheep | Triangles (CEOI18_tri) | C11 | 1 ms | 832 KiB |
#include <stdio.h>
#include "trilib.h"
#include <string.h>
#include <stdlib.h>
int sta[55555], top, n, low[55555], q, w, a[55555], b[55555], c, d, ch_high[55555], ch_low[55555], cha, chb
, sta2[55555], top2;
int cmp_high(const void *ii, const void *jj) {
return is_clockwise(q, *(int*)ii, *(int*)jj) ? -1 : 1;
}
int cmp_low(const void *ii, const void *jj) {
return is_clockwise(q, *(int*)ii, *(int*)jj) ? -1 : 1;
}
int main() {
n = get_n();
q = 1;
w = 2;
for (int i = 3; i <= n; ++i) {
if (is_clockwise(q, w, i)) {
low[i] = 1;
a[c++] = i;
} else {
low[i] = 0;
b[d++] = i;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |