답안 #789555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789555 2023-07-21T13:37:24 Z temporary_juggernaut Nice sequence (IZhO18_sequence) C++14
컴파일 오류
0 ms 0 KB
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int n, m;
int timer, len;
bool used[800005];
int pref[400005];
void dfs(int v){
	used[v] = true;
	{
		int to = v - m;
		if(to >= 0 && !used[to])
			dfs(to);
	}
	{
		int to = v + n;
		if(to <= len && !used[to])
			dfs(to);
	}
	pref[v] = timer++;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int tests;
  	cin >> tests;
	while(tests--){
		cin >> n >> m;
		timer = 0;
		len = n + m - __gcd(n, m) - 1;
		fill(used, used + mx + 1, false);
		for(int i = 0; i <= len; i++)
			if(!used[i])
				dfs(i);
		cout << len << '\n';
		fill(used, used + len + 1, false);
		if(len){
			for(int i = 1; i <= len; i++)
				cout << pref[i] - pref[i - 1] << ' ';
			cout << '\n';
		}
	}
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:47:21: error: 'mx' was not declared in this scope; did you mean 'm'?
   47 |   fill(used, used + mx + 1, false);
      |                     ^~
      |                     m