fork(1) download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. #define						int 					long long
  6. #define						ll 						long long
  7. #define						pii 					pair<int,int>
  8. #define						vi 	 					vector<int>
  9. #define						vii						vector<pii>  
  10. #define						F						first
  11. #define						S 						second
  12. #define						pb						push_back
  13. #define						pob						pop_back
  14. #define						mp						make_pair
  15. #define						rep(i,a,b)				for(int i=a;i<b;i++)
  16. #define						repd(i,a,b)				for(int i=a;i>=b;i--)
  17. #define						read(n)					cin>>n 
  18. #define						print(n)				cout<<n<<" ";
  19. #define						lowBound(v,x)			lower_bound(v.begin(),v.end(),x)-v.begin()
  20. #define						upBound(v,x)			upper_bound(v.begin(),v.end(),x)-v.begin()
  21. #define						all(v)					v.begin(),v.end()
  22. #define						endl					"\n" 
  23. int mod=1e9+7; 
  24.  
  25. void sol(){
  26.     int n;
  27.     cin>>n;
  28.     map<int,int> m1,m2,m3;
  29.     int k = n-1;
  30.     int w,t=0;
  31.     if(k%2==0){
  32.     	w=k/2;
  33.     	t=0;
  34.     }else{
  35.     	w=(k-1)/2;
  36.     	t=1;
  37.     }
  38.     rep(i,1,n+1){
  39.     	int j=i+1;
  40.     	while(j<=n && m1[i]<w){
  41.     		cout<<1<<" ";
  42.     		m1[i]++;
  43.     		m3[j]++;
  44.     		j++;
  45.     	}
  46.     	while(j<=n && m2[i]<t){
  47.     		cout<<0<<" ";
  48.     		m2[i]++;
  49.     		m2[j]++;
  50.     		j++;
  51.     	}
  52.     	while(j<=n){
  53.     		cout<<-1<<" ";
  54.     		m1[j]++;
  55.     		m3[i]++;
  56.     		j++;
  57.     	}
  58.     }
  59. }
  60.  
  61. signed main(){
  62. 	ios::sync_with_stdio(0);
  63. 	cin.tie(0);
  64. 	ll t=1;
  65. 	read(t);
  66. 	while(t--){
  67. 		sol();
  68. 		cout<<"\n";
  69. 	}
  70. 	return 0;
  71. }
  72.  
  73.  
  74.  
  75. /*
  76.  
  77. _______________________________________Input size Expected time complexity____________________________
  78. n = 10 				O(n!)
  79. n = 20 				O(2n)
  80. n = 500 			O(n3)
  81. n = 5000 			O(n2)
  82. n = 106 			O(n log n) or O(n)
  83. n is large 			O(1) or O(log n)
  84. */
Success #stdin #stdout 0s 5512KB
comments (?)
stdin
copy 
2
8
5
stdout
copy 
1 1 1 0 -1 -1 -1 1 1 1 0 -1 -1 1 1 1 0 -1 1 1 1 0 1 1 1 1 1 1 
1 1 -1 -1 1 1 -1 1 1 1
https://ideone.com/zshdpu
language:
C++14 (gcc 8.3)
created:
2 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!