Submission #334683

#	Time	Username	Problem	Language	Result	Execution time	Memory
334683		Kerim	Nice sequence (IZhO18_sequence)	C++17	76 / 100	257 ms	26092 KiB

sequence

#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>adj[MAXN];
int vis[MAXN],dp[MAXN],n,m,c;
void dfs(int nd){
	if(dp[nd])
		return;
	dp[nd]=++c;
	tr(it,adj[nd]){
		dfs(*it);
		umax(dp[nd],dp[*it]+1);
	}
}
void solve(int k){
	for(int i=0;i<=k;i++){
		if(i+n<=k)
			adj[i].pb(i+n);
		if(i-m>=0)
			adj[i].pb(i-m);
	}c=0;
	for(int i=0;i<=k;i++)
		dfs(i);
	printf("%d\n",k);
	for(int i=1;i<=k;i++)
		printf("%d ",dp[i]-dp[i-1]);
	puts("");
	for(int i=0;i<=k;i++)
		adj[i].clear(),dp[i]=0;
}
int main(){
   // freopen("file.in", "r", stdin);
    int t;
    scanf("%d",&t);
    while(t--){
		scanf("%d%d",&n,&m);
		solve(n+m-__gcd(n,m)-1);	
    }
	return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   50 |     scanf("%d",&t);
      |     ~~~~~^~~~~~~~~
sequence.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   52 |   scanf("%d%d",&n,&m);
      |   ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 14 / 14
• Subtask 6: 18 / 18
• Subtask 7: 0 / 24