답안 #78658 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
78658	2018-10-06T21:25:20 Z	duality	케이크 (CEOI14_cake)	C++11	46.6667 / 100	2000 ms	15848 KB

cake

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int d[250000];
set<pii,greater<pii> > S;
int tree[1 << 19];
int build(int s,int e,int i) {
    if (s == e) {
        tree[i] = d[s];
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(build(s,mid,2*i+1),build(mid+1,e,2*i+2));
    return tree[i];
}
int update(int s,int e,int ai,int i,int num) {
    if ((s > ai) || (e < ai)) return tree[i];
    else if (s == e) {
        tree[i] = d[s] = num;
        return tree[i];
    }

    int mid = (s+e) / 2;
    tree[i] = max(update(s,mid,ai,2*i+1,num),update(mid+1,e,ai,2*i+2,num));
    return tree[i];
}
int query(int s,int e,int qs,int qe,int i) {
    if ((s > qe) || (e < qs)) return 0;
    else if ((s >= qs) && (e <= qe)) return tree[i];

    int mid = (s+e) / 2;
    return max(query(s,mid,qs,qe,2*i+1),query(mid+1,e,qs,qe,2*i+2));
}
int main() {
    int i,j;
    int N,Q,a;
    char c;
    int p,e,b;
    scanf("%d %d",&N,&a),a--;
    for (i = 0; i < N; i++) scanf("%d",&d[i]),S.insert(mp(d[i],i));
    scanf("%d",&Q);
    build(0,N-1,0);
    for (i = 0; i < Q; i++) {
        scanf(" %c",&c);
        if (c == 'E') {
            scanf("%d %d",&p,&e),p--;
            vpii v;
            for (j = 0; j < e-1; j++) v.pb(*S.begin()),S.erase(S.begin());
            S.erase(mp(d[p],p));
            update(0,N-1,p,0,(e == 1) ? N+i+1:v.back().first);
            S.insert(mp(d[p],p));
            for (j = 0; j < v.size(); j++) update(0,N-1,v[j].second,0,v[j].first+1),S.insert(mp(v[j].first+1,v[j].second));
        }
        else {
            scanf("%d",&b),b--;
            int l = a,r = a;
            while ((l > b) || (r < b)) {
                int ll = (l == 0) ? MAX_VAL:d[l-1];
                int rr = (r == N-1) ? MAX_VAL:d[r+1];
                if (ll < rr) l--;
                else r++;
            }
            printf("%d\n",r-l);
            /*if (a == b) printf("0\n");
            else if (a < b) {
                int x = query(0,N-1,a,b,0);
                int l = 0,r = a;
                while (l < r) {
                    int m = (l+r) / 2;
                    if (query(0,N-1,m,b,0) <= x) r = m;
                    else l = m+1;
                }
                printf("%d\n",b-l);
            }
            else {
                int x = query(0,N-1,b,a,0);
                int l = a,r = N-1;
                while (l < r) {
                    int m = (l+r+1) / 2;
                    if (query(0,N-1,b,m,0) <= x) l = m;
                    else r = m-1;
                }
                printf("%d\n",l-b);
            }*/
        }
    }

    return 0;
}

Compilation message

cake.cpp: In function 'int main()':
cake.cpp:107:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < v.size(); j++) update(0,N-1,v[j].second,0,v[j].first+1),S.insert(mp(v[j].first+1,v[j].second));
                         ~~^~~~~~~~~~
cake.cpp:94:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&a),a--;
     ~~~~~~~~~~~~~~~~~~~~^~~~
cake.cpp:95:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&d[i]),S.insert(mp(d[i],i));
                             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
cake.cpp:96:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&Q);
     ~~~~~^~~~~~~~~
cake.cpp:99:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c",&c);
         ~~~~~^~~~~~~~~~
cake.cpp:101:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d",&p,&e),p--;
             ~~~~~~~~~~~~~~~~~~~~^~~~
cake.cpp:110:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&b),b--;
             ~~~~~~~~~~~~~~^~~~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	11 ms	736 KB	Output is correct
5	Correct	66 ms	1352 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	767 ms	1408 KB	Output is correct
2	Correct	410 ms	1408 KB	Output is correct
3	Correct	490 ms	1408 KB	Output is correct
4	Correct	301 ms	1408 KB	Output is correct
5	Correct	848 ms	2304 KB	Output is correct
6	Correct	727 ms	2304 KB	Output is correct
7	Correct	588 ms	2304 KB	Output is correct
8	Correct	370 ms	2304 KB	Output is correct

Subtask #3
0.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2078 ms	7056 KB	Time limit exceeded
2	Execution timed out	2079 ms	7172 KB	Time limit exceeded
3	Execution timed out	2068 ms	7304 KB	Time limit exceeded
4	Correct	2 ms	7304 KB	Output is correct
5	Execution timed out	2074 ms	15792 KB	Time limit exceeded
6	Execution timed out	2080 ms	15848 KB	Time limit exceeded
7	Execution timed out	2073 ms	15848 KB	Time limit exceeded

Subtask #4
16.666667 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	162 ms	15848 KB	Output is correct
2	Correct	181 ms	15848 KB	Output is correct
3	Correct	1897 ms	15848 KB	Output is correct
4	Correct	1857 ms	15848 KB	Output is correct
5	Correct	322 ms	15848 KB	Output is correct
6	Execution timed out	2057 ms	15848 KB	Time limit exceeded
7	Correct	1066 ms	15848 KB	Output is correct
8	Correct	516 ms	15848 KB	Output is correct
9	Execution timed out	2066 ms	15848 KB	Time limit exceeded
10	Correct	1118 ms	15848 KB	Output is correct
11	Execution timed out	2060 ms	15848 KB	Time limit exceeded
12	Execution timed out	2064 ms	15848 KB	Time limit exceeded
13	Execution timed out	2059 ms	15848 KB	Time limit exceeded

답안 #78658

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 15.0 / 15.0

Subtask #3 0.0 / 20.0

Subtask #4 16.666667 / 50.0

Subtask #1
15.0 / 15.0

Subtask #2
15.0 / 15.0

Subtask #3
0.0 / 20.0

Subtask #4
16.666667 / 50.0