oj.uz

Submission #914375

# Submission time Handle Problem Language Result Execution time Memory
914375 2024-01-21T19:14:13 Z VMaksimoski008 Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 770 ms 91104 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=0;
char s[maxn];
int 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];
}

void UndoCommands(int u) {
    int prev = (++id) - u - 1;
    s[id] = s[prev];
    len[id] = len[prev];

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

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

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 2396 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

# Verdict Execution time Memory 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 2392 KB Output is correct
7 Correct 1 ms 2392 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 #3
22.0 / 22.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 64092 KB Output is correct
2 Correct 385 ms 82424 KB Output is correct
3 Correct 304 ms 81236 KB Output is correct
4 Correct 347 ms 86768 KB Output is correct
5 Correct 327 ms 77436 KB Output is correct
6 Correct 299 ms 88808 KB Output is correct
7 Correct 714 ms 78816 KB Output is correct
8 Correct 770 ms 86096 KB Output is correct
9 Correct 351 ms 83120 KB Output is correct
10 Correct 214 ms 90784 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 60244 KB Output is correct
2 Correct 364 ms 57404 KB Output is correct
3 Correct 289 ms 69608 KB Output is correct
4 Correct 315 ms 63408 KB Output is correct
5 Correct 305 ms 79184 KB Output is correct
6 Correct 364 ms 83344 KB Output is correct
7 Correct 335 ms 81140 KB Output is correct
8 Correct 681 ms 72396 KB Output is correct
9 Correct 709 ms 70012 KB Output is correct
10 Correct 207 ms 91104 KB Output is correct