Submission #56928

# Submission time Handle Problem Language Result Execution time Memory
56928 2018-07-13T08:25:01 Z 조민규(#2114) None (JOI15_memory) C++11
0 / 100
3115 ms 276916 KB
#include "Memory_lib.h"

const int spos_inf = (1 << 7) - 1;

inline int extract(int x, int off, int siz)
{
    return x >> off & (1 << siz) - 1;
}

int Memory(int N, int M) {
    if(N % 2 == 1)
        return -2;

    int cpos = extract(M, 0, 7);
    int spos = extract(M, 7, 7);
    int snum = extract(M, 14, 6);
    int ctyp = extract(M, 20, 1);
    int runs = extract(M, 21, 1);

    spos = ~spos & (1 << 7) - 1;

    if(cpos >= N || spos != spos_inf && (spos >= cpos || snum > N / 2))
        return -2;

    if(runs == 0)
    {
        if(spos == spos_inf)
        {
            char c = Get(cpos + 1);
            if(c == '<' || c == '[')
                cpos++;
            else
            {
                if(cpos == 0)
                    return -2;

                spos = cpos - 1;
                snum = 0;
                ctyp = (c == '>') ? 0 : 1;
            }
        }
        else
        {
            char c = Get(spos + 1);

            if(snum == 0)
            {
                if(c == '<' && ctyp == 0 || c == '[' && ctyp == 1)
                {
                    cpos++;
                    spos = spos_inf;
                }
                else
                    return -2;
            }
            else
            {
                if(spos == 0)
                    return -2;

                spos--;
                if(c == '<' || c == '[')
                    snum--;
                else
                    snum++;
            }
        }

        if(cpos == N)
        {
            cpos = 0;
            spos = spos_inf;
            runs = 1;
        }
    }
    else
    {
        if(spos == spos_inf)
        {
            char c = Get(N - cpos);
            if(c == '>' || c == ']')
                cpos++;
            else
            {
                if(cpos == 0)
                    return -2;

                spos = cpos - 1;
                snum = 0;
                ctyp = (c == '<') ? 0 : 1;
            }
        }
        else
        {
            char c = Get(N - spos);

            if(snum == 0)
            {
                if(c == '>' && ctyp == 0 || c == ']' && ctyp == 1)
                {
                    cpos++;
                    spos = spos_inf;
                }
                else
                    return -2;
            }
            else
            {
                if(spos == 0)
                    return -2;

                spos--;
                if(c == '>' || c == ']')
                    snum--;
                else
                    snum++;
            }
        }

        if(cpos == N)
            return -1;
    }

    spos = ~spos & (1 << 7) - 1;

    return cpos + (spos << 7) + (snum << 14) + (ctyp << 20) + (runs << 21);
}

Compilation message

memory.cpp: In function 'int extract(int, int, int)':
memory.cpp:7:34: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
     return x >> off & (1 << siz) - 1;
                       ~~~~~~~~~~~^~~
memory.cpp: In function 'int Memory(int, int)':
memory.cpp:20:29: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
     spos = ~spos & (1 << 7) - 1;
                    ~~~~~~~~~^~~
memory.cpp:22:38: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if(cpos >= N || spos != spos_inf && (spos >= cpos || snum > N / 2))
                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
memory.cpp:48:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                 if(c == '<' && ctyp == 0 || c == '[' && ctyp == 1)
                    ~~~~~~~~~^~~~~~~~~~~~
memory.cpp:99:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
                 if(c == '>' && ctyp == 0 || c == ']' && ctyp == 1)
                    ~~~~~~~~~^~~~~~~~~~~~
memory.cpp:124:29: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
     spos = ~spos & (1 << 7) - 1;
                    ~~~~~~~~~^~~
# Verdict Execution time Memory Grader output
1 Correct 3115 ms 276624 KB Output is correct
2 Correct 3100 ms 276780 KB Output is correct
3 Incorrect 2983 ms 276780 KB Wrong Answer [6]
# Verdict Execution time Memory Grader output
1 Correct 3115 ms 276624 KB Output is correct
2 Correct 3100 ms 276780 KB Output is correct
3 Incorrect 2983 ms 276780 KB Wrong Answer [6]
# Verdict Execution time Memory Grader output
1 Correct 3115 ms 276624 KB Output is correct
2 Correct 3100 ms 276780 KB Output is correct
3 Incorrect 2983 ms 276780 KB Wrong Answer [6]
# Verdict Execution time Memory Grader output
1 Correct 3115 ms 276624 KB Output is correct
2 Correct 3100 ms 276780 KB Output is correct
3 Incorrect 2983 ms 276780 KB Wrong Answer [6]
# Verdict Execution time Memory Grader output
1 Incorrect 3034 ms 276916 KB Wrong Answer [6]
# Verdict Execution time Memory Grader output
1 Correct 3115 ms 276624 KB Output is correct
2 Correct 3100 ms 276780 KB Output is correct
3 Incorrect 2983 ms 276780 KB Wrong Answer [6]