QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #472362 | #6419. Baby's First Suffix Array Problem | Linx | WA | 0ms | 3708kb | C++23 | 784b | 2024-07-11 15:53:42 | 2024-07-11 15:53:42 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define inf 2000000000
#define log(x) (31^__builtin_clz(x))
using namespace std;
void solve(){
cout<<"20 20\n11110111110111110110\n10011001011001011011\n11101101101101101101\n00110110110110110111\n10011011011011011001\n11101101101101101101\n10110110110110110110\n11011011011011011011\n01101101101101101101\n10110110110110110111\n10011011011011011001\n11101101101101101101\n10110110110110110110\n11011011011011011011\n01101101101101101101\n10110110110110110111\n10011011011011011011\n11101101101101101101\n10110100110100110101\n11011111011111011101\n";
}
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int t=1;
//cin>>t;
while(t--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3708kb
input:
2 10 4 baaabbabba 2 8 3 1 1 1 2 3 2 2 5 4 20 3 cccbccbadaacbbbcccab 14 17 16 3 20 17 17 20 18
output:
20 20 11110111110111110110 10011001011001011011 11101101101101101101 00110110110110110111 10011011011011011001 11101101101101101101 10110110110110110110 11011011011011011011 01101101101101101101 10110110110110110111 10011011011011011001 11101101101101101101 10110110110110110110 11011011011011011011 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '20'