Submission #120071

#	Time	Username	Problem	Language	Result	Execution time	Memory
120071		tjd229	기억 압축 (JOI15_memory)	C++14	100 / 100	2318 ms	276876 KiB

memory

#include "Memory_lib.h"
const int sq6 = 64;
const int sq7 = 128;
int concat(int l,int r,int op,int mode) {
	return mode + (op << 2) + (r << 8) + (l << 15);
}
int Memory(int N, int M) {
	if (N & 1) return -2;
	
	int mode = M & 3; M >>= 2;
	int op = M & (sq6 - 1); M >>= 6;
	int r = M & (sq7 - 1); // i
	int l = M >> 7; //j
	if (r == N)
		return op ? -2 : -1;
	if (l >= N) return -2;

	char c = Get(l + 1);
	if (l == r) {
		++l;
		if (c == ']' || c == '>') {
			if (--op < 0) return -2;
			return concat(l,++r,op,mode);
		}
		else {
			mode = (c == '[') + 1;
			op = 1;
			return concat(l, r, op, mode);
		}
	}
	else {
		switch (c) {
		case '<':case '[':
			++op;
			break;
		case '>':
			--op;
			if (op < 0) return -2;
			if (l > r && op == 0) {
				if (mode != 1) return -2;
				return concat(0, ++r, op, 0);
			}
			break;
		case ']':
			--op;
			if (op < 0) return -2;
			if (l > r && op == 0) {
				if (mode != 2) return -2;
				return concat(0, ++r, op, 0);
			}
			break;
		}
		++l;
	}
	//op>50 chk
	if (op > (N >> 1)) return -2;
	return concat(l,r,op,mode);
}

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