oj.uz

Submission #398602

# Submission time Handle Problem Language Result Execution time Memory
398602 2021-05-04T15:23:21 Z fun_day Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 12816 KB 
#include <bits/stdc++.h>
using namespace std;
vector<char> reversed(vector<char>ss){
  reverse(ss.begin(),ss.end());
  return ss;  
}
void clear(queue<char> &q){
   std::queue<char> empty;
   std::swap( q, empty );
}
bool equal(string one , string two){
  unordered_map<string , bool>mp;
  mp[one] = 1;
  return mp[two];
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while(tt--){
    string ss ;
    cin >> ss;
    int n = ss.length();
    int ans = 1;
    deque<char>one ,two;
    for(int i = 0, r = n-1 ; i <n/2 ; i++,r--){
      one.push_back(ss[i]);
      two.push_front(ss[r]);
      if((two.front() != one.front())||(two.back()!=one.back()))continue;
      if(one == two){
        one.clear(); two.clear();
        ans+=2;
        if(i+1==r)ans--;
      }
    } 
    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 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 6 ms 316 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 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 6 ms 316 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 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 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 6 ms 316 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 6 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 144 ms 12816 KB Output is correct
15 Execution timed out 10068 ms 3232 KB Time limit exceeded
16 Halted 0 ms 0 KB -