oj.uz

Submission #757289

# Submission time Handle Problem Language Result Execution time Memory
757289 2023-06-13T02:15:42 Z bachhoangxuan Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 253 ms 19912 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)
- 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 fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
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;cin >> n;
    vector<pii> p;
    map<int,int> mp;
    for(int i=1;i<=n;i++){
        int a,cur=1;cin >> a;
        if(mp[a]){
            while(!p.empty() && p.back().fi!=a){
                mp[p.back().fi]-=p.back().se;
                cur+=p.back().se,p.pop_back();
            }
            p.back().se+=cur;
        }
        else p.push_back({a,1});
        mp[a]+=cur;
    }
    for(auto &[x,cnt]:p){
        while(cnt--) cout << x << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 22 ms 1032 KB Output is correct
18 Correct 25 ms 1180 KB Output is correct
19 Correct 24 ms 1004 KB Output is correct
20 Correct 26 ms 920 KB Output is correct
21 Correct 24 ms 1072 KB Output is correct
22 Correct 24 ms 1100 KB Output is correct
23 Correct 24 ms 1112 KB Output is correct
24 Correct 25 ms 1088 KB Output is correct
25 Correct 24 ms 1016 KB Output is correct
26 Correct 23 ms 1100 KB Output is correct
27 Correct 25 ms 1044 KB Output is correct
28 Correct 25 ms 1072 KB Output is correct
29 Correct 23 ms 1020 KB Output is correct
30 Correct 22 ms 848 KB Output is correct
31 Correct 21 ms 1100 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 328 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 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 324 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 22 ms 1032 KB Output is correct
48 Correct 25 ms 1180 KB Output is correct
49 Correct 24 ms 1004 KB Output is correct
50 Correct 26 ms 920 KB Output is correct
51 Correct 24 ms 1072 KB Output is correct
52 Correct 24 ms 1100 KB Output is correct
53 Correct 24 ms 1112 KB Output is correct
54 Correct 25 ms 1088 KB Output is correct
55 Correct 24 ms 1016 KB Output is correct
56 Correct 23 ms 1100 KB Output is correct
57 Correct 25 ms 1044 KB Output is correct
58 Correct 25 ms 1072 KB Output is correct
59 Correct 23 ms 1020 KB Output is correct
60 Correct 22 ms 848 KB Output is correct
61 Correct 21 ms 1100 KB Output is correct
62 Correct 34 ms 4268 KB Output is correct
63 Correct 234 ms 17928 KB Output is correct
64 Correct 224 ms 17640 KB Output is correct
65 Correct 36 ms 3948 KB Output is correct
66 Correct 36 ms 3748 KB Output is correct
67 Correct 37 ms 4172 KB Output is correct
68 Correct 38 ms 3620 KB Output is correct
69 Correct 40 ms 2764 KB Output is correct
70 Correct 39 ms 3976 KB Output is correct
71 Correct 37 ms 4040 KB Output is correct
72 Correct 39 ms 3148 KB Output is correct
73 Correct 139 ms 11736 KB Output is correct
74 Correct 135 ms 12012 KB Output is correct
75 Correct 154 ms 19472 KB Output is correct
76 Correct 253 ms 19912 KB Output is correct
77 Correct 172 ms 19900 KB Output is correct
78 Correct 178 ms 18524 KB Output is correct