oj.uz

답안 #259263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259263 2020-08-07T13:23:02 Z 문홍윤(#5063) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 101212 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;

vector<pair<pii, int> > cmp;
pii qu[100010];
int n, q, arr[100010], cha[100010], cnt[100010];
vector<int> id;
LL ans[100010];

inline int readChar();
template<class T=int> inline T readInt();
template<class T> inline void writeInt(T x, char end=0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size=4096;
inline int getChar(){
    static char buf[buf_size];
    static int len=0, pos=0;
    if(pos==len)pos=0, len=fread(buf, 1, buf_size, stdin);
    if(pos==len)return -1;
    return buf[pos++];
}
inline int readChar(){
    int c=getChar();
    while(c<=32)c=getChar();
    return c;
}
template <class T>
inline T readInt(){
    int s=1, c=readChar();
    T x=0;
    if(c=='-')s=-1, c=getChar();
    while('0'<= c&&c<='9')x=x*10+c-'0', c=getChar();
    return s==1?x:-x;
}

priority_queue<LL> pq, del;
inline void dlt(LL a){del.push(a);}
inline void in(LL a){pq.push(a);}
inline LL tp(){
    while(!del.empty()){
        if(del.top()==pq.top()){
            del.pop(); pq.pop();
        }
        else break;
    }
    return pq.top();
}

inline void ins(int num){
    num=arr[num];
    if(cnt[num])dlt((LL)cha[num]*cnt[num]);
    cnt[num]++;
    in((LL)cha[num]*cnt[num]);
}
inline void er(int num){
    num=arr[num];
    dlt((LL)cha[num]*cnt[num]);
    cnt[num]--;
    if(cnt[num])in((LL)cha[num]*cnt[num]);
}

int main(){
    n=readInt();
    q=readInt();
    int sq=sqrt(n);
    id.resize(n);
    for(int i=1; i<=n; i++){
        arr[i]=readInt();
        id[i-1]=arr[i];
    }
    svec(id); press(id);
    for(int i=1; i<=n; i++){
        int tmp=lb(id, arr[i])-id.begin()+1;
        cha[tmp]=arr[i];
        arr[i]=tmp;
    }
    cmp.resize(q);
    for(int i=1; i<=q; i++){
        qu[i].F=readInt();
        qu[i].S=readInt();
        cmp[i-1]=mp(mp(qu[i].F/sq, qu[i].S), i);
    }
    svec(cmp);
    int l=1, r=0;
    for(auto i:cmp){
        while(qu[i.S].F<l)ins(--l);
        while(qu[i.S].S>r)ins(++r);
        while(qu[i.S].F>l)er(l++);
        while(qu[i.S].S<r)er(r--);
        ans[i.S]=tp();
    }
    for(int i=1; i<=q; i++)printf("%lld\n", ans[i]);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 5 ms 576 KB Output is correct
19 Correct 18 ms 972 KB Output is correct
20 Correct 54 ms 1228 KB Output is correct
21 Correct 117 ms 1524 KB Output is correct
22 Correct 104 ms 1732 KB Output is correct
23 Correct 111 ms 1144 KB Output is correct
24 Correct 114 ms 1372 KB Output is correct
25 Correct 72 ms 3936 KB Output is correct
26 Correct 82 ms 3940 KB Output is correct
27 Correct 85 ms 2616 KB Output is correct
28 Correct 73 ms 3896 KB Output is correct
29 Correct 91 ms 3936 KB Output is correct
30 Correct 94 ms 2628 KB Output is correct
31 Correct 114 ms 1228 KB Output is correct
32 Correct 97 ms 1016 KB Output is correct
33 Correct 91 ms 3924 KB Output is correct
34 Correct 89 ms 3940 KB Output is correct
35 Correct 58 ms 3904 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 4 ms 896 KB Output is correct
9 Correct 9 ms 1532 KB Output is correct
10 Correct 25 ms 1276 KB Output is correct
11 Correct 75 ms 5368 KB Output is correct
12 Correct 59 ms 3428 KB Output is correct
13 Correct 56 ms 3820 KB Output is correct
14 Correct 67 ms 4716 KB Output is correct
15 Correct 60 ms 5752 KB Output is correct
16 Correct 40 ms 5868 KB Output is correct
17 Correct 24 ms 4612 KB Output is correct
18 Correct 39 ms 7004 KB Output is correct
19 Correct 34 ms 6768 KB Output is correct
20 Correct 20 ms 4084 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 5 ms 576 KB Output is correct
19 Correct 18 ms 972 KB Output is correct
20 Correct 54 ms 1228 KB Output is correct
21 Correct 117 ms 1524 KB Output is correct
22 Correct 104 ms 1732 KB Output is correct
23 Correct 111 ms 1144 KB Output is correct
24 Correct 114 ms 1372 KB Output is correct
25 Correct 72 ms 3936 KB Output is correct
26 Correct 82 ms 3940 KB Output is correct
27 Correct 85 ms 2616 KB Output is correct
28 Correct 73 ms 3896 KB Output is correct
29 Correct 91 ms 3936 KB Output is correct
30 Correct 94 ms 2628 KB Output is correct
31 Correct 114 ms 1228 KB Output is correct
32 Correct 97 ms 1016 KB Output is correct
33 Correct 91 ms 3924 KB Output is correct
34 Correct 89 ms 3940 KB Output is correct
35 Correct 58 ms 3904 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 640 KB Output is correct
43 Correct 4 ms 896 KB Output is correct
44 Correct 9 ms 1532 KB Output is correct
45 Correct 25 ms 1276 KB Output is correct
46 Correct 75 ms 5368 KB Output is correct
47 Correct 59 ms 3428 KB Output is correct
48 Correct 56 ms 3820 KB Output is correct
49 Correct 67 ms 4716 KB Output is correct
50 Correct 60 ms 5752 KB Output is correct
51 Correct 40 ms 5868 KB Output is correct
52 Correct 24 ms 4612 KB Output is correct
53 Correct 39 ms 7004 KB Output is correct
54 Correct 34 ms 6768 KB Output is correct
55 Correct 20 ms 4084 KB Output is correct
56 Correct 335 ms 1784 KB Output is correct
57 Correct 1058 ms 8024 KB Output is correct
58 Correct 1712 ms 28504 KB Output is correct
59 Correct 2953 ms 54528 KB Output is correct
60 Correct 3504 ms 101212 KB Output is correct
61 Execution timed out 4030 ms 34732 KB Time limit exceeded
62 Halted 0 ms 0 KB -