結果
| 問題 | No.2247 01 ZigZag |
| ユーザー |
 sayan maiti
|
| 提出日時 | 2023-03-17 22:40:00 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,636 bytes |
| コンパイル時間 | 2,197 ms |
| コンパイル使用メモリ | 202,640 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-18 16:12:58 |
| 合計ジャッジ時間 | 3,253 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 49 WA * 1 |
ソースコード
/*
Someday at the sound of the night blooming
Simply take away the loneliness from me
Well then, goodbye, my drifting emotions
I'll close my eyes and have a good night. See you tomorrow
At the moment, it's just a little bit hard
I won't cry or something, I'm just trying to walk it off
I don't know what will be on my mind a few minutes later, and I still won't know even today
Wobbly, Wobbly, Wobbly, Wobbly floating
Ah, I'm such a bad child. An inferior student
Is that okay? Is that really okay?
I can't laugh well today, is that okay?
Are you ready? Hey! I said "are you ready?"
Let's just doze off into the warm corners of the night
Is that okay? Ah, Is that really okay?
I don't know what to say, is that okay?
Like that, come on, just like that
I'll dance with you, lalulalila~ See you later
Credits:- MIMI
Song:- Escape
*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
//typedef __int128 bigll;
typedef long long ll;
#define ull unsigned long long
#define ld long double
#define pow power
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define siz(a) int((a).size())
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
#define Forl(i,a,b) for(ll (i)=(a);(i) < (b); ++(i))
#define Forn(i,a,b) for(int (i)=(a);(i) >= (b); --(i))
#define Fornl(i,a,b) for(ll (i)=(a);(i) >= (b); --(i))
#define endl "\n"
#define pi 3.14159265
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
const ll mod = 1000 * 1000 * 1000 + 7;
const ll mod1 = 998244353;
const ll INF = 1ll*1000*1000*1000*1000*1000*1000 + 7;
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//typedef tree<pair<ll, ll>,null_type,less<pair<ll, ll>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = (long long)(res*x); // adding powers wherever bit is set
y = y>>1;
x = (long long)(x*x); // increasing power by 2
//cout<<x<<'\n';
}
return res;
}
// Stolen Templates
template<typename F, typename S>
ostream& operator <<(ostream& ostream, pair<F, S>& p) {
cout << p.first << " " << p.second;
return ostream;
}
template<typename T>
ostream& operator <<(ostream& ostream, vector<T>& v) {
for(auto& element : v) {
cout << element << " ";
}
return ostream;
}
template<typename T>
ostream& operator <<(ostream& ostream, vector<vector<T>>& v) {
for(auto& row : v) {
for(auto& cell : row) {
cout << cell << " ";
}
cout << "\n";
}
return ostream;
}
template<typename F, typename S>
istream& operator >>(istream& istream, pair<F, S>& p) {
cin >> p.first >> p.second;
return istream;
}
template<typename T>
istream& operator >>(istream& istream, vector<T>& v) {
for(auto& element : v) {
cin >> element;
}
return istream;
}
void print() {
cout << endl;
}
template <typename T> void print(const T& t) {
cout << t << endl;
}
template <typename First, typename... Rest> void print(const First& first, const Rest&... rest) {
cout << first << " ";
print(rest...); // recursive call using pack expansion syntax
}
void dbg() {
cerr << endl;
}
template <typename T> void dbg(const T& t) {
cerr << t << endl;
}
template <typename First, typename... Rest> void dbg(const First& first, const Rest&... rest) {
cerr << first << " ";
dbg(rest...); // recursive call using pack expansion syntax
}
// Stolen Templates end here
// ostream& operator << (ostream&, bigll val) {
// string temp;
// while (val > 0) { temp.pb(val % 10 + '0'); val /= 10; }
// for(int i = siz(temp) - 1; i >= 0; i--)cout<<temp[i];
// return cout;
// } // inside class
// istream& operator >> (istream&, bigll & val) {
// string temp; cin>>temp; val = 0;
// for(int i = 0; i < siz(temp); i++)val = val * 10 + temp[i] - '0';
// return cin;
// } // for cin we use & because we want the original object we are sending not a copy of it
int main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
// If you plan on using set / map do check if it will TLE or not
fastio();
ll n, m, k;
cin>>n>>m>>k;
ll minx = min(n, m);
ll tm = minx;
if (n > minx || m > minx)minx += 1;
minx += tm;
// cout<<minx<<endl;
if (k > minx - 1)cout<<-1;
else {
if (k == minx - 1) {
string temp;
if (n >= m) {
ll cur = 0;
while (k != -1) {
temp.pb(cur + '0');
if (!cur)n -= 1;
else m -= 1;
cur ^= 1;
k -= 1;
}
if (n > m) {
temp.pb('0');
n -= 1;
}
} else {
ll cur = 1;
while (k != -1) {
temp.pb(cur + '0');
if (!cur)n -= 1;
else m -= 1;
cur ^= 1;
k -= 1;
}
if (m > n) {
temp.pb('1');
m -= 1;
}
}
For(i,0,n)cout<<0;
cout<<temp;
For(i,0,m)cout<<1;
} else {
ll ext = 0;
if (k % 2 == 0){ ext = 1; k -= 1; n -= 1;}
ll cur = 0;
string temp;
while (k != -1) {
temp.pb(cur + '0');
if (!cur)n -= 1;
else m -= 1;
cur ^= 1;
k -= 1;
}
For(i,0,n)cout<<0;
cout<<temp;
For(i,0,m)cout<<1;
if (ext)cout<<0;
}
}
return 0;
}
// check all product based operations for integer overflow
// careful of renamed variables especially in loops
//python interactive_runner.py python local_testing_tool.py 0 -- c.exe