Submission #1609466


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<P,int>
#define vpp vector<PP>
#define fi first
#define se second
#define INF 1e9
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(x) (x).begin(),(x).end()
string st;
map<char,int> ma;
P dfs(char c,int p,P x){
    if(x.se-x.fi+1<2){
        return P(-1,-1);
    }
    if((x.se-x.fi)/2<p){
        return x;
    }
    if(st[x.fi]!=c){
        return dfs(c,p,P(x.fi+1,x.se));
    }
    if(st[x.se]!=c){
        return dfs(c,p,P(x.fi,x.se-1));
    }
    P a,b;
    a=dfs(c,p-1,P(x.fi+1,x.se));
    if(a!=P(-1,-1))return a;
    b=dfs(c,p-1,P(x.fi,x.se-1));
    if(b!=P(-1,-1))return b;
    return a;
}
int main(){
    cin>>st;
    REP(i,st.size()){
        ma[st[i]]++;
    }
    for(char i='a';i<='z';i++){
        if(ma.find(i)==ma.end())continue;
        P t=dfs(i,ma[i],P(0,st.size()-1));
        if(t!=P(-1,-1)){
            cout<<t.fi<<" "<<t.se<<endl;
            return 0;
        }
    }
    cout<<-1<<" "<<-1<<endl;
    return 0;
}

Submission Info

Submission Time
Task D - Unbalanced
User SugarDragon5
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1294 Byte
Status WA
Exec Time 10 ms
Memory 6784 KB

Judge Result

Set Name Sample Sub1 Sub2
Score / Max Score 0 / 0 0 / 200 0 / 200
Status
AC × 1
WA × 1
AC × 1
WA × 13
AC × 1
WA × 23
Set Name Test Cases
Sample 0_01, 0_02
Sub1 0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14
Sub2 0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 2_15, 2_16, 2_17, 2_18, 2_19, 2_20, 2_21, 2_22, 2_23, 2_24
Case Name Status Exec Time Memory
0_01 AC 1 ms 256 KB
0_02 WA 1 ms 256 KB
1_03 WA 1 ms 256 KB
1_04 WA 1 ms 256 KB
1_05 WA 1 ms 256 KB
1_06 WA 1 ms 256 KB
1_07 WA 1 ms 256 KB
1_08 WA 1 ms 256 KB
1_09 WA 1 ms 256 KB
1_10 WA 1 ms 256 KB
1_11 WA 1 ms 256 KB
1_12 WA 1 ms 256 KB
1_13 WA 1 ms 256 KB
1_14 WA 1 ms 256 KB
2_15 WA 10 ms 6656 KB
2_16 WA 10 ms 6656 KB
2_17 WA 10 ms 6784 KB
2_18 WA 10 ms 6656 KB
2_19 WA 10 ms 6656 KB
2_20 WA 10 ms 6656 KB
2_21 WA 10 ms 6656 KB
2_22 WA 8 ms 6656 KB
2_23 WA 10 ms 6784 KB
2_24 WA 10 ms 6656 KB