結果
問題 | No.2608 Divide into two |
ユーザー |
|
提出日時 | 2024-01-19 21:32:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 2,391 bytes |
コンパイル時間 | 2,004 ms |
コンパイル使用メモリ | 197,240 KB |
最終ジャッジ日時 | 2025-02-18 20:44:24 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 2 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;constexpr int INF = (int)1e9 + 1001010;constexpr ll llINF = (ll)4e18 + 22000020;const string endn = "\n";template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}const string ELEM_SEPARATION = "", VEC_SEPARATION = endn;template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");}return o;}template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}// ================================== ここまでテンプレ ==================================void solve(){ll n; cin >> n;vector<int> ans(n+1, 1);if(n%4 == 0){for(int i = 1; i < n-i+1; i++){ans[i] = (i&1);ans[n-i+1] = ans[i];}}else if(n%4 == 3){ans[1] = 0;ans[2] = 0;ans[3] = 1;for(int i = 4; i < n-i+4; i++){ans[i] = (i&1);ans[n-i+4] = ans[i];}}else{cout << -1 << endl;return;}{ll sum0 = 0, sum1 = 0;for(int i = 1; i <= n; i++){if(ans[i] == 0) sum0 += i;else sum1 += i;}assert(sum0 == sum1);}ans.erase(ans.begin());cout << ans << endl;return;}int main(int argc, char *argv[]){ios::sync_with_stdio(false);cin.tie(nullptr);int t; cin >> t;while(t--) solve();return 0;}