oj.uz

Submission #119826

# Submission time Handle Problem Language Result Execution time Memory
119826 2019-06-22T13:08:17 Z dolphingarlic Crayfish scrivener (IOI12_scrivener) C++14
0 / 100
 1000 ms 253496 KB 
#include <bits/stdc++.h>
using namespace std;

pair<char, char> v[1000001];
string s, t;
int indx = 0;
bool got = false;

void get() {
  int ptr = indx - 1;
  while (ptr != -1) {
    while (ptr != -1 && v[ptr].first == 'U') ptr -= (int)v[ptr].second + 1;
    s += v[ptr--].second;
  }
  for (int i = 0; i < s.size(); i++) t[i] = s[s.size() - 1 - i]; 
}

void Init() {
}

void TypeLetter(char L) {
  v[indx++] = {'T', L};
}

void UndoCommands(int U) {
  v[indx++] = {'U', (char)U};
}

char GetLetter(int P) {
  if (!got) {
    get();
    got = true;
  }
  return t[P];
}

// int main() {
//   int t;
//   cin >> t;
//   for (int i = 0; i < t; i++) {
//     char c, d; int e;
//     cin >> c;
//     switch (c) {
//       case 'T':
//         cin >> d;
//         TypeLetter(d);
//         break;
//       case 'P':
        
//         cin >> e;
//         cout << GetLetter(e) << '\n';
//         break;
//       default:
//         cin >> e;
//         UndoCommands(e);
//     }
//   }
// }

Compilation message

scrivener.cpp: In function 'void get()':
scrivener.cpp:16:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.size(); i++) t[i] = s[s.size() - 1 - i]; 
                   ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (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 Execution timed out 1080 ms 253496 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

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