oj.uz

Submission #213412

# Submission time Handle Problem Language Result Execution time Memory
213412 2020-03-25T18:12:59 Z Nucleist Crayfish scrivener (IOI12_scrivener) C++14
100 / 100
 761 ms 166776 KB 
#include <bits/stdc++.h> 
using namespace std; 
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
int cur;
struct node
{
	char let;
	int s;
	node *par[25];
	node(){ }
	node( char let ) : let( let ){
		for (int i = 0; i <= 19; ++i)
		{
			par[i]=nullptr;
		}
	}
};


node* sol[1000101];
void Init() {
    cur = 0;
    sol[0] = nullptr;
}
void TypeLetter(char k)
{
	++cur;
	sol[cur] = new node(k);
	if(sol[cur-1])sol[cur]->s=((sol[cur-1]->s)+1);
	else sol[cur]->s=1;
	sol[cur]->par[0]=sol[cur-1];
	for (int i = 1; i <= 19; ++i)
	{
		if( sol[cur]->par[i-1] )
		sol[cur]->par[i]=sol[cur]->par[i-1]->par[i-1];
	}
}
void UndoCommands(int u)
{
	sol[++cur]=sol[cur-u];
}
char GetLetter(int pos)
{
	int posi= sol[cur]->s - pos-1;
	node *nowi = sol[cur];
	for (int i = 19; i >= 0; --i)
	{
		if(posi >> i & 1)nowi=nowi->par[i];
	}
	return nowi->let;
}
//code the AC sol !
// BS/queue/map

Compilation message

scrivener.cpp: In function 'void UndoCommands(int)':
scrivener.cpp:57:6: warning: operation on 'cur' may be undefined [-Wsequence-point]
  sol[++cur]=sol[cur-u];
      ^~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 6 ms 768 KB Output is correct
4 Correct 6 ms 1024 KB Output is correct
5 Correct 7 ms 768 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 6 ms 1152 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 6 ms 1024 KB Output is correct
10 Correct 6 ms 768 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 136568 KB Output is correct
2 Correct 554 ms 150904 KB Output is correct
3 Correct 465 ms 148600 KB Output is correct
4 Correct 419 ms 119928 KB Output is correct
5 Correct 631 ms 129400 KB Output is correct
6 Correct 645 ms 163448 KB Output is correct
7 Correct 505 ms 81400 KB Output is correct
8 Correct 498 ms 121592 KB Output is correct
9 Correct 663 ms 166776 KB Output is correct
10 Correct 288 ms 122488 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 761 ms 116984 KB Output is correct
2 Correct 667 ms 104056 KB Output is correct
3 Correct 397 ms 114680 KB Output is correct
4 Correct 421 ms 86776 KB Output is correct
5 Correct 481 ms 124792 KB Output is correct
6 Correct 465 ms 117496 KB Output is correct
7 Correct 588 ms 125176 KB Output is correct
8 Correct 568 ms 61432 KB Output is correct
9 Correct 687 ms 107512 KB Output is correct
10 Correct 288 ms 121340 KB Output is correct