# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619708 | socpite | Palindromic Partitions (CEOI17_palindromic) | C++14 | 438 ms | 22740 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int maxn = 1e6+5;
const int mod = 1e9+7;
int t, n, q;
string str, str2;
int d[2*maxn];
int man1[maxn], man2[maxn];
void pp(){
string tmp;
for(int i = n-1; i >= n/2 + (n&1); i--)tmp+=str[i];
str2 = tmp;
tmp = "";
for(int i = 0; i < n/2; i++)tmp+=str[i];
str = tmp;
tmp = "$#";
for(int i = 0; i < n/2; i++){
tmp+=str[i];
tmp+='#';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |