Submission #844473

#	Time	Username	Problem	Language	Result	Execution time	Memory
844473		vjudge1	Nivelle (COCI20_nivelle)	C++17	13 / 110	1 ms	604 KiB

nivelle

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
#define pb push_back
#define endl '\n'
#define fi first
#define se second
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define CDIV(a,b) (((a)+(b)-(1))/(b))
const ll inf = 1e17 + 5;
const ll mod = 1e9 + 7;
const ll N = 1e3 + 30;

 
int mod_(int a, int b)
{
    if(a >= 0)return a % b;
    a += (-a/b + 1) * b;
    return a % b;
}


ld eps = 1e-9;

struct p{
    vector<int>pref;
    p()
    {
        pref.assign(26,0);
    }
    p operator-(const p& b)
    {
        p res;
        for(int i = 0; i < 26; ++i)
        {
            res.pref[i] = pref[i] - b.pref[i];
        }
        return res;
    }
};

void solve()
{
    int n;
    string s;
    cin >> n >> s;
    s.pb('z');
    bool a = any_of(s.begin(), s.end(), [&](char c){return c == 'a';});
    bool b = any_of(s.begin(), s.end(), [&](char c){return c == 'b';});
    int cnt = 1, mx = 1, l = 0, maxl = 0, maxr = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(s[i] != s[i - 1])
        {
            if(cnt > mx)
            {
                mx = cnt;
                maxl = l;
                maxr = i - 1;
            }
            l = i;
            cnt = 1;
        }
        else cnt++;
    }
    if(2 * (maxr - maxl + 1) <= n)maxl = 0, maxr = n - 1;
    cout << maxl + 1 << ' ' << maxr + 1 << endl;
    
}

int main()
{
    fio;
    //int t; cin >> t; while(t--)
    {
        solve();
    }
}

Compilation message (stderr)

nivelle.cpp: In function 'void solve()':
nivelle.cpp:50:10: warning: unused variable 'a' [-Wunused-variable]
   50 |     bool a = any_of(s.begin(), s.end(), [&](char c){return c == 'a';});
      |          ^
nivelle.cpp:51:10: warning: unused variable 'b' [-Wunused-variable]
   51 |     bool b = any_of(s.begin(), s.end(), [&](char c){return c == 'b';});
      |          ^

• Subtask 1: 0 / 7
• Subtask 2: 0 / 17
• Subtask 3: 13 / 13
• Subtask 4: 0 / 25
• Subtask 5: 0 / 48