oj.uz

Submission #924150

# Submission time Handle Problem Language Result Execution time Memory
924150 2024-02-08T14:38:46 Z adhityamv Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 268 ms 28704 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
int INF=1000000000;
void solve(){
    int n;
    cin >>n;
    int a[n];
    for(int i=0;i<n;i++) cin >> a[i];
    set<int> allvals;
    map<int,int> index;
    int ind=0;
    vector<int> val;
    for(int i=0;i<n;i++){
        if(allvals.find(a[i])==allvals.end()){
            val.push_back(a[i]);
            index[a[i]]=ind;
            ind++;
            allvals.insert(a[i]);
        }
    }
    int b[n];
    for(int i=0;i<n;i++) b[i]=index[a[i]];
    stack<pii> ans;
    int nind[n];
    for(int i=0;i<n;i++) nind[b[i]]=b[i];
    int oind[n];
    for(int i=0;i<n;i++) oind[nind[b[i]]]=nind[b[i]];
    for(int i=0;i<n;i++){
        if(oind[nind[b[i]]]!=b[i]){
            nind[b[i]]=ans.top().first+1;
            oind[nind[b[i]]]=b[i];
        }
        if(!ans.empty() && nind[b[i]]>ans.top().first){
            oind[ans.top().first+1]=oind[nind[b[i]]];
            nind[b[i]]=ans.top().first+1;
        }
        while(!ans.empty() && ans.top().first>=nind[b[i]]){
            ans.pop();
        }
        ans.push(mp(nind[b[i]],i));
    }
    int fans[n];
    ind=n-1;
    int pv=-1;
    while(!ans.empty()){
        auto p=ans.top();
        ans.pop();
        while(ind>p.second){
            fans[ind]=val[oind[pv]];
            ind--;
        }
        pv=p.first;
    }
    while(ind>=0){
        fans[ind]=val[oind[pv]];
        ind--;
    }
    for(int i=0;i<n;i++) cout << fans[i] << "\n";
}
signed main(){
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    t=1;
    //cin >> t;
    while(t--) solve();
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 600 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 544 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 21 ms 4696 KB Output is correct
18 Correct 20 ms 4700 KB Output is correct
19 Correct 23 ms 4700 KB Output is correct
20 Correct 24 ms 4744 KB Output is correct
21 Correct 23 ms 4700 KB Output is correct
22 Correct 23 ms 4696 KB Output is correct
23 Correct 22 ms 4828 KB Output is correct
24 Correct 23 ms 4696 KB Output is correct
25 Correct 23 ms 4692 KB Output is correct
26 Correct 23 ms 4700 KB Output is correct
27 Correct 23 ms 4696 KB Output is correct
28 Correct 23 ms 4688 KB Output is correct
29 Correct 20 ms 4692 KB Output is correct
30 Correct 23 ms 4712 KB Output is correct
31 Correct 19 ms 4700 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 544 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 21 ms 4696 KB Output is correct
48 Correct 20 ms 4700 KB Output is correct
49 Correct 23 ms 4700 KB Output is correct
50 Correct 24 ms 4744 KB Output is correct
51 Correct 23 ms 4700 KB Output is correct
52 Correct 23 ms 4696 KB Output is correct
53 Correct 22 ms 4828 KB Output is correct
54 Correct 23 ms 4696 KB Output is correct
55 Correct 23 ms 4692 KB Output is correct
56 Correct 23 ms 4700 KB Output is correct
57 Correct 23 ms 4696 KB Output is correct
58 Correct 23 ms 4688 KB Output is correct
59 Correct 20 ms 4692 KB Output is correct
60 Correct 23 ms 4712 KB Output is correct
61 Correct 19 ms 4700 KB Output is correct
62 Correct 28 ms 6236 KB Output is correct
63 Correct 254 ms 26564 KB Output is correct
64 Correct 268 ms 27588 KB Output is correct
65 Correct 33 ms 7248 KB Output is correct
66 Correct 32 ms 7348 KB Output is correct
67 Correct 35 ms 7412 KB Output is correct
68 Correct 36 ms 7508 KB Output is correct
69 Correct 35 ms 7504 KB Output is correct
70 Correct 33 ms 7544 KB Output is correct
71 Correct 34 ms 7504 KB Output is correct
72 Correct 37 ms 7568 KB Output is correct
73 Correct 145 ms 18048 KB Output is correct
74 Correct 146 ms 18188 KB Output is correct
75 Correct 251 ms 28704 KB Output is correct
76 Correct 252 ms 28616 KB Output is correct
77 Correct 254 ms 28612 KB Output is correct
78 Correct 247 ms 28612 KB Output is correct