제출 #382331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382331		ParsaAlizadeh	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++17	34 / 100	1091 ms	40540 KiB

scrivener

#include <bits/stdc++.h>
using namespace std;

typedef long long       ll;
typedef pair<ll, ll>    pll;
typedef pair<int, int>  pii;

#define all(x)          x.begin(), x.end()
#define kill(x)         return cout << x << endl, 0
#define X               first
#define Y               second
//#define endl            '\n'

constexpr ll pw(ll a, ll b, ll mod) {
    return (!b    ? 1 :
            b & 1 ? a * pw(a * a % mod, b / 2, mod) % mod :
                    pw(a * a % mod, b / 2, mod));
}

constexpr int N   = 1e6 + 10;
constexpr int MOD = 1e9 + 7;
constexpr ll INF  = 1e18;

int cur, par[N], prv[N], sz[N];
char C[N];
string ans;

void Init() {
    
}

void TypeLetter(char L) {
    cur++;
    C[cur] = L;
    par[cur] = cur - 1;
    prv[cur] = cur;
    sz[cur] = sz[par[cur]] + 1;
}

void UndoCommands(int U) {
    cur++;
    C[cur] = 'U';
    par[cur] = cur - U - 1;
    prv[cur] = prv[par[cur]];
    sz[cur] = sz[par[cur]];
}

char GetLetter(int P) {
    if (true || ans.size() != sz[cur]) {
        for (int tmp = prv[cur]; tmp > 0; tmp = prv[par[tmp]]) {
            ans.push_back(C[tmp]);
            //cerr << tmp << ' ' << par[tmp] << endl;
        }
        reverse(all(ans));
    }
    return ans[P];
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 22 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40