제출 #914369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
914369		VMaksimoski008	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	12 / 100	299 ms	62800 KiB

scrivener

#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;
// }

컴파일 시 표준 에러 (stderr) 메시지

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 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40