提出 #373871
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
const int dy[] = {-1,0,1,0};
const int dx[] = {0,1,0,-1};
typedef long long ll;
typedef pair<int,int> pii;
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; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}
int memo[10000];
int main() {
ll A,B,X;
while(input(A,B,X)) {
assert(A<=10000);
memset(memo,0,sizeof(memo));
int a = A;
REP(t,1000000) {
if (a == X) {
cout << t << endl;
break;
}
if (memo[a]) {
cout << -1 << endl;
break;
}
memo[a] = 1;
a = (a/2) ^ (a % 2 * B);
}
}
}
提出情報
| 提出日時 |
|
| 問題 |
K - 乱数調整 |
| ユーザ |
yuusune |
| 言語 |
C++11 (GCC 4.9.2) |
| 得点 |
30 |
| コード長 |
2592 Byte |
| 結果 |
RE |
| 実行時間 |
292 ms |
| メモリ |
932 KiB |
ジャッジ結果
| セット名 |
Subtask |
All |
| 得点 / 配点 |
30 / 30 |
0 / 270 |
| 結果 |
|
|
| セット名 |
テストケース |
| Subtask |
subtask_00.txt, subtask_01.txt, subtask_02.txt, subtask_03.txt, subtask_04.txt, subtask_05.txt, subtask_06.txt, subtask_07.txt, subtask_08.txt, subtask_09.txt, subtask_10.txt, subtask_11.txt, subtask_12.txt, subtask_13.txt, subtask_14.txt, subtask_15.txt, subtask_16.txt, subtask_17.txt, subtask_18.txt, subtask_19.txt |
| All |
scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt, scrambled_19.txt, scrambled_20.txt, scrambled_21.txt, scrambled_22.txt, scrambled_23.txt, scrambled_24.txt, scrambled_25.txt, scrambled_26.txt, scrambled_27.txt, scrambled_28.txt, scrambled_29.txt, scrambled_30.txt, scrambled_31.txt, scrambled_32.txt, scrambled_33.txt, scrambled_34.txt, scrambled_35.txt, scrambled_36.txt, scrambled_37.txt, scrambled_38.txt, scrambled_39.txt, scrambled_40.txt, scrambled_41.txt, scrambled_42.txt, subtask_00.txt, subtask_01.txt, subtask_02.txt, subtask_03.txt, subtask_04.txt, subtask_05.txt, subtask_06.txt, subtask_07.txt, subtask_08.txt, subtask_09.txt, subtask_10.txt, subtask_11.txt, subtask_12.txt, subtask_13.txt, subtask_14.txt, subtask_15.txt, subtask_16.txt, subtask_17.txt, subtask_18.txt, subtask_19.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| scrambled_00.txt |
AC |
25 ms |
800 KiB |
| scrambled_01.txt |
AC |
25 ms |
804 KiB |
| scrambled_02.txt |
AC |
25 ms |
800 KiB |
| scrambled_03.txt |
AC |
26 ms |
752 KiB |
| scrambled_04.txt |
RE |
272 ms |
928 KiB |
| scrambled_05.txt |
RE |
284 ms |
812 KiB |
| scrambled_06.txt |
RE |
280 ms |
928 KiB |
| scrambled_07.txt |
RE |
275 ms |
928 KiB |
| scrambled_08.txt |
RE |
274 ms |
924 KiB |
| scrambled_09.txt |
RE |
272 ms |
924 KiB |
| scrambled_10.txt |
RE |
275 ms |
920 KiB |
| scrambled_11.txt |
RE |
281 ms |
924 KiB |
| scrambled_12.txt |
RE |
284 ms |
920 KiB |
| scrambled_13.txt |
RE |
284 ms |
920 KiB |
| scrambled_14.txt |
RE |
281 ms |
916 KiB |
| scrambled_15.txt |
RE |
281 ms |
916 KiB |
| scrambled_16.txt |
RE |
280 ms |
916 KiB |
| scrambled_17.txt |
RE |
282 ms |
920 KiB |
| scrambled_18.txt |
RE |
280 ms |
916 KiB |
| scrambled_19.txt |
RE |
282 ms |
920 KiB |
| scrambled_20.txt |
RE |
275 ms |
808 KiB |
| scrambled_21.txt |
RE |
273 ms |
924 KiB |
| scrambled_22.txt |
RE |
277 ms |
924 KiB |
| scrambled_23.txt |
RE |
280 ms |
752 KiB |
| scrambled_24.txt |
RE |
279 ms |
796 KiB |
| scrambled_25.txt |
RE |
277 ms |
804 KiB |
| scrambled_26.txt |
RE |
277 ms |
800 KiB |
| scrambled_27.txt |
RE |
274 ms |
920 KiB |
| scrambled_28.txt |
RE |
282 ms |
800 KiB |
| scrambled_29.txt |
RE |
281 ms |
920 KiB |
| scrambled_30.txt |
AC |
24 ms |
924 KiB |
| scrambled_31.txt |
AC |
25 ms |
932 KiB |
| scrambled_32.txt |
RE |
280 ms |
924 KiB |
| scrambled_33.txt |
AC |
23 ms |
804 KiB |
| scrambled_34.txt |
RE |
286 ms |
920 KiB |
| scrambled_35.txt |
RE |
289 ms |
788 KiB |
| scrambled_36.txt |
RE |
277 ms |
928 KiB |
| scrambled_37.txt |
RE |
277 ms |
928 KiB |
| scrambled_38.txt |
RE |
276 ms |
804 KiB |
| scrambled_39.txt |
RE |
288 ms |
804 KiB |
| scrambled_40.txt |
RE |
281 ms |
800 KiB |
| scrambled_41.txt |
RE |
292 ms |
808 KiB |
| scrambled_42.txt |
RE |
292 ms |
796 KiB |
| subtask_00.txt |
AC |
25 ms |
816 KiB |
| subtask_01.txt |
AC |
24 ms |
924 KiB |
| subtask_02.txt |
AC |
26 ms |
796 KiB |
| subtask_03.txt |
AC |
25 ms |
796 KiB |
| subtask_04.txt |
AC |
25 ms |
924 KiB |
| subtask_05.txt |
AC |
25 ms |
804 KiB |
| subtask_06.txt |
AC |
24 ms |
800 KiB |
| subtask_07.txt |
AC |
25 ms |
928 KiB |
| subtask_08.txt |
AC |
25 ms |
728 KiB |
| subtask_09.txt |
AC |
24 ms |
800 KiB |
| subtask_10.txt |
AC |
25 ms |
800 KiB |
| subtask_11.txt |
AC |
25 ms |
796 KiB |
| subtask_12.txt |
AC |
26 ms |
800 KiB |
| subtask_13.txt |
AC |
25 ms |
920 KiB |
| subtask_14.txt |
AC |
25 ms |
928 KiB |
| subtask_15.txt |
AC |
26 ms |
800 KiB |
| subtask_16.txt |
AC |
25 ms |
928 KiB |
| subtask_17.txt |
AC |
25 ms |
800 KiB |
| subtask_18.txt |
AC |
24 ms |
928 KiB |
| subtask_19.txt |
AC |
25 ms |
928 KiB |