oj.uz

답안 #914369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914369 2024-01-21T18:56:34 Z VMaksimoski008 크레이피쉬 글쓰는 기계 (IOI12_scrivener) C++14
12 / 100
 299 ms 62800 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 21;
const int maxn = 1e6 + 5;
const double eps = 1e-9;

int up[maxn][LOG], id = 1;
char s[maxn], len[maxn];

void Init() {
    s[0] = ' ';
}

void TypeLetter(char ch) {
    s[id] = ch;
    len[id] = len[id-1] + 1;

    up[id][0] = id - 1;
    for(int i=1; i<LOG; i++) up[id][i] = up[ up[id][i-1] ][i-1];

    id++;
}

void UndoCommands(int U) {
    int p = id - U - 1;
    s[id] = s[p];
    len[id] = len[p];

    up[id][0] = up[p][0];
    for(int i=1; i<LOG; i++) up[id][i] = up[ up[id][i-1] ][i-1];

    id++;
}

char GetLetter(int p) {
    int L = len[id-1]-p-1, pos = id-1;
    for(int i=LOG-1; i>=0; i--)
        if(L & (1 << i)) pos = up[pos][i];
	return s[pos];
}

// int main() {
//     Init();

//     TypeLetter('a');
//     cout << s[id-1] << " ";

//     TypeLetter('b');
//     cout << s[id-1] << " ";

//     TypeLetter('c');
//     cout << s[id-1] << " ";

//     UndoCommands(2);
//     cout << s[id-1] << " ";

//     UndoCommands(1);
//     cout << s[id-1] << " ";

//     return 0;
// }

Compilation message

scrivener.cpp: In function 'char GetLetter(int)':
scrivener.cpp:54:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   54 |     for(int i=LOG-1; i>=0; i--)
      |     ^~~
scrivener.cpp:56:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   56 |  return s[pos];
      |  ^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2400 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 278 ms 62800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 299 ms 56660 KB Output isn't correct
2 Halted 0 ms 0 KB -