제출 #1156134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156134		modwwe	기억 압축 (JOI15_memory)	C++20	0 / 100	0 ms	324 KiB

memory

#include "Memory_lib.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
///#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 998244353;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9;
int kk;
int t;
int el = 19;/*
main()
{
    if(fopen(task2".inp","r"))
    {
        fin(task2);
        fou(task2);
    }
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    /// cin>>s1;
//int t;cin>>t; while(t--)
    phongbeo();
    //  checktime
}*/
string s;
vector<int> encode(int x)
{
    vector<int> v;
    while(x!=0)
    {
        v.pb(x%10);
        x/=10;
    }
    reverse(v.begin(),v.end());
    return v;
}
/// >n/2 => return -2
/*
char get(int x)
{
    return s[x-1];
}*/
int Memory(int N,int M)
{
    n=N;
    m=M;
    vector<int> v=encode(m);
    if(m==0)
    {
        s2=1;
        s3=0;
        s4=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;
}/*
void phongbeo()
{
    cin>>n>>k;
    cin>>s;
    cout<<Memory(n,2040001);
}*/

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