oj.uz

Submission #133798

# Submission time Handle Problem Language Result Execution time Memory
133798 2019-07-21T11:41:09 Z claudy Crayfish scrivener (IOI12_scrivener) C++14
12 / 100
 445 ms 109716 KB 
//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//# pragma GCC optimize("Ofast")
//# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;

char val[1 << 20];
int p[1 << 20][20];
vector<int>vec;
int curr,k;
int dep[1 << 20];
int nxt[1 << 20][26];

void Init()
{
	vec.pb(0);
}

void TypeLetter(char L)
{
	int x;
	if(!nxt[curr][L - 'a']) x = ++k;
	else x = nxt[curr][L - 'a'];
	nxt[curr][L - 'a'] = x;
	dep[x] = dep[curr] + 1;
	val[x] = L;
	vec.pb(x);
	p[x][0] = curr;
	for(int i = 1;i <= 20;i++)
	{
		p[x][i] = p[p[x][i - 1]][i - 1];
	}
	curr = x;
}

void UndoCommands(int U)
{
	curr = vec[sz(vec) - U - 1];
	vec.pb(curr);
}

char GetLetter(int P)
{
	int y = dep[curr] - P - 1;
	int x = curr;
	for(int i = 0;i <= 20;i++)
	{
		if(y & (1 << i))
		{
			x = p[x][i];
		}
	}
	return val[x];
}

Compilation message

scrivener.cpp: In function 'void TypeLetter(char)':
scrivener.cpp:49:11: warning: iteration 19 invokes undefined behavior [-Waggressive-loop-optimizations]
   p[x][i] = p[p[x][i - 1]][i - 1];
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
scrivener.cpp:47:18: note: within this loop
  for(int i = 1;i <= 20;i++)
                ~~^~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 12 ms 348 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 400 ms 109716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 445 ms 93020 KB Output isn't correct
2 Halted 0 ms 0 KB -