oj.uz

Submission #195697

# Submission time Handle Problem Language Result Execution time Memory
195697 2020-01-16T22:46:48 Z FieryPhoenix Crayfish scrivener (IOI12_scrivener) C++11
34 / 100
 1000 ms 83324 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <iomanip>
#include <deque>
#include <cassert>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <chrono>
#include <ctime>
#include <random>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <iterator>
#include <climits>
//#include "scrivener.h"
using namespace std;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007
 
int nex;
int length[1000001];
char c[1000001];
int anc[1000001][20];
bool started=false;
 
void calcAnc(int ind){
  for (int i=1;i<=19;i++){
    if (anc[ind][i-1]==-1)
      anc[ind][i]=-1;
    else
      anc[ind][i]=anc[anc[ind][i-1]][i-1];
  }
}
 
void Init(){
  for (int i=0;i<20;i++)
    anc[0][i]=-1;
}
 
void TypeLetter(char ch){
  if (!started){
    c[0]=ch;
    length[0]=1;
    nex++;
    started=true;
    return;
  }
  length[nex]=length[nex-1]+1;
  c[nex]=ch;
  anc[nex][0]=nex-1;
  calcAnc(nex);
  nex++;
}
 
void UndoCommands(int x){
  length[nex]=length[nex-x-1];
  c[nex]=c[nex-x-1];
  anc[nex][0]=anc[nex-x-1][0];
  calcAnc(nex);
  nex++;
}
 
char GetLetter(int ind){
  ind=length[nex-1]-1-ind;
  int cur=nex-1;
  for (int i=19;i>=0;i--){
    if (((1<<i)&ind)!=0)
      cur=anc[cur][i];
  }
  return c[cur];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 4 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 4 ms 760 KB Output is correct
10 Correct 4 ms 760 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 60572 KB Output is correct
2 Correct 684 ms 77052 KB Output is correct
3 Correct 487 ms 77296 KB Output is correct
4 Correct 535 ms 82280 KB Output is correct
5 Correct 526 ms 71836 KB Output is correct
6 Correct 463 ms 83324 KB Output is correct
7 Execution timed out 1055 ms 67828 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 710 ms 55980 KB Output is correct
2 Correct 886 ms 52820 KB Output is correct
3 Correct 484 ms 65884 KB Output is correct
4 Correct 580 ms 59004 KB Output is correct
5 Correct 631 ms 74920 KB Output is correct
6 Correct 530 ms 77168 KB Output is correct
7 Correct 506 ms 77176 KB Output is correct
8 Correct 967 ms 66888 KB Output is correct
9 Execution timed out 1053 ms 57928 KB Time limit exceeded
10 Halted 0 ms 0 KB -