oj.uz

Submission #114950

# Submission time Handle Problem Language Result Execution time Memory
114950 2019-06-04T06:33:56 Z zoooma13 Crayfish scrivener (IOI12_scrivener) C++14
12 / 100
 816 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

//#include "grader.cpp"

#define MAX_N 5003

struct command{
    bool add;
    string x;
};

string curr_text = "";

int curr_comm;
vector <command> last[5003];

void Init(){
    curr_text = "";
    curr_comm = 0;
}

void TypeLetter(char L){
    curr_text += L;
    last[++curr_comm].push_back({1 ,string(1 ,L)});
    //cout << curr_comm << " " << curr_text << endl;
}

void UndoCommands(int U){
    ++curr_comm;
    for(int i=curr_comm-1; i>=curr_comm-U; i--){
        for(command&c : last[i]){
            if(!c.add)
                curr_text += c.x;
            else
                curr_text = curr_text.substr(0 ,curr_text.size()-c.x.size());
            last[curr_comm].push_back({!c.add ,c.x});
        }
    }
    reverse(last[curr_comm].begin() ,last[curr_comm].end());
    //cout << curr_comm << " " << curr_text << endl;
}

char GetLetter(int P){
    return curr_text[P];
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 816 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -