Submission #311206

#	Time	Username	Problem	Language	Result	Execution time	Memory
311206		leaked	Grudanje (COCI19_grudanje)	C++14	35 / 70	2089 ms	84856 KiB

grudanje

#include<bits/stdc++.h>
using namespace std;
//#define int long long
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//    #pragma GCC target("avx,avx2,fma")
//    #pragma GCC optimization ("unroll-loops")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define vec vector
#define s second
#define vi_a vector<int>a;
#define p_b push_back
#define pb push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define int long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll RR=1e4;
const ll tx[8]={1,-1,2,-2,-1,-2};
const ll ty[8]={-2,-2,-1,-1,2,1};
const char rev_to[4]={'E','W','N','S'};
const int M=1e9+7;
const int N=2e5+3;
const int ppp=73;
const int K=2e5+2;
const int block=600;
const int OPEN=1;
const int CLOSE=0;
//typedef pair<long long,int> pli;
//typedef tree<pli,null_type,less<pli>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<int>(1,5969699),mt19937(time(0)));
void bad(){
    cout<<"IMPOSSIBLE";
    exit(0);
}
struct node{
    node *l,*r;
    int vl;
    node(){
        l=r=nullptr;
        vl=0;
    }
};
node * build(int tl,int tr){
    node *u=new node();
    if(tl==tr){
        return u;
    }
    else{
        int tm=(tl+tr)>>1;
        u->l=build(tl,tm);
        u->r=build(tm+1,tr);
        return u;
    }
}
node *upd(node *v,int id,int vl,int tl,int tr){
    node *u=new node;
    *u = *v;
    if(tl==tr){
        u->vl=vl;
        return u;
    }
    int tm=(tl+tr)>>1;
    if(tm>=id)
        u->l=upd(v->l,id,vl,tl,tm);
    else
        u->r=upd(v->r,id,vl,tm+1,tr);
    u->vl=u->l->vl+u->r->vl;
    return u;
}
int get(int l,int r,node *v,int tl,int tr){
    if(tl>=l && tr<=r){
        return v->vl;
    }
    if(tl>r || tr<l) return 0;
    int tm=(tl+tr)>>1;
    return get(l,r,v->l,tl,tm)+get(l,r,v->r,tm+1,tr);
}
int n;
vec<pii>q;
vec<int>upde;
node  *pref[N];
vec<int>lol[N];
string s;
int got(int l,int r,int c){
    return lol[r][c]-(l?lol[l-1][c]:0);
}
bool ok(int l,int r,int i,int c){
    int vl=(~i?get(l,r,pref[i],0,n-1):0);
        if(got(l,r,c)-vl>1){
            return 0;
        }
//    }
    return 1;
}
signed main()
{
    fast_io;
    cin>>s;
    n=sz(s);
    for(int i=0;i < n;i++){
        if(i)
            lol[i]=lol[i-1];
        else
            lol[i].assign(26,0);
        lol[i][s[i]-'a']++;
    }
    int t;
    cin>>t;
    q.resize(t);
    for(auto &z : q) cin>>z.f>>z.s,--z.f,--z.s;
    upde.resize(n);
    for(int i=0;i<n;i++)pref[i]=new node();
    pref[0]=build(0,n-1);
    for(int i=0;i<n;i++){
        cin>>upde[i];--upde[i];
    }
    int mx=-1;
    for(int c=0;c<26;c++){
        for(int i=0;i<n;i++){
            if(i){
                *pref[i] = *pref[i-1];
            }
            if(s[upde[i]]-'a'==c)pref[i]=upd(pref[i],upde[i],1,0,n-1);
        }
        for(int i=0;i<t;i++){
            int l=-1,r=n-1;
            while(l!=r){
                int tm=(l+r)>>1;
                if(ok(q[i].f,q[i].s,tm,c)){
                    r=tm;
                }
                else l=tm+1;
            }
//            debug()<<imie(l);
            umax(mx,l);
        }
    }
    cout<<mx+1;
    return 0;
}
/*



*/

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