QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#469318 | #9101. Zayin and Bus | joso | WA | 1ms | 5612kb | C++14 | 383b | 2024-07-09 17:27:55 | 2024-07-09 17:27:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+10;
int a[N],sum[N];
pair<int,int>p;
int f[N];
void solve ()
{
int n,l,r;
cin>>n>>l>>r;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
}
signed main()
{
int t=1;
cin>>t;
while(t--)
{
//cout<<t<<endl;
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 5612kb
input:
14 1 1 1 2 1 3 2 1 1 1 2 1 1 2 2 1 2 1 2 1 1 3 2 1 3 1 2 1 1 4 2 1 4 1 3 1 1 1 1 1 3 1 2 1 1 1 3 1 1 1 3 2 3 1 2 1 3 2
output:
result:
wrong answer 1st lines differ - expected: '2', found: ''