제출 #244398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244398		rqi	케이크 (CEOI14_cake)	C++14	0 / 100	2091 ms	3824 KiB

cake

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

const int mx = 250005;

int N, a, Q;
int d[mx];
vpi rig; //pos, val
vpi lef;

void setTop(int pos, int val){
    d[pos] = val;
    if(pos == a) return;
    if(pos < a){
        while(sz(lef)){

            pi x = lef.bk;
            if(x.f <= pos) lef.pop_back();
            else break;
        }
        lef.pb(mp(pos, val));
    }
    else{
        while(sz(rig)){
            pi x = rig.bk;
            if(x.f >= pos) lef.pop_back();
            else break;
        }
        lef.pb(mp(pos, val));
    }
}

int main() {
    setIO();
    
    cin >> N >> a;
    for(int i = 1; i <= N; i++){
        cin >> d[i];
    }
    cin >> Q;

    vi keep(min(10, N)); //position of top 10 from highest to lowest
    for(int i = 1; i <= N; i++){
        if(d[i] >= N-sz(keep)+1){
            keep[N-d[i]] = i;
        }
    }

    
    for(int i = a+1; i <= N; i++){
        if(sz(rig) == 0 || d[i] > rig.bk.s){
            rig.pb(mp(i, d[i]));
        }
    }
    for(int i = a-1; i >= 1; i--){
        if(sz(lef) == 0 || d[i] > lef.bk.s){
            lef.pb(mp(i, d[i]));
        }
    }

    int curmax = N; // maximum in d[]
    for(int q = 1; q <= Q; q++){
        //dbg(q);
        char typ;
        cin >> typ;
        if(typ == 'E'){
            int i, e;
            cin >> i >> e;
            setTop(i, ++curmax);
            for(int j = e-2; j >= 0; j--){
                setTop(keep[j], ++curmax);
            }
            bool inkeep = 0;
            for(int j = 0; j < sz(keep); j++){
                if(keep[j] == i) inkeep = 1;
            }
            vi newkeep;
            if(inkeep){
                for(int j = 0; j < e-1; j++){
                    newkeep.pb(keep[j]);
                }
                newkeep.pb(i);
                for(int j = e-1; j < sz(keep); j++){
                    if(keep[j] == i) continue;
                    newkeep.pb(keep[j]);
                }
            }
            else{
                for(int j = 0; j < e-1; j++){
                    newkeep.pb(keep[j]);
                }
                newkeep.pb(i);
                for(int j = e-1; j < sz(keep)-1; j++){
                    newkeep.pb(keep[j]);
                }
            }
            swap(keep, newkeep);
        }
        else{
            int b;
            cin >> b;
            if(b == a){
                ps(0);
                continue;
            }
            else if(b < a){
                if(a == N){
                    ps(a-b);
                    continue;
                }

                //dbg(q, lef, rig);
                int lo = 0;
                int hi = sz(lef)-1;
                while(lo < hi){
                    int mid = (lo+hi)/2+1;
                    if(lef[mid].f < b){
                        hi = mid-1;
                    }
                    else lo = mid;
                }
                int val = lef[lo].s;
                //dbg(lo, val);
                lo = 0;
                hi = sz(rig)-1;
                while(lo < hi){
                    int mid = (lo+hi)/2;
                    if(rig[mid].s > val){
                        hi = mid;
                    }
                    else lo = mid+1;
                    //dbg("HI");
                }

                //dbg(lo, rig[lo]);

                if(val > rig[lo].s){
                    ps(N-b);
                }
                else ps(rig[lo].f-b-1);
            }
            else{
                if(a == 1){
                    ps(b-a);
                    continue;
                }
                //dbg(q, lef, rig);
                int lo = 0;
                int hi = sz(rig)-1;
                while(lo < hi){
                    int mid = (lo+hi)/2+1;
                    if(rig[mid].f > b){
                        hi = mid-1;
                    }
                    else lo = mid;
                    //dbg("HI");
                }
                int val = rig[lo].s;
                //dbg(lo, val);
                lo = 0;
                hi = sz(lef)-1;
                while(lo < hi){
                    int mid = (lo+hi)/2;
                    if(lef[mid].s > val){
                        hi = mid;
                    }
                    else lo = mid+1;
                    //dbg("HI");
                }
                //dbg(lo, lef[lo]);
                if(val > lef[lo].s){
                    ps(b-1);
                }
                else ps(b-lef[lo].f-1);

            }
        }
    }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

컴파일 시 표준 에러 (stderr) 메시지

cake.cpp: In function 'void setIn(std::__cxx11::string)':
cake.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
cake.cpp: In function 'void setOut(std::__cxx11::string)':
cake.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50