cf 1305 E. Kuroni and the Score Distribution

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3  
 4 int a[100100];
 5  
 6 int main()
 7 {
 8     int n,m;
 9     cin>>n>>m;
10     a[1]=0;a[2]=0,a[3]=1,a[4]=2;
11     for(int i=5;i<=n;i++){
12         a[i]=a[i-1]+(i-1)/2;
13         if(a[i]>m) break;
14     }
15     int k=-1,l=0;
16     for(int i=1;i<=n;i++){
17         if(a[i]>=m){
18             k=i;
19             break;
20         }
21     }
22     if(m==0){
23         int t=0,ans=1;
24         for(int i=0;i<n;i++){
25             ans+=2;
26             printf("%d ",ans);
27         }
28         return 0;
29     }
30     if(k>n||k==-1){
31         cout<<-1<<endl;
32         return 0;
33     }
34     int flag=0;
35     if(a[k]>m) k--,flag=1;
36     for(int i=1;i<=k;i++){
37         printf("%d ",i);
38     }
39     int x=k/2,y=k;
40     if(flag){
41         y++;
42         while(a[k]+x>m) x--,y+=2;
43         printf("%d ",y);
44         k++;
45     }
46     n-=k;
47     int t=y+1,ans=y;
48     for(int i=0;i<n;i++){
49         ans+=t;
50         printf("%d ",ans);
51     }
52     return 0;
53 }