oj.uz

Submission #398201

# Submission time Handle Problem Language Result Execution time Memory
398201 2021-05-03T23:26:10 Z fun_day Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 18180 KB 
#include <bits/stdc++.h>

using namespace std;

#define debug(x) cerr << " - " << #x << ": " << x << '\n';
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << '\n';
#define debugv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << " ,"; cerr << ']' << "\n";

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while(tt--){
    string ss ; 
    cin >> ss ; 
    int n = ss.length();
    map<char, vector<int>>mp;
    map<char , int>start;
    for(int i = 0 ; i < n; i++){
      mp[ss[i]].push_back(i);        
      start[i] = 0;
    }
    int ans = 1;
    for(int i = n-1,qs = 0 ; qs< n/2 ; i--,qs++){
      char q = ss[i];
      string acc;
      string against;
      bool is = 1;
      int idx = qs;
      start[q] = lower_bound(mp[q].begin(),mp[q].end(),qs)-mp[q].begin();
      for(int j = start[q] ; j < (int)mp[q].size() ; j++){
        if(mp[q][j]>=n/2)break;
        acc += ss.substr(idx , mp[q][j]-idx+1);
        int rs = acc.length();
        against  = ss.substr(i-rs+1 , rs);
        idx = mp[q][j]+1;
        if(against == acc){
          acc.clear();
          ans+=2;
          against.clear();
          i =i-rs+1;
          qs = mp[q][j];
          if(qs+1==i)ans--;
          is = 0;
          break;  
        }
        start[q] = j+1;
      }
      if(is)break;        
    }
    cout << ans << '\n';
  }
  return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 10 ms 500 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 8 ms 460 KB Output is correct
13 Correct 7 ms 332 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 10 ms 500 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 8 ms 460 KB Output is correct
13 Correct 7 ms 332 KB Output is correct
14 Correct 8344 ms 18180 KB Output is correct
15 Execution timed out 10005 ms 12444 KB Time limit exceeded
16 Halted 0 ms 0 KB -