oj.uz

답안 #61835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61835 2018-07-26T19:19:04 Z theknife2001 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
26 / 100
 296 ms 52716 KB 
#include <bits/stdc++.h>

using namespace std;
const int N=1e6+5;
int a[N];
char b[N];
int c[N];
char s[N];
int cnt;
int k=0;


void Init() {}

void TypeLetter(char L) {
    a[k]=1;
    b[k]=L;
    k++;
}

void UndoCommands(int U) {
    a[k]=2;
    c[k]=U;
    k++;
}

char GetLetter(int P) {
    if(cnt==0)
    {
        int j=0;
        k--;
        while(k>=0)
        {
            if(a[k]==1)
            {
                s[j]=b[k];
                j++;
            }
            else if(a[k]==2)
            {
                k=k-c[k];
            }
            else
            {
                cout<<k<<endl;
                assert(0);
            }
            k--;
        }
        reverse(s,s+j);
    }
    cnt=1;
    return s[P];
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 2 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Incorrect 2 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 7092 KB Output is correct
2 Correct 175 ms 12296 KB Output is correct
3 Correct 169 ms 17016 KB Output is correct
4 Correct 255 ms 23648 KB Output is correct
5 Correct 224 ms 27944 KB Output is correct
6 Correct 184 ms 33500 KB Output is correct
7 Correct 296 ms 38188 KB Output is correct
8 Correct 234 ms 44288 KB Output is correct
9 Correct 236 ms 48012 KB Output is correct
10 Correct 202 ms 52716 KB Output is correct

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 193 ms 52716 KB Output isn't correct
2 Halted 0 ms 0 KB -