oj.uz

답안 #768966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768966 2023-06-29T03:20:16 Z bachhoangxuan Candies (JOI18_candies) C++17
100 / 100
 97 ms 13392 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,ans=0;cin >> n;
    vector<int> a(n+2),l(n+2),r(n+2);
    a[0]=a[n+1]=-inf;
    priority_queue<piii> pq;
    for(int i=0;i<=n+1;i++){
        if(i>=1 && i<=n) cin >> a[i];
        l[i]=r[i]=i;pq.push({a[i],{l[i],r[i]}});
    }
    for(int i=1;i<=(n+1)/2;i++){
        while(!pq.empty()){
            int lt=pq.top().se.fi,rt=pq.top().se.se;
            if(l[lt]!=rt || r[rt]!=lt) pq.pop();
            else break;
        }
        piii x=pq.top();pq.pop();
        int lt=x.se.fi,rt=x.se.se;ans+=x.fi;
        cout << ans << '\n';
        int nl=r[lt-1],nr=l[rt+1];
        l[lt]=r[rt]=r[lt-1]=l[rt+1]=-1;
        l[nl]=nr;r[nr]=nl;a[nl]+=a[rt+1]-a[lt];
        pq.push({a[nl],{nl,nr}});
    }
}
signed main(){
    //freopen("candies.inp","r",stdin);
    //freopen("candies.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 2 ms 444 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 2 ms 444 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 84 ms 13260 KB Output is correct
22 Correct 87 ms 13228 KB Output is correct
23 Correct 92 ms 13276 KB Output is correct
24 Correct 66 ms 13056 KB Output is correct
25 Correct 66 ms 13104 KB Output is correct
26 Correct 69 ms 13120 KB Output is correct
27 Correct 78 ms 13224 KB Output is correct
28 Correct 81 ms 13232 KB Output is correct
29 Correct 81 ms 13228 KB Output is correct
30 Correct 75 ms 13228 KB Output is correct
31 Correct 76 ms 13232 KB Output is correct
32 Correct 81 ms 13328 KB Output is correct
33 Correct 76 ms 12960 KB Output is correct
34 Correct 97 ms 13068 KB Output is correct
35 Correct 85 ms 13080 KB Output is correct
36 Correct 85 ms 13236 KB Output is correct
37 Correct 84 ms 13272 KB Output is correct
38 Correct 83 ms 13232 KB Output is correct
39 Correct 68 ms 13024 KB Output is correct
40 Correct 77 ms 13088 KB Output is correct
41 Correct 84 ms 13200 KB Output is correct
42 Correct 75 ms 13216 KB Output is correct
43 Correct 74 ms 13232 KB Output is correct
44 Correct 74 ms 13232 KB Output is correct
45 Correct 82 ms 13240 KB Output is correct
46 Correct 91 ms 13392 KB Output is correct
47 Correct 88 ms 13232 KB Output is correct
48 Correct 76 ms 13056 KB Output is correct
49 Correct 78 ms 13052 KB Output is correct
50 Correct 75 ms 13060 KB Output is correct