QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#734435#8981. Kangaroo PuzzleJEdwardWA 2ms3720kbC++201.6kb2024-11-11 10:34:302024-11-11 10:34:30

Judging History

你现在查看的是最新测评结果

  • [2024-11-11 10:34:30]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3720kb
  • [2024-11-11 10:34:30]
  • 提交

answer

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x & -x)
#define all(s) s.begin(), s.end()
#define pii pair<int,int>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T>
inline void read(T &x){
	x = 0;
	char c = getchar();
	bool f = 0;
	for (; !isdigit(c); c = getchar()) f ^= (c == '-');
	for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
	x = f ? -x : x;
}
template <class T>
inline void write(T x){
	if (x < 0) putchar('-'), x = -x;
	if (x < 10) putchar(x + 48);
	else write(x / 10), putchar(x % 10 + 48);
}
template<typename T> void chkmin(T& lhs, const T& rhs) { lhs = lhs > rhs ? rhs : lhs; }
template<typename T> void chkmax(T& lhs, const T& rhs) { lhs = lhs < rhs ? rhs : lhs; }

const int N = 5e5 + 5;
const int mod = 1e9 + 7;
const int INF = 1e11 + 9;
const double eps = 1e-9;
const double Pi = acos(-1);
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}
mt19937 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
	uniform_int_distribution<int> dist(L, R);
	return dist(rnd);
}
inline void sol(){
int n, m;
cin >> n >> m;
for(int i=1;i<=50000;i++){
cout << "RLDU"[randint(0, 3)];
}
}

signed main(){
	IOS;
	int tc = 1;
	cin >> tc;
	while(tc--){
		sol();
	}
	return 0;
}

详细

Test #1:

score: 0
Wrong Answer
time: 2ms
memory: 3720kb

input:

4 4
1111
1001
1001
1110

output:

UDULRLLUULDUURURDLUUDDRUURUDRUURURDDLLLRDDDLLRRRURUUDUUULRLRRULRURURLDRUURLRLURLLULDRRDDDUDDRDRRLULULLDLRUDULRRLLRLLDDLDLLUULDLRDDDRDUUUDLUUULRLDDLLLLRDDRLRURLUDLULDLRUDDLDRUDUDLDURRULLLDLLLUDLRLRUDLRUUDRLRUUUURLRDUDRDLLDDRUUULDRDRUDDDRUULLDLLLLLURRULLLLDDRUURDURDRDDLDDRLRRDDUDRLLLLURLRLDURUUDDRLDLR...

result:

wrong answer Line [name=ans] equals to "UDULRLLUULDUURURDLUUDDRUURUDRU...DDDLRLRLUUDRRRRRRUDDRDUUULRURUU", doesn't correspond to pattern "[UDLR]{1,50000}"