제출 #774716

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
774716		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	1244 ms	810160 KiB

Main

//Judges with GCC >= 12 only needs Ofast
//#pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
//MLE optimization
//#pragma GCC optimize("conserve-stack")
//Old judges
//#pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
//New judges. Test with assert(__builtin_cpu_supports("avx2"));
//#pragma GCC target("arch=skylake")
//Atcoder
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

//write variables and debug
#define bugf cout << "Here" << endl
#define bug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define bugarr(arr,...) cout << #arr; _dbg_arr(arr, __VA_ARGS__)

template<class T, class U>
ostream& operator<<(ostream& output, const pair<T, U> &A){
	output << "(" << A.first << ", " << A.second <<  ")";
	return output;
}

template <class T>
ostream& operator<<(ostream& output, const vector<T> &arr){
	int n = arr.size();
	output << "[";
	for(int i = 0; i < n; i++){
		output << arr[i];
		if(i != n - 1) output << ", ";
	}
	output << "]";
	return output;
}

template<class T>
ostream& operator<<(ostream& output, const set<T> &s){
	output << "{";
	for(auto it = s.begin(); it != s.end(); it++){
		if(it != s.begin()) output << ", ";
		output << (*it);
	}
	output << "}";
	return output;
}

template<class T, class U>
ostream& operator<<(ostream& output, const map<T, U> &m){
	output << "{";
	for(auto it = m.begin(); it != m.end(); it++){
		if(it != m.begin()) output << ", ";
		output << "(" << it->first << " : " << it->second << ")";
	}
	output << "}";
	return output;
}

template<class TH>
void _dbg(const char *sdbg, TH h){
	cout << sdbg << " = " << h << endl;
}

template<class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
	while(*sdbg != ',')cout << *sdbg++;
	cout << " = " << h << "\n";
	_dbg(sdbg+1, a...);
}

template<class _Arr, class _Index>
void _dbg_arr(_Arr arr, _Index index){
	cout << '[' << index << "] = " << arr[index] << endl;
}

template<class _Arr, class _Index, class... TA>
void _dbg_arr(_Arr &arr, _Index index, TA... args){
	cout << '[' << index << ']';
	_dbg_arr(arr[index], args...);
}

//open file
#define taskname "" //name input and output file

#ifdef SteGG
void open(){
	if(fopen("input.inp", "r")){
		freopen("input.inp", "r", stdin);
		//freopen("output.out", "w", stdout);
	}
}
#else
void open(){
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
		freopen(taskname".out", "w", stdout);
	}
}
#endif

//initialize
#define testcase \
	long long test; \
	cin >> test; \
	for(int tst = 1; tst <= test; tst++)
#define int long long
#define MOD 1000000007
#define FFTMOD (119 << 23 | 1)
#define EPSILON 1e-9
#define setpre(x) fixed << setprecision(x)
#define cd complex<double>
#define all(x) x.begin(), x.end()

const long long INF = 3e18L + 5;
const int inf = 1e9 + 7;
const double infd = 1e60;
const double PI = acos(-1);
const int maxn = 1e5 + 5;
const int block = 500;
//const int base = ;
int n;
int A[2*maxn];
set<int> transformNumber;
map<int, int> changeToIndex;
int changeToNumber[2*maxn];
int cnt_transform;
int last[block][2*maxn];
int damn[block];

//others struct or class

//others function

//others init

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	open();
	cin >> n;
	cnt_transform = 0;
	for(int i = 0; i < n; i++){
		cin >> A[i];
		transformNumber.insert(A[i]);
	}
	
	for(int number : transformNumber){
		changeToIndex[number] = ++cnt_transform;
		changeToNumber[cnt_transform] = number;
	}

	for(int i = 0; i < n; i++){
		A[i] = changeToIndex[A[i]];
	}

	memset(last, -1, sizeof(last));

	for(int i = 0; i < n; i++){
		last[i / block][A[i]] = max(last[i / block][A[i]], i);
	}

	for(int i = 1; i < n; i++){
		int pos_block = i / block;
		int first = pos_block * block;
		int highest = -1;
		for(int j = i - 1; j >= first; j--){
			if(A[j] == A[i]){
				highest = j;
				break;
			}
		}

		if(highest != -1){
			for(int j = highest + 1; j < i; j++){
				last[pos_block][A[j]] = -1;
				A[j] = A[i];
			}
		}else{
			for(int j = pos_block - 1; j >= 0; j--){
				if(damn[j] != 0 && damn[j] != A[i]) continue;
				if(last[j][A[i]] == -1) continue;
				int last_pos = last[j][A[i]];
				
				for(int k = last_pos; k < j * block + block; k++){
					last[j][A[k]] = -1;
					A[k] = A[i];
				}

				for(int k = j * block; k < last_pos; k++){
					last[j][A[k]] = max(last[j][A[k]], k);
				}

				for(int k = j + 1; k < pos_block; k++){
					damn[k] = A[i];
					last[k][A[i]] = (k + 1) * block - 1;
				}

				for(int j = first; j < i; j++){
					last[pos_block][A[j]] = -1;
					A[j] = A[i];
				}
				break;
			}
		}
	}

	for(int i = 0; i < n; i++){
		if(damn[i / block] != 0) A[i] = damn[i / block];
		cout << changeToNumber[A[i]] << endl;
	}

	return 0;
}

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

Main.cpp: In function 'void open()':
Main.cpp:101:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:102:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |   freopen(taskname".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40