제출 #213408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
213408		Nucleist	크레이피쉬 글쓰는 기계 (IOI12_scrivener)	C++14	0 / 100	6 ms	768 KiB

scrivener

#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#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[1000001];
void Init() {
    cur = 0;
    sol[0] = nullptr;
}
void TypeLetter(char k)
{
	cur++;
	sol[cur] = new node(k);
	if(sol[cur-1]->s!=0)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)
	{
		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

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

scrivener.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
scrivener.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
scrivener.cpp: In function 'void UndoCommands(int)':
scrivener.cpp:59:9: warning: operation on 'cur' may be undefined [-Wsequence-point]
  sol[cur++]=sol[cur-u];
      ~~~^~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 40