QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #722465 | #8981. Kangaroo Puzzle | KavenSky | WA | 4ms | 3588kb | C++23 | 640b | 2024-11-07 19:08:08 | 2024-11-07 19:08:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define MAX 300015
#define INF 1e8
#define none -1145141919810
const int N=1e3+5;
typedef pair<int,int> P;
typedef long long ll;
const ll mod=998244353;
typedef unsigned long long ull;
typedef long double db;
typedef pair<ll,ll>Pll;
const db pi=acosl(-1.0);
mt19937_64 rnd(time(0));
void solve(){
char arr[4]={'L','R','U','D'};
for(int i=0;i<500000;i++) cout << arr[rnd()%4];
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
cout << fixed << setprecision(15);
//cin >> t;
while(t--)
solve();
}
// 11.61
詳細信息
Test #1:
score: 0
Wrong Answer
time: 4ms
memory: 3588kb
input:
4 4 1111 1001 1001 1110
output:
DULDUDUDLUDLURDDULLULRUDLULUURRDRLRDULRLLDDLURULUURDRURRLDDRDDRRDURRLUUDLULLRDLLRDULRLRULDRRRLDRLDLUDULDDRDRLRULDURULDUDRRRDUDDDUULUULRRRURLLUDUUURRDRLLDDDULDRUUDDULURRRULLDLRRUDRDRDULRRURRRRLRLLUURURLDLLLUUULLDURRLULLLDLULDDULLDDRRLDDDRUUUDLDDULRDUUDDLRUDDRLRUUUDLLRULUUDLRRLLUDDULRDUULDDDRRLRDLUDRD...
result:
wrong answer Line [name=ans] equals to "DULDUDUDLUDLURDDULLULRUDLULUUR...LDULULDDDURRRRLDULRRRDURDDDLRDD", doesn't correspond to pattern "[UDLR]{1,50000}"