# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636978 | abeker | Homework (CEOI22_homework) | C11 | 214 ms | 143088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
#define MAX 1000005
typedef struct _Node {
int dp[2];
int size, type;
struct _Node *left, *right;
} Node;
int N;
int can[MAX];
char input[10 * MAX];
Node* parse(char** str) {
Node* res = malloc(sizeof(Node));
if (**str == 'm') {
res -> type = *(*str + 1) == 'a';
*str += 4;
res -> left = parse(str);
*str += 1;
res -> right = parse(str);
res -> size = res -> left -> size + res -> right -> size;
}
else {
res -> type = -1;
res -> size = 1;
}
*str += 1;
return res;
Compilation message (stderr)
# | 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... |