oj.uz

Submission #572008

# Submission time Handle Problem Language Result Execution time Memory
572008 2022-06-03T09:08:26 Z zaneyu popa (BOI18_popa) C++14
100 / 100
 98 ms 408 KB 
/*input
1
6
1 2 3 4 5 6

*/
#include<bits/stdc++.h>
using namespace std;
#include "popa.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int solve(int n,int *L,int *R){
    vector<int> v;
    int rt;
    REP(i,n){
        L[i]=R[i]=-1;
        int pv=-1;
        while(sz(v) and query(v.back(),i,i,i)){
            int z=v.back();
            R[z]=pv;
            pv=z;
            v.pop_back();
        }
        L[i]=pv;
        if(!sz(v)) rt=i;
        else R[v.back()]=i;
        v.pb(i);
    }
    return rt;
}

Compilation message

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:82:12: warning: 'rt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   82 |     return rt;
      |            ^~

Subtask #1
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 208 KB Output is correct
2 Correct 10 ms 208 KB Output is correct
3 Correct 8 ms 208 KB Output is correct
4 Correct 10 ms 208 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 284 KB Output is correct
2 Correct 82 ms 296 KB Output is correct
3 Correct 51 ms 288 KB Output is correct
4 Correct 79 ms 408 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 284 KB Output is correct
2 Correct 98 ms 292 KB Output is correct
3 Correct 77 ms 292 KB Output is correct
4 Correct 88 ms 300 KB Output is correct