| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 555927 | rainboy | 기억 압축 (JOI15_memory) | C11 | 0 ms | 284 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 "Memory_lib.h"
#define N 101
int min(int a, int b) { return a < b ? a : b; }
int code(char c) {
if (c == '<')
return 0;
if (c == '>')
return 1;
if (c == '[')
return 2;
return 3;
}
int Memory(int n, int x) {
int i, c, c_, d_, d, a, a_;
if (x == 0)
return ((0 * N + 0) * N + 0) * 4 + 1;
c_ = x / 4 / N / N, i = x / 4 / N % N, d_ = x / 4 % N, a_ = x % 4;
a = code(Get(i + 1)), d = d_ + ((a & 1) == 0 ? 1 : -1);
if (d < 0)
return -1;
c = min(d_, d), d_ = d;
if (c == c_) {
if ((a_ & 1) != 0 && (a & 1) != 0 || (a_ & 1) == 0 && (a ^ a_) != 1)
return -1;
a_ = a;
}
if (i + 1 < n)
return ((c_ * N + (i + 1)) * N + d_) * 4 + a_;
else {
if (d != 0 || (a_ & 1) == 0)
return -1;
if (c_ + 1 == N)
return -2;
return (((c_ + 1) * N + 0) * N + 0) * 4 + 1;
}
}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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
