Submission #913954

# Submission time Handle Problem Language Result Execution time Memory
913954 2024-01-20T16:14:51 Z mychecksedad Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
388 ms 33412 KB
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;

int n, a[N], ans[N];
void solve(){
  cin >> n;
  for(int i = 1; i <= n; ++i) cin >> a[i];

  vector<pair<int, int>> q;
  map<int, vector<int>> last;

  for(int i = 1; i <= n; ++i){
    if(q.empty()){
      q.pb({a[i], 1});
      last[a[i]].pb(i);
    }else{
      if(last[a[i]].empty()){
        q.pb({a[i], 1});
        last[a[i]].pb(i);
      }else{
        int x = last[a[i]].back(), s = 0;
        if(x == i - 1){
          q.back().second++;
          last[a[i]].back() = i;
          continue;
        }
        for(int cur = i - 1; ;){
          cur -= q.back().second;
          s += q.back().second;
          last[q.back().first].pop_back();
          q.pop_back(); 
          if(cur == x){
            auto v = q.back();
            q.pop_back();
            last[a[i]].pop_back();
            last[a[i]].pb(i);
            q.pb({v.first, v.second + s + 1});
            break;
          }
        }
      }
    }
    // for(auto p: q) cout << p.first << ' ' << p.second << '\n';
    // cout << endl;
  }
  int x = 1;
  for(auto p: q){
    while(p.second--){
      ans[x] = p.first;
      ++x;
    }
    // cout << p.first << ' ' << p.second << '\n';
  }

  for(int i = 1; i <= n; ++i) cout << ans[i] << '\n';
}



int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    // en;
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:70:15: warning: unused variable 'aa' [-Wunused-variable]
   70 |   int tt = 1, aa;
      |               ^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2536 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2516 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2496 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2528 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2512 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 21 ms 7708 KB Output is correct
18 Correct 20 ms 7516 KB Output is correct
19 Correct 24 ms 7504 KB Output is correct
20 Correct 20 ms 7508 KB Output is correct
21 Correct 20 ms 7516 KB Output is correct
22 Correct 21 ms 7508 KB Output is correct
23 Correct 21 ms 7372 KB Output is correct
24 Correct 27 ms 7512 KB Output is correct
25 Correct 21 ms 7504 KB Output is correct
26 Correct 22 ms 7340 KB Output is correct
27 Correct 21 ms 7508 KB Output is correct
28 Correct 21 ms 7516 KB Output is correct
29 Correct 22 ms 7516 KB Output is correct
30 Correct 19 ms 7516 KB Output is correct
31 Correct 19 ms 7500 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2512 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2536 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2516 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2496 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2528 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2512 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 21 ms 7708 KB Output is correct
48 Correct 20 ms 7516 KB Output is correct
49 Correct 24 ms 7504 KB Output is correct
50 Correct 20 ms 7508 KB Output is correct
51 Correct 20 ms 7516 KB Output is correct
52 Correct 21 ms 7508 KB Output is correct
53 Correct 21 ms 7372 KB Output is correct
54 Correct 27 ms 7512 KB Output is correct
55 Correct 21 ms 7504 KB Output is correct
56 Correct 22 ms 7340 KB Output is correct
57 Correct 21 ms 7508 KB Output is correct
58 Correct 21 ms 7516 KB Output is correct
59 Correct 22 ms 7516 KB Output is correct
60 Correct 19 ms 7516 KB Output is correct
61 Correct 19 ms 7500 KB Output is correct
62 Correct 29 ms 10064 KB Output is correct
63 Correct 243 ms 32436 KB Output is correct
64 Correct 225 ms 32400 KB Output is correct
65 Correct 31 ms 9808 KB Output is correct
66 Correct 32 ms 9520 KB Output is correct
67 Correct 32 ms 9976 KB Output is correct
68 Correct 34 ms 10044 KB Output is correct
69 Correct 39 ms 9924 KB Output is correct
70 Correct 33 ms 10032 KB Output is correct
71 Correct 36 ms 10040 KB Output is correct
72 Correct 40 ms 10064 KB Output is correct
73 Correct 209 ms 21684 KB Output is correct
74 Correct 175 ms 21684 KB Output is correct
75 Correct 238 ms 33412 KB Output is correct
76 Correct 388 ms 33360 KB Output is correct
77 Correct 257 ms 33412 KB Output is correct
78 Correct 260 ms 33368 KB Output is correct