QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#191746#5014. 复读程度hos_lyric#22 748ms399864kbC++147.8kb2023-09-30 10:45:122024-07-04 02:48:49

Judging History

你现在查看的是最新测评结果

  • [2024-07-04 02:48:49]
  • 评测
  • 测评结果:22
  • 用时:748ms
  • 内存:399864kb
  • [2023-09-30 10:45:12]
  • 提交

answer

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class T> void bAdd(vector<T> &bit, int pos, const T &val) {
  const int bitN = bit.size();
  for (int x = pos; x < bitN; x |= x + 1) bit[x] += val;
}
template <class T> T bSum(const vector<T> &bit, int pos) {
  T ret = 0;
  for (int x = pos; x > 0; x &= x - 1) ret += bit[x - 1];
  return ret;
}
template <class T> T bSum(const vector<T> &bit, int pos0, int pos1) {
  return bSum(bit, pos1) - bSum(bit, pos0);
}


/*
  len: depth in uncompacted suffix tree of the reversed string
  par: parent in compacted suffix tree of the reversed string
  prev: node from which it is cloned
  ll: whole length of the string when created
  node u: length in (nodes[nodes[u].par].len, nodes[u].len]
*/
////////////////////////////////////////////////////////////////////////////////
template <class Char, class Map = map<Char, int>> struct SuffixAutomaton {
  struct Node {
    int len, par, prev;
    Map next;
    int ll;
  };
  int l, n, cur;
  vector<Node> nodes;
  SuffixAutomaton() : l(0), n(1), cur(0), nodes{Node{
    /*len=*/0, /*par=*/-1, /*prev=*/-1, /*next=*/{},
    /*ll=*/0,
  }} {}
  Node &operator[](int u) { return nodes[u]; }
  void append(Char c) {
    ++l;
    int u = cur;
    cur = n++;
    nodes.push_back(Node{
        /*len=*/nodes[u].len + 1, /*par=*/0, /*prev=*/-1, /*next=*/{},
        /*ll=*/l,
    });
    for (; ~u && !nodes[u].next.count(c); u = nodes[u].par) {
      nodes[u].next[c] = cur;
    }
    if (~u) {
      const int v = nodes[u].next[c];
      if (nodes[u].len + 1 == nodes[v].len) {
        nodes[cur].par = v;
      } else {
        const int w = n++;
        nodes.push_back(Node{
            /*len=*/nodes[u].len + 1, /*par=*/nodes[v].par, /*prev=*/v,
            /*next=*/nodes[v].next,
            /*ll=*/l,
        });
        nodes[v].par = nodes[cur].par = w;
        for (; ~u && nodes[u].next[c] == v; u = nodes[u].par) {
          nodes[u].next[c] = w;
        }
      }
    }
  }
};
////////////////////////////////////////////////////////////////////////////////

struct Map {
  int as[26];
  Map() { memset(as, ~0, sizeof(as)); }
  int &operator[](char c) { return as[c - 'a']; }
  int count(char c) { return (~as[c - 'a']) ? 1 : 0; }
};


using U = unsigned long long;

int N, Q;
char S[100'010];
vector<U> WL, WR;
vector<int> L1, R1, L2, R2;


namespace brute {
int dpL[5010][5010], dpR[5010][5010];
U W[5010][5010];
vector<U> run() {
  memset(dpL, 0, sizeof(dpL));
  memset(dpR, 0, sizeof(dpR));
  for (int i = N; --i >= 0; ) for (int j = N; --j >= 0; ) if (S[i] == S[j]) dpL[i][j] = 1 + dpL[i + 1][j + 1];
  for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (S[i] == S[j]) dpR[i + 1][j + 1] = dpR[i][j] + 1;
  memset(W, 0, sizeof(W));
  for (int l = 0; l <= N; ++l) for (int r = l + 1; r <= N; ++r) W[l][r] = 1;
  for (int l = 0; l < N; ++l) {
    vector<U> sums(N - l + 1, 0);
    for (int i = 0; i < N; ++i) sums[dpL[l][i]] += WL[i];
    for (int k = N - l; k >= 1; --k) sums[k - 1] += sums[k];
    for (int r = l + 1; r <= N; ++r) W[l][r] *= sums[r - l];
  }
  for (int r = 1; r <= N; ++r) {
    vector<U> sums(r + 1, 0);
    for (int i = 1; i <= N; ++i) sums[dpR[r][i]] += WR[i];
    for (int k = r; k >= 1; --k) sums[k - 1] += sums[k];
    for (int l = 0; l < r; ++l) W[l][r] *= sums[r - l];
  }
// for(int l=0;l<=N;++l){cerr<<"W["<<l<<"] = ";pv(W[l],W[l]+N+1);}
  vector<U> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    const int need = max(R1[q] - L1[q], R2[q] - L2[q]);
    for (int l = 0; l <= N; ++l) for (int r = l + need; r <= N; ++r) {
      if (dpL[L1[q]][l] >= R1[q] - L1[q] && dpR[R2[q]][r] >= R2[q] - L2[q]) {
        ans[q] += W[l][r];
      }
    }
  }
  return ans;
}
}  // brute


namespace slow {
int dpL[5010][5010], dpR[5010][5010];
U W[5010][5010];

vector<vector<int>> graph;
int zeit;
vector<int> dis, fin;
void dfs(int u) {
  dis[u] = zeit++;
  for (const int v : graph[u]) dfs(v);
  fin[u] = zeit;
}

vector<U> run() {
  memset(dpL, 0, sizeof(dpL));
  memset(dpR, 0, sizeof(dpR));
  for (int i = N; --i >= 0; ) for (int j = N; --j >= 0; ) if (S[i] == S[j]) dpL[i][j] = 1 + dpL[i + 1][j + 1];
  for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (S[i] == S[j]) dpR[i + 1][j + 1] = dpR[i][j] + 1;
  memset(W, 0, sizeof(W));
  for (int l = 0; l <= N; ++l) for (int r = l + 1; r <= N; ++r) W[l][r] = 1;
  for (int l = 0; l < N; ++l) {
    vector<U> sums(N - l + 1, 0);
    for (int i = 0; i < N; ++i) sums[dpL[l][i]] += WL[i];
    for (int k = N - l; k >= 1; --k) sums[k - 1] += sums[k];
    for (int r = l + 1; r <= N; ++r) W[l][r] *= sums[r - l];
  }
  for (int r = 1; r <= N; ++r) {
    vector<U> sums(r + 1, 0);
    for (int i = 1; i <= N; ++i) sums[dpR[r][i]] += WR[i];
    for (int k = r; k >= 1; --k) sums[k - 1] += sums[k];
    for (int l = 0; l < r; ++l) W[l][r] *= sums[r - l];
  }
// for(int l=0;l<=N;++l){cerr<<"W["<<l<<"] = ";pv(W[l],W[l]+N+1);}
  
  SuffixAutomaton<char, Map> sam;
  for (int i = 0; i < N; ++i) {
    sam.append(S[i]);
  }
  graph.assign(sam.n, {});
  for (int u = 1; u < sam.n; ++u) {
    graph[sam[u].par].push_back(u);
  }
  dis.assign(sam.n, -1);
  fin.assign(sam.n, -1);
  dfs(0);
  vector<int> prefix(N + 1, 0);
  for (int i = 0; i < N; ++i) {
    prefix[i + 1] = sam[prefix[i]].next[S[i]];
  }
  vector<int> query(Q, 0);
  for (int q = 0; q < Q; ++q) {
    int &u = query[q];
    for (int i = L2[q]; i < R2[q]; ++i) {
      u = sam[u].next[S[i]];
    }
  }
  
  vector<vector<int>> qss(N + 1);
  for (int q = 0; q < Q; ++q) {
    qss[max(R1[q] - L1[q], R2[q] - L2[q])].push_back(q);
  }
  vector<U> ans(Q, 0);
  for (int l = 0; l < N; ++l) {
    vector<U> bit(sam.n, 0);
    for (int r = N; r > l; --r) {
      bAdd(bit, dis[prefix[r]], W[l][r]);
      for (const int q : qss[r - l]) {
        if (dpL[L1[q]][l] >= R1[q] - L1[q]) {
          ans[q] += bSum(bit, dis[query[q]], fin[query[q]]);
        }
      }
    }
  }
  return ans;
}
}  // slow


int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    scanf("%s", S);
    WL.assign(N + 1, 0);
    for (int i = 0; i < N; ++i) {
      scanf("%llu", &WL[i]);
    }
    WR.assign(N + 1, 0);
    for (int i = 1; i <= N; ++i) {
      scanf("%llu", &WR[i]);
    }
    L1.resize(Q);
    R1.resize(Q);
    L2.resize(Q);
    R2.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d%d", &L1[q], &R1[q], &L2[q], &R2[q]);
      --L1[q];
      --L2[q];
    }
    
    const auto ans = slow::run();
    for (int q = 0; q < Q; ++q) {
      printf("%llu\n", ans[q]);
    }
  }
  return 0;
}

详细

Subtask #1:

score: 7
Accepted

Test #1:

score: 7
Accepted
time: 19ms
memory: 397108kb

input:

500 500
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

15720454042420499810
4058077030882532408
14651762045124606089
4030024243931986061
18033423360813892607
9470601111824364484
3883374861354698625
16650831689368240202
8339028189650687576
2683289915379600554
13133811958066776394
14181220923901262251
18173739360450512256
13142314545999179754
148925491596...

result:

ok 500 lines

Test #2:

score: 0
Accepted
time: 23ms
memory: 397676kb

input:

500 500
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszz...

output:

4843650749197240262
7777110205341291111
533576317536031175
16712994243500559204
9988085877723856684
9644193924482321332
3247342125341043527
18152622312040037224
13045121434804725850
10593529771756855740
13316626648976199221
6181092693273210423
9148547538129213975
9376364571107435561
2140403332478526...

result:

ok 500 lines

Test #3:

score: 0
Accepted
time: 11ms
memory: 396944kb

input:

500 500
aaaaabbaabbabbbaabaabbabbabbbaaabaaaabbbbbbaaabaabbbbbbaabbaaaaababbaaaaabbbbababbabaabbbbbbbbaaaaaaabaabbabbbbaabbaabaaabbbabbaabbbabaabaaaaababbaabbabbbabbababbbaabbabaaabbbbaaabbbabbabaabbabbaaabbaabbabbbbaaaaaababaaaabaababbaabbabbabbbabbaabbbaabbaaababaaabbababbbabaababaabbbbbabbababaab...

output:

841375054012212333
13406426787139944226
6541986259052503362
10583258635957015782
11582649090627508617
4747829250201069768
11571422754704651998
14603866222879735665
8438246043626601023
16155298152184479844
9052925087624568857
18388444310571976215
13304308468056840286
18125780089857220122
363421144082...

result:

ok 500 lines

Test #4:

score: 0
Accepted
time: 11ms
memory: 397828kb

input:

500 500
sulasusulasusulasulasulsulasusulasususulasulasulsulasulasulsulasulasulsulasususulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasulasulsulasulasulsulasususulasulasulsulasulasulsulasulasulsulasusulasulasulsulasulasulsulasusulasusulasusulas...

output:

2320755102639148175
17108462705447992416
6030359132551843296
889683039894413148
10901851555398837076
1991544941914879425
9087724446342520941
5134546535199286414
12947484109492427089
5962550827492657739
4877066450610765849
6699323319072695780
11167645157062070624
13985172887966350800
8075429763917070...

result:

ok 500 lines

Test #5:

score: 0
Accepted
time: 20ms
memory: 396860kb

input:

500 500
bbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbfyfzxjdqlcaadccvsbbbbbbqouvtudkzorrxinacvncytgmtbbbbbbbbbbbbqouvtudkzorrx...

output:

18295637548117042088
6105463594888898313
15681140870484623884
17957090271580958329
11763132903578154240
17769627666201366836
16493946443969420940
12712093409624537595
2436698665645215125
8863273927617841787
5065586857868462806
8771649105206144878
6715985691821336097
8851433094837196039
7055234226266...

result:

ok 500 lines

Test #6:

score: 0
Accepted
time: 12ms
memory: 397756kb

input:

500 500
yyyayyayyyayyayyyayyayyyayyyayyyayyayyyyayyayyyayyyayyayyyayyyayyayyayyyyayyyayyyayyayyayyyayyayyayyyayyayyayyyayyyyyayyayyyyayyayyyayyayyyayyyayyyayyayyyayyayyyyayyyayyayyayyyayyayyyayyyyayyyyayyayyyayyayyayyyayyayyayyyyayyayyyayyayyayyyayyyyayyayyayyyayyayyayyyayyayyayyyyayyyayyyayyyyayyay...

output:

6159560444195180556
5294852391541430076
6195718271241091926
7959984071139675340
1598729415848168155
4879964117998052348
2279721248493220290
2026655128556749470
9803272548967597498
1028236064772678471
5410852487707111065
3600180224455323043
60239358603452318
2179897463397058094
16626503365867372202
3...

result:

ok 500 lines

Test #7:

score: 0
Accepted
time: 12ms
memory: 396484kb

input:

500 500
fffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffxfqifffnmogfffxfqifffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqifffffffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqifffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfffxfqiffffffffxfqifffnmogfff...

output:

6263422992304461664
10533199195660359295
11930245273187149005
380050211417129795
8399013088311259527
7005867409130681392
6872331929648615383
11661502418569897193
18027795221888639599
8932010711134684820
6331436398298306214
14599171184201697655
16632037523890780117
10373998601812781913
16089838760431...

result:

ok 500 lines

Subtask #2:

score: 15
Accepted

Dependency #1:

100%
Accepted

Test #8:

score: 15
Accepted
time: 748ms
memory: 397376kb

input:

5000 5000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:

12046186417900804485
3907200386448639860
16785470842023310270
13867397394972404837
17085398553187209926
11495532885795119226
12151570815045120790
4174337022608077877
6326694597133262496
5169007805286709535
14463367619086789683
627371028328452442
16378439470252322552
8286285259552634235
4646456254657...

result:

ok 5000 lines

Test #9:

score: 0
Accepted
time: 551ms
memory: 397536kb

input:

5000 5000
zszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzszzszszzszzszszzszszzszzszszzszszzs...

output:

735272585091871492
2425556370857741242
8489901764977622765
9888756352722135114
3110111362923242403
9113727892967247055
13146817111311386931
5955980702194075793
11763307103994511020
11636340521260903139
13880517640770645879
18280247001976771986
9041182678245966519
902847942097731925
17037540142883387...

result:

ok 5000 lines

Test #10:

score: 0
Accepted
time: 558ms
memory: 397872kb

input:

5000 5000
bababbaabbbbbabbabaababbbaabababbbbaaabbaabbbbaaabaaaaabbababaababbbabbabbaaabbaaaaaababbababbbbbabbbbbaaabbabababaaababbababaabaaaaaabaaabbabaaaabaabaaaaaabbaaaaaaabbbbbabbabababbbabababaabaabbbbbabaabbbaaabbaaababbabaabaabbababaaaaaaabaaaabaabbbabbaaaababbabbaaabbbbabbabbaabbabbbbabaabbb...

output:

14997976760389310587
15623438489514479805
3150343034406864174
3816221098639928267
9378704101760633024
7513129444188437491
13447233088170491140
9761793475353455477
14533020333667464089
3755460369265761557
1017346093533703703
13617526768501762999
3768834851789866303
6158131626925412903
362975187944345...

result:

ok 5000 lines

Test #11:

score: 0
Accepted
time: 483ms
memory: 398176kb

input:

5000 5000
faffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaffafxwgaqfaffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaffafxwgaqswmswhlkteloiarwwdafaffafimufxzbzetkfeqjfaffaffaffafimufxzbzetkfeqjfaf...

output:

1845388242333177970
9831947454379400267
1031368185674017505
7263197708536716267
14239370791222150808
146482920919415220
17250529541921412624
16073012951843647214
14426094333257632462
9475986787147068259
17618123199330645299
7007181348027660953
7868744985222980634
24008326611725469
109704767314001231...

result:

ok 5000 lines

Test #12:

score: 0
Accepted
time: 481ms
memory: 398392kb

input:

5000 5000
rreurrrrkodwxsvtckttkrreurrrrtvjqcbspphhcmqjjadnkvdhavzhasjorreurrrrkodwxsvtckttkrreurrrrdhzorreurrrrkodwxsvtckttkrreurrrrtvjqcbspphhcmqjjadnkvdhavzhasjorreurrrrkodwxsvtckttkrreurrrrxgpkocctymfhcjougjsvimxuwczjxyhasapncenwpvkvtrmcdhkfjmndumgccngxginwyjhwexjeujrnvfaznvonweytryeeoocesoxavgaw...

output:

11585208823777493396
6508373161762025375
8952030838195753202
1744593196955201879
7361869313836500243
4211703722346758091
11507326811546869387
12152026172660216436
6502452509264613488
16456537462830488502
7769483154726766332
5049920983662723085
6208254085958990276
1561961237223372279
2581189727041718...

result:

ok 5000 lines

Test #13:

score: 0
Accepted
time: 458ms
memory: 399044kb

input:

5000 5000
bdybdbdybdbdybbdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdbdybbdybdbdybdbdybbdybdbdybdybdbdybdbdybbdybdbdybdybdb...

output:

15484750028865001809
11154229346905269019
17415778058314228645
12967502341758445430
14197547387946783600
16593119823307221414
3430123628603013461
15944735630911629097
3372966924712269006
16370170534370111687
7776152546511005126
10081736260495879969
3361043444817366723
14159037165445633566
4790222378...

result:

ok 5000 lines

Test #14:

score: 0
Accepted
time: 480ms
memory: 399864kb

input:

5000 5000
gskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkxbvpwljcjmnamkcdqmeteslgskozovzgkcfxgrjipkmaurpgskozovzgkcfxgskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkgskozovzgkcfxgrjipkmaurpgskozovzgkcfxuetjsdskistgkrkxbvpwljcjmnamkcdqmeteslgskozovzgkcfxgrjipkmaurpgskozovzgkcfxgskozovzgkcfxg...

output:

5804930040756324744
15650208817097681461
11355021187259627510
6741010156229702848
11225541410427015147
1272653894362217625
8025793205090026227
17985669688971641284
17805739950886098400
15447039299473890938
13822612697353510946
16409494890413019301
10397340813113479673
11748441386197961568
1796390231...

result:

ok 5000 lines

Subtask #3:

score: 0
Time Limit Exceeded

Dependency #2:

100%
Accepted

Test #15:

score: 0
Time Limit Exceeded

input:

5000 100000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:


result:


Subtask #4:

score: 0
Runtime Error

Test #22:

score: 0
Runtime Error

input:

100000 100000
zbbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaabab...

output:


result:


Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Runtime Error

Dependency #2:

100%
Accepted

Test #32:

score: 0
Runtime Error

input:

50000 50000
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

output:


result:


Subtask #7:

score: 0
Skipped

Dependency #3:

0%