結果
問題 | No.2247 01 ZigZag |
ユーザー |
|
提出日時 | 2023-03-17 22:26:23 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 2,000 ms |
コード長 | 5,597 bytes |
コンパイル時間 | 3,978 ms |
コンパイル使用メモリ | 232,628 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-18 16:11:58 |
合計ジャッジ時間 | 5,597 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 50 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>// url#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=b-1;i>=a;i--)#define all(x) (x).begin(),(x).end()#define pb(x) push_back(x);template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }typedef long long ll;typedef long double lld;using namespace std;using namespace atcoder;using mint = static_modint<998244353>;// using mint = static_modint<1000000007>;const ll mod=998244353;//const ll mod=1e9+7;int dx[4]={1,0,-1,0};int dy[4]={0,1,0,-1};const string zton="0123456789";const string atoz="abcdefghijklmnopqrstuvwxyz";const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";const ll inf=(1ll<<60);// const int inf=(1<<30);lld dist(lld x1,lld x2,lld y1,lld y2){lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);res=sqrt(abs(res));return res;}lld arg(lld x,lld y){const lld eps=1e-8;lld res=0;if(abs(x)+abs(y)<=eps)return 0.0;else if(abs(x)<=eps){if(y>=0.0)return (M_PI/2);else return (M_PI/2+M_PI);}else if(abs(y)<=eps){if(x>=0.0)return 0.0;else return M_PI;}res=atan2(abs(y),abs(x));if(x<=0&&y>=0)res=(M_PI-res);else if(x<=0&&y<=0)res+=(M_PI);else if(x>=0&&y<=0)res=(M_PI*2-res);return res;}ll gcd(ll a,ll b){if(a==0||b==0)return a+b;ll r;r=a%b;if(r==0){return b;}else{return gcd(b,r);}}typedef pair<ll,int> P;void solve(int N,int M,int K){vector<int> ans;if(K==0){if(N==0){rep(i,0,M){ans.pb(1);}}else if(M==0){rep(i,0,N){ans.pb(0);}}else{cout << -1 << endl;return;}}else if(K==1){if(N==0||M==0){cout << -1 << endl;return;}else{rep(i,0,N){ans.pb(0);}rep(i,0,M){ans.pb(1);}}}else{if(N==M){if(N*2-1<K){cout << -1 << endl;return;}if(K%2==0){rep(i,0,N-K/2-1){ans.pb(0);}rep(i,0,K/2){ans.pb(0);ans.pb(1);}rep(i,0,M-K/2){ans.pb(1);}ans.pb(0);}else{rep(i,0,N-(K-1)/2){ans.pb(0);}rep(i,0,(K-1)/2){ans.pb(1);ans.pb(0);}rep(i,0,M-(K-1)/2){ans.pb(1);}}}else if(N<M){if(N*2<K){cout << -1 << endl;return;}else if(N*2==K){rep(i,0,N){ans.pb(1);ans.pb(0);}rep(i,0,M-N){ans.pb(1);}}else{if(K%2==0){rep(i,0,N-K/2-1){ans.pb(0);}rep(i,0,K/2){ans.pb(0);ans.pb(1);}rep(i,0,M-K/2){ans.pb(1);}// rep(i,0,ex){// ans.pb(1);// }ans.pb(0);}else{rep(i,0,N-(K-1)/2){ans.pb(0);}rep(i,0,(K-1)/2){ans.pb(1);ans.pb(0);}rep(i,0,M-(K-1)/2){ans.pb(1);}// rep(i,0,ex){// ans.pb(1);// }}}}else if(N>M){if(M*2<K){cout << -1 << endl;return;}if(K%2==0){rep(i,0,N-K/2-1){ans.pb(0);}rep(i,0,K/2){ans.pb(0);ans.pb(1);}rep(i,0,M-K/2){ans.pb(1);}// rep(i,0,ex){// ans.pb(1);// }ans.pb(0);}else{rep(i,0,N-(K-1)/2){ans.pb(0);}rep(i,0,(K-1)/2){ans.pb(1);ans.pb(0);}rep(i,0,M-(K-1)/2){ans.pb(1);}// rep(i,0,ex){// ans.pb(1);// }}}}for(int i:ans){cout << i;}cout << endl;return;}int main(void){ios::sync_with_stdio(false);cin.tie(nullptr);int N,M,K;cin>>N>>M>>K;solve(N,M,K);// rep(i,0,13){// cout << 6 << " " << 4 << " " << i << " : ";// solve(6,4,i);// }}