Submission #311222

#	Time	Username	Problem	Language	Result	Execution time	Memory
311222		leaked	Grudanje (COCI19_grudanje)	C++14	70 / 70	42 ms	4404 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);
}
int a[N];
pii t[4*N];
vec<pii>q;
string s;
set<int>pos[26];
int mx[N];
signed main()
{
    fast_io;
    cin>>s;
    int n=sz(s);
    int t;
    cin>>t;
    q.resize(t);
    int j=0;
    fill(mx,mx+N+1,-1);
    for(auto &z : q) cin>>z.f>>z.s,z.f--,z.s--,umax(mx[z.f],z.s);
    for(int i=1;i<n;i++){
        umax(mx[i],mx[i-1]);
    }
    vec<int>b;
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        b.p_b(x-1);
    }
    for(int i=n-1;i>=0;i--){
        auto it=pos[s[b[i]]-'a'].lower_bound(b[i]);
        if(it!=pos[s[b[i]]-'a'].end()){
            if(mx[b[i]]>=*it){
                cout<<i+1;
                exit(0);
            }
        }
        if(it!=pos[s[b[i]]-'a'].begin()){
            it--;
            if(mx[*it]>=b[i]){
                cout<<i+1;
                exit(0);
            }
        }
        pos[s[b[i]]-'a'].insert(b[i]);
    }
    cout<<0;
    return 0;
}
/*



*/

Compilation message (stderr)

grudanje.cpp: In function 'int main()':
grudanje.cpp:114:9: warning: unused variable 'j' [-Wunused-variable]
  114 |     int j=0;
      |         ^
grudanje.cpp:115:9: warning: array subscript 200004 is outside array bounds of 'int [200003]' [-Warray-bounds]
  115 |     fill(mx,mx+N+1,-1);
      |     ~~~~^~~~~~~~~~~~~~
grudanje.cpp:105:5: note: while referencing 'mx'
  105 | int mx[N];
      |     ^~

• 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