oj.uz

Submission #259317

# Submission time Handle Problem Language Result Execution time Memory
259317 2020-08-07T14:31:58 Z 최은수(#5042) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 109012 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18+7;
const int bk=505;
int cnt[100010];
vector<int>sv;
priority_queue<ll>pq,del;
inline void add(int x,int p)
{
    del.ep((ll)sv[x]*cnt[x]);
    cnt[x]+=p;
    pq.ep((ll)sv[x]*cnt[x]);
    return;
}
ll ans[100010];
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,q;
    cin>>n>>q;
    vector<int>v(n);
    for(int&t:v)
        cin>>t,sv.eb(t);
    sort(all(sv));
    sv.erase(unique(all(sv)),sv.end());
    v.insert(v.begin(),v[0]);
    for(int&t:v)
        t=lower_bound(all(sv),t)-sv.begin();
    vector<pair<pi,int> >qv;
    for(int i=0;i<q;i++)
    {
        int s,e;
        cin>>s>>e;
        qv.eb(pi(s,e),i);
    }
    sort(all(qv),[](const pair<pi,int>&x,const pair<pi,int>&y)
    {
        return x.fi.fi/bk==y.fi.fi/bk?x.fi.se<y.fi.se:x.fi.fi<y.fi.fi;
    });
    int cl=qv[0].fi.fi;
    int cr=qv[0].fi.fi-1;
    for(int&t:sv)
        pq.ep(0);
    for(auto&t:qv)
    {
        int l=t.fi.fi;
        int r=t.fi.se;
        while(cl<l)
            add(v[cl++],-1);
        while(cl>l)
            add(v[--cl],1);
        while(cr<r)
            add(v[++cr],1);
        while(cr>r)
            add(v[cr--],-1);
        while(!del.empty()&&pq.top()==del.top())
            pq.pop(),del.pop();
        ans[t.se]=pq.top();
    }
    for(int i=0;i<q;i++)
        cout<<ans[i]<<'\n';
    cout.flush();
    return 0;
}

Compilation message

historic.cpp: In function 'int32_t main()':
historic.cpp:55:13: warning: unused variable 't' [-Wunused-variable]
     for(int&t:sv)
             ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 2 ms 512 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 21 ms 1652 KB Output is correct
19 Correct 53 ms 2492 KB Output is correct
20 Correct 135 ms 3820 KB Output is correct
21 Correct 285 ms 3816 KB Output is correct
22 Correct 228 ms 3816 KB Output is correct
23 Correct 220 ms 3960 KB Output is correct
24 Correct 224 ms 3808 KB Output is correct
25 Correct 159 ms 8144 KB Output is correct
26 Correct 190 ms 8212 KB Output is correct
27 Correct 189 ms 6992 KB Output is correct
28 Correct 181 ms 7800 KB Output is correct
29 Correct 201 ms 6860 KB Output is correct
30 Correct 198 ms 6868 KB Output is correct
31 Correct 235 ms 3788 KB Output is correct
32 Correct 198 ms 2652 KB Output is correct
33 Correct 184 ms 7108 KB Output is correct
34 Correct 192 ms 13088 KB Output is correct
35 Correct 126 ms 13156 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 5 ms 1148 KB Output is correct
9 Correct 11 ms 1556 KB Output is correct
10 Correct 35 ms 1152 KB Output is correct
11 Correct 98 ms 5092 KB Output is correct
12 Correct 54 ms 3812 KB Output is correct
13 Correct 71 ms 5604 KB Output is correct
14 Correct 88 ms 5404 KB Output is correct
15 Correct 104 ms 7388 KB Output is correct
16 Correct 70 ms 7264 KB Output is correct
17 Correct 40 ms 4836 KB Output is correct
18 Correct 59 ms 7652 KB Output is correct
19 Correct 70 ms 8552 KB Output is correct
20 Correct 37 ms 5988 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 2 ms 512 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 21 ms 1652 KB Output is correct
19 Correct 53 ms 2492 KB Output is correct
20 Correct 135 ms 3820 KB Output is correct
21 Correct 285 ms 3816 KB Output is correct
22 Correct 228 ms 3816 KB Output is correct
23 Correct 220 ms 3960 KB Output is correct
24 Correct 224 ms 3808 KB Output is correct
25 Correct 159 ms 8144 KB Output is correct
26 Correct 190 ms 8212 KB Output is correct
27 Correct 189 ms 6992 KB Output is correct
28 Correct 181 ms 7800 KB Output is correct
29 Correct 201 ms 6860 KB Output is correct
30 Correct 198 ms 6868 KB Output is correct
31 Correct 235 ms 3788 KB Output is correct
32 Correct 198 ms 2652 KB Output is correct
33 Correct 184 ms 7108 KB Output is correct
34 Correct 192 ms 13088 KB Output is correct
35 Correct 126 ms 13156 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 3 ms 768 KB Output is correct
43 Correct 5 ms 1148 KB Output is correct
44 Correct 11 ms 1556 KB Output is correct
45 Correct 35 ms 1152 KB Output is correct
46 Correct 98 ms 5092 KB Output is correct
47 Correct 54 ms 3812 KB Output is correct
48 Correct 71 ms 5604 KB Output is correct
49 Correct 88 ms 5404 KB Output is correct
50 Correct 104 ms 7388 KB Output is correct
51 Correct 70 ms 7264 KB Output is correct
52 Correct 40 ms 4836 KB Output is correct
53 Correct 59 ms 7652 KB Output is correct
54 Correct 70 ms 8552 KB Output is correct
55 Correct 37 ms 5988 KB Output is correct
56 Correct 506 ms 3948 KB Output is correct
57 Correct 1221 ms 9296 KB Output is correct
58 Correct 1859 ms 50952 KB Output is correct
59 Correct 2949 ms 101028 KB Output is correct
60 Correct 3380 ms 109012 KB Output is correct
61 Execution timed out 4094 ms 52088 KB Time limit exceeded
62 Halted 0 ms 0 KB -