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.     if (offset > 0) {
  31.         for(auto i = 0; i <= offset; i++) {
  32.             res[i] = 1;
  33.         }
  34.     }
  35.  
  36.     int c = offset;
  37.     while((int)res.size() != n) {
  38.         if (res[0] = -1) {res[c] = 1; c=1;}
  39.         else {
  40.             if (res[c-1] == 1) {res[c] = 2;}
  41.             else {res[c] = 1;}
  42.             c++;
  43.         }
  44.     } 
  45.  
  46.     for(auto v : res) {
  47.         cout << v << " ";
  48.     }
  49.     cout << endl;
  50.  
  51. }
  52.  
  53.  
  54.  
  55. int32_t main()
  56. {
  57.     ios_base::sync_with_stdio(false);
  58.     cin.tie(NULL);
  59.     solve();
  60.     return 0;
  61. }
Success #stdin #stdout 0.01s 5392KB
comments (?)
stdin
copy 
3 2 5
stdout
copy 
-1 -1 -1
https://ideone.com/tqWpxY
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!