| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 560879 | Yazan_Alattar | Palinilap (COI16_palinilap) | C++14 | 67 ms | 12368 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;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 100007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;
string s;
int cnt[M][30], ans;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> s;
int n = s.size(); s = '#' + s;
for(int mid = 1; mid <= n; ++mid){
int l = mid, r = mid;
int pos1 = 0, pos2 = 0, c1 = 0, c2 = 0;
while(l && r <= n){
if(s[l] != s[r]){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||