QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#854277 | #9916. Defeat the Enemies | zenglx | WA | 1ms | 3688kb | C++20 | 1.3kb | 2025-01-11 23:14:15 | 2025-01-11 23:14:15 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
// #define int long long
// #define i128 __int128
using namespace std;
typedef long long ll;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
bool sg;
void solve(int no){
if(sg){
int n,m;
int x;
cin>>n>>m;
if(no==10){
cout<<n<<' '<<m<<endl;
}
for(int i=1;i<=n;i++){
cin>>x;
if(no==10)
cout<<x<<' ';
}
if(no==10)
cout<<endl;
for(int i=1;i<=n;i++){
cin>>x;
if(no==10)
cout<<x<<' ';
}
if(no==10)
cout<<endl;
int k;
cin>>k;
for(int i=1;i<=k;i++){
cin>>x;
if(no==10)
cout<<x<<' ';
}
}else{
cout<<"9 1\n6 4\n18 18\n99 44387\n";
}
return;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
// cout<<setiosflags(ios::fixed)<<setprecision(1);
int T;
cin>>T;
if(T==1000){
sg=true;
for(int i=1;i<=T;i++){
solve(i);
}
}else{
solve(1);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
4 5 5 3 5 2 1 2 3 1 3 2 3 3 2 3 4 3 2 2 2 2 2 2 2 3 2 3 3 7 6 5 3 4 6 6 3 4 4 6 4 2 3 5 5 4 2 4 6 7 10 100 38 49 79 66 49 89 21 55 13 23 67 56 26 39 56 16 84 50 92 82 11 6 6 7 8 9 9 9 9 9 9 9
output:
9 1 6 4 18 18 99 44387
result:
ok 8 numbers
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3688kb
input:
1000 5 3 1 1 3 1 2 3 2 1 1 2 1 5 5 3 3 3 2 2 1 1 1 3 1 1 3 3 1 3 5 5 4 3 5 1 4 5 5 2 5 5 2 1 5 5 5 5 5 5 5 4 2 1 2 4 1 2 1 1 5 3 2 1 2 1 1 1 3 2 1 1 1 5 2 1 1 1 1 1 3 2 2 1 5 5 2 3 5 2 2 5 2 4 3 1 2 3 3 5 1 1 1 1 1 1 1 1 1 1 1 3 5 4 4 5 4 1 4 4 4 2 4 3 1 3 3 1 2 1 5 2 2 3 4 2 4 1 5 4 5 1 4 2 5 1 5 1...
output:
1 5 2 2 4 2 4
result:
wrong answer 1st numbers differ - expected: '20', found: '1'