oj.uz

답안 #62922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62922 2018-07-30T20:37:11 Z theknife2001 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++17
34 / 100
 1000 ms 262068 KB 
#include <bits/stdc++.h>


using namespace std;
const int N=1e6+55;
int trie[N*2][26];
char letter[N];
int p[N][22];
int a[N];
int l[N];
int node;
int cnt=1;
int k=0;

void Init()
{
    node=cnt++;
    memset(trie,-1,sizeof trie);
}

int c,temp,nd;
void TypeLetter(char L)
{
    c=L-'a';
    temp=node;
    if(trie[node][c]==-1)
        trie[node][c]=cnt++;
    node=trie[node][c];
    letter[node]=L;
    a[k]=node;
    if(k!=0)
        l[k]=l[k-1]+1;
    else
        l[k]=1;
    if(p[node][0]==0)
    {
        p[node][0]=temp;
  //      for(int i=1;i<21;i++)
//        {
//            p[node][i]=p[p[node][i-1]][i-1];
  //          if(p[node][i]==0)
    //            break;
      //  }
    }
    k++;
}

void UndoCommands(int U)
{
    node=a[k-U-1];
    l[k]=l[k-U-1];
    a[k]=node;
    k++;
}
char GetLetter(int P)
{
    P=l[k-1]-P-1;
    nd=node;
  	while(P--)
      nd=p[nd][0];
    //for(int i=20;i>=0;i--)
    //{
        //if((P&(1<<i)))
      //      nd=p[nd][i];
    //}
    return letter[nd];
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 203896 KB Output is correct
2 Correct 161 ms 203896 KB Output is correct
3 Correct 169 ms 203940 KB Output is correct
4 Correct 172 ms 204172 KB Output is correct
5 Correct 169 ms 204172 KB Output is correct
6 Correct 179 ms 204172 KB Output is correct
7 Correct 169 ms 204284 KB Output is correct
8 Correct 174 ms 204284 KB Output is correct
9 Correct 171 ms 204284 KB Output is correct
10 Correct 177 ms 204284 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 204284 KB Output is correct
2 Correct 172 ms 204284 KB Output is correct
3 Correct 225 ms 204284 KB Output is correct
4 Correct 169 ms 204284 KB Output is correct
5 Correct 154 ms 204284 KB Output is correct
6 Correct 169 ms 204300 KB Output is correct
7 Correct 172 ms 204300 KB Output is correct
8 Correct 172 ms 204300 KB Output is correct
9 Correct 164 ms 204300 KB Output is correct
10 Correct 162 ms 204300 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 165 ms 204596 KB Output is correct
2 Correct 171 ms 204596 KB Output is correct
3 Correct 182 ms 204596 KB Output is correct
4 Correct 179 ms 204596 KB Output is correct
5 Correct 186 ms 204596 KB Output is correct
6 Correct 184 ms 204752 KB Output is correct
7 Correct 167 ms 204752 KB Output is correct
8 Correct 163 ms 204752 KB Output is correct
9 Correct 191 ms 204752 KB Output is correct
10 Correct 177 ms 204752 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1089 ms 262068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1100 ms 262068 KB Time limit exceeded
2 Halted 0 ms 0 KB -