fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define read(type) readInt<type>() // Fast read
  4. #define ll long long
  5. #define nL "\n"
  6. #define pb push_back
  7. #define mk make_pair
  8. #define pii pair<int, int>
  9. #define a first
  10. #define b second
  11. #define vi vector<int>
  12. #define all(x) (x).begin(), (x).end()
  13. #define umap unordered_map
  14. #define uset unordered_set
  15. #define MOD 1000000007
  16. #define imax INT_MAX
  17. #define imin INT_MIN
  18. #define exp 1e9
  19. #define sz(x) (int((x).size()))
  20.  
  21.  
  22. void solve() {
  23.     int n, m, k; cin >> n >> m >> k;
  24.  
  25.     if (3+2*(n-2) < k || n > k) {cout << -1 << endl;}
  26.  
  27.     int offset = (3+2*(n-2)) - k;
  28.  
  29.     vector<int> res(n, -1);
  30.     for(auto i = 0; i <= offset; i++) {
  31.         res[i] = 1;
  32.     }
  33.  
  34.     int c = offset;
  35.     while((int)res.size() != n) {
  36.         int s = (int)res.size();
  37.         if (s == 0) {res.pb(1); c=1;}
  38.         else {
  39.             if (res[c-1] == 1) {res[c] = 2;}
  40.             else {res[c] = 1;}
  41.             c++;
  42.         }
  43.     } 
  44.  
  45.     for(auto v : res) {
  46.         cout << v << " ";
  47.     }
  48.     cout << endl;
  49.  
  50. }
  51.  
  52.  
  53.  
  54. int32_t main()
  55. {
  56.     ios_base::sync_with_stdio(false);
  57.     cin.tie(NULL);
  58.     solve();
  59.     return 0;
  60. }
Success #stdin #stdout 0.01s 5516KB
comments (?)
stdin
copy 
3 2 5
stdout
copy 
1 -1 -1
https://ideone.com/T9RUJ1
language:
C++14 (gcc 8.3)
created:
1 year 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!