Submission #213324

#	Time	Username	Problem	Language	Result	Execution time	Memory
213324		zimpha	기억 압축 (JOI15_memory)	C++17	100 / 100	2865 ms	283644 KiB

memory

#include "Memory_lib.h"
/*
#include <cstdio>
#include <cstring>

char s[1000];

char Get(int i) {
  return s[i - 1];
}
*/

int Memory(int N, int M) {
  if (N % 2 == 1) return -2;
  int call = M % (1 << 13);
  int d = call / N + 1, i = call % N;
  if (d > N / 2) return -1;
  int cnt = (M >> 13) % (1 << 7);
  int rec = (M >> 20);
  if (cnt > N / 2) return -2;
  char c = Get(i + 1);
  if (c == '<' || c == '[') {
    ++cnt;
    if (cnt == d) rec = (c == '<');
  } else {
    if (cnt == d) {
      if (rec && c != '>') return -2;
      if (!rec && c != ']') return -2;
    }
    cnt--;
  }
  if (cnt < 0) return -2;
  if (i == N - 1 && cnt != 0) return -2;
  call++;
  return call + (cnt << 13) + (rec << 20);
}
/*
int main() {
  scanf("%s", s);
  int n = strlen(s);
  int m = 0;
  int cnt = 0;
  for (; cnt < 15000; ++cnt) {
    m = Memory(n, m);
    if (m < 0) break;
  }
  printf("%d\n", m);
  return 0;
}*/

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 60 / 60