oj.uz

Submission #70827

# Submission time Handle Problem Language Result Execution time Memory
70827 2018-08-23T13:51:23 Z MANcity Crayfish scrivener (IOI12_scrivener) C++14
34 / 100
 983 ms 73844 KB 
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<cstring>
#include<vector>
using namespace std;
#define for1(i,n) for(int i=1;i<=(int)n;i++)
#define for0(i,n) for(int i=0;i<=(int)n;i++)
#define forn(i,n) for(int i=n;i>=1;i--)
#define fo(i,x,y) for(int i=x;i<=(int)y;i++)
#define fr(i,x,y) for(int i=x;i>=(int)y;i--)
#define pb push_back
#define mp make_pair
#define LL long long
const LL Mod=1000*1000*1000+7;
char last;
int OP_NOW;
int letter_par[1000002];
int par[100002];
int up[1000002][30];
int height[1000002];
int maxhi=0;
int qan=0;
void Init() {}

void TypeLetter(char L) {
    OP_NOW++;
    qan++;
    par[OP_NOW]=qan;
    letter_par[qan]=(L-'a');
    height[qan]=height[par[OP_NOW-1]]+1;
    up[qan][0]=par[OP_NOW-1];
    for1(i,20)
        up[qan][i]=up[up[qan][i-1]][i-1];
     //cout<<OP_NOW<<" "<<qan<<endl;
}

void UndoCommands(int U) {
    OP_NOW++;
    par[OP_NOW]=par[OP_NOW-U-1];
    //cout<<OP_NOW<<" "<<qan<<endl;
}

char GetLetter(int P) {
    int N=height[par[OP_NOW]];
    //cout<<par[OP_NOW]<<endl;
    if((P+1)==N)
    {
        return (letter_par[par[OP_NOW]]+'a');
    }
    int pos=par[OP_NOW];
    //cout<<pos<<" "<<up[pos][0]<<" "<<up[pos][1]<<" "<<up[pos][2]<<" "<<up[pos][3]<<endl;
    fr(i,20,0)
    {
        //cout<<up[pos][i]<<" "<<height[up[pos][i]]<<endl;
        if(height[up[pos][i]]>=(P+1))
        {
            //cout<<i<<"dddd"<<endl;
            pos=up[pos][i];
        }
    }
    return (letter_par[pos]+'a');
}
/*
1000
T a
T b
T d
P 1

*/

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 764 KB Output is correct
2 Correct 6 ms 764 KB Output is correct
3 Correct 4 ms 892 KB Output is correct
4 Correct 4 ms 1020 KB Output is correct
5 Correct 5 ms 1020 KB Output is correct
6 Correct 4 ms 1020 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 4 ms 1024 KB Output is correct
9 Correct 4 ms 1024 KB Output is correct
10 Correct 4 ms 1024 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 715 ms 73844 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 983 ms 73844 KB Output isn't correct
2 Halted 0 ms 0 KB -