Submission #1156144

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156144		modwwe	기억 압축 (JOI15_memory)	C++20	0 / 100	1 ms	324 KiB

memory

#include "Memory_lib.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
int Memory(int N, int M);
int s2,s3,s4;/*
#define MAX_N 100
#define FORMAT_S "%101s"
#define LENGTH_S 102
#define LIMIT_M 4194304  // 2^22
#define MAX_NUM_DAYS 15000

static int N, Q;
static char S[LENGTH_S];

static void Wrong(int message)
{
    printf("Wrong Answer [%d]\n", message);
    exit(0);
}

static int get_called;
static int get_I;

char Get(int I)
{
    if (get_called)
    {
        Wrong(2);
    }
    get_called = 1;
    get_I = I;
    if (!(1 <= I && I <= N))
    {
        Wrong(3);
    }
    return S[I - 1];
}*/
vector<int> encode(int x)
{
    vector<int> v;
    while(x!=0)
    {
        v.pb(x%10);
        x/=10;
    }
    reverse(v.begin(),v.end());
    return v;
}
int n,m;
int Memory(int N,int M)
{
    n=N;
    m=M;
    vector<int> v=encode(m);
    if(m==0)
    {
        s2=1;
        s3=0;
        s4=0;
        //    exit(0);
    }
    else
    {
        s2=v[0]*100+v[1]*10+v[2];
        s3=v[3]*10+v[4];
        s4=v[5]*10+v[6];
        if(v[0]==2)s2-=200;
    }
    char x=Get(s2);
    if(x=='>')s3--;
    if(x==']')s4--;
    if(x=='<')s3++;
    if(x=='[')s4++;
    if(s3<0||s4<0||s3>n/2||s4>n/2)return -2;
    s2++;
    if(s2==n+1)
    {
        if(s3==0&&s4==0)return -1;
        return -2;
    }
    if(s2<100)
    {
        s2+=200;
    }
    return (s2*100+s3)*100+s4;
}/*
int main(void)
{
    freopen("test.inp","r",stdin);
    freopen("test.out","w",stdout);
    int M;
    int test_index;
    int num_days;

    if (scanf("%d%d", &N, &Q) != 2)
    {
        fprintf(stderr, "error: cannot read N, Q\n");
        exit(1);
    }
    if (!(1 <= N && N <= MAX_N))
    {
        fprintf(stderr, "error: N is out of bounds\n");
        exit(1);
    }
    if (Q < 0)
    {
        fprintf(stderr, "error: Q is out of bounds\n");
        exit(1);
    }

    for (test_index = 0; test_index < Q; ++test_index)
    {
        if (scanf(FORMAT_S, S) != 1)
        {
            fprintf(stderr, "error: cannot read S\n");
            exit(1);
        }
        if (N != (int)strlen(S))
        {
            fprintf(stderr, "error: the length of S is not N\n");
            exit(1);
        }
        num_days = 0;
        M = 0;
        for (; ; )
        {
            get_called = 0;
            get_I = 0;
            M = Memory(N, M);
            if (!((0 <= M && M < LIMIT_M) || M == -1 || M == -2))
            {
                Wrong(1);
            }
            if (M == -1 || M == -2)
            {
                break;
            }
            if (++num_days >= MAX_NUM_DAYS)
            {
                Wrong(5);
            }
        }
        printf("%d\n", M);
    }

    return 0;
}*/

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