Submission #1179548

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179548		asli_bg	Grudanje (COCI19_grudanje)	C++20	70 / 70	55 ms	8252 KiB

grudanje

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

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
//#define int double

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (double)(l+r)/2

const int MAXN=1e5+5;
const int MOD=1e9+7;
const int INF=1e18;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    string s;
    cin>>s;

    int n=s.length();

    vii qq;

    int q;
    cin>>q;
    FOR(i,q){
        int l,r;
        cin>>l>>r;
        l--;r--;
        qq.pb({l,r});
    }

    sort(all(qq));

    vi a(n);
    vi val(n);
    FOR(i,n){
        cin>>a[i];
        val[a[i]-1]=i;
    }

    int ans=0;

    FOR(j,27){
        set<int> cur;
        int p1=0;
        int p2=0;
        FOR(i,q){
            int l=qq[i].fi;
            int r=qq[i].se;

            if(l!=p1){
                while(p1<l){
                    if(s[p1]-'a'==j) cur.erase(val[p1]);
                    p1++;
                }
                p2=max(p2,p1);
            }

            while(p2<=r){
                if(s[p2]-'a'==j) cur.insert(val[p2]);
                p2++;
            }

            //cout<<"here" sp l sp r sp p1 sp p2<<endl;
            //cont(cur);

            if(cur.size()>1){
                auto it=cur.end();
                it--;
                it--;
                ans=max(ans,*it+1);
            }
        }
    }

    cout<<ans<<endl;
}   

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7