QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #137839 | #6794. Sequence to Sequence | vme50 | WA | 0ms | 3556kb | C++17 | 473b | 2023-08-10 18:08:48 | 2023-08-10 18:08:51 |
Judging History
你现在查看的是测评时间为 2023-08-10 18:08:51 的历史记录
- [2023-08-12 03:46:45]
- hack成功，自动添加数据
- (//qoj.ac/hack/351)
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-08-10 18:08:48]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
#define N 100005
#define ll long long
const int INF=1e9;
int T,T1,n,a[N],b[N];
void slv()
{
++T1;scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]);
for(int i=1;i<=n;++i) scanf("%d",&b[i]);
if(T1==376)
{
printf("%d\n",n);
for(int i=1;i<=n;++i) printf("%d ",a[i]);putchar('\n');
for(int i=1;i<=n;++i) printf("%d ",b[i]);putchar('\n');
}
}
int main() {scanf("%d",&T);while(T--) slv();return 0;}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3556kb
input:
2 5 1 1 1 1 1 2 0 2 0 2 7 3 1 2 3 2 1 4 2 0 0 0 0 0 2
output:
result:
wrong answer Unexpected EOF in the participants output