oj.uz

Submission #789863

# Submission time Handle Problem Language Result Execution time Memory
789863 2023-07-22T06:26:44 Z cig32 Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
 412 ms 160844 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
  int n; cin >> n;
  int a[n+1];
  for(int i=1; i<=n; i++) cin >> a[i];
  vector<pair<int,int>> add[n+1],sub[n+2];// {time, color}
  map<int, stack<int> >index; // list of elements, essentially
  stack<int> good; // can be considered the last element
  for(int i=1; i<=n; i++) {
    if(index[a[i]].size()) {
      int from = index[a[i]].top() + 1, to = i - 1;
      if(from <= to) {
        add[from].push_back({i, a[i]});
        sub[to+1].push_back({i, a[i]});
      }
      while(good.size() && good.top() >= from) {
        int x = good.top();
        index[a[x]].pop();
        good.pop();
      }
    }
    index[a[i]].push(i);
    good.push(i);

  }
  multiset<pair<int,int>>mst;
  for(int i=1;i<=n;i++){
    for(pair<int,int>x:add[i]) mst.insert(x);
    for(pair<int,int>x:sub[i]) mst.erase(x);
    if(mst.size()) cout << (*mst.rbegin()).second << "\n";
    else cout << a[i] << "\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

/*
7 1 2
1 2 5 8 11 12 14
11 16 12 18 2 7 8
4 4 11 20 1 20 13
14 9 3 16 9 19 16
9 10 15 10 5 4 19



*/

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 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 456 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 456 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 2 ms 1876 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 2 ms 1236 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 480 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 484 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 27 ms 15200 KB Output is correct
18 Correct 29 ms 15260 KB Output is correct
19 Correct 37 ms 16844 KB Output is correct
20 Correct 44 ms 16740 KB Output is correct
21 Correct 36 ms 16800 KB Output is correct
22 Correct 37 ms 16808 KB Output is correct
23 Correct 36 ms 16800 KB Output is correct
24 Correct 37 ms 16716 KB Output is correct
25 Correct 36 ms 16808 KB Output is correct
26 Correct 40 ms 16740 KB Output is correct
27 Correct 39 ms 16756 KB Output is correct
28 Correct 37 ms 16800 KB Output is correct
29 Correct 39 ms 19916 KB Output is correct
30 Correct 32 ms 15340 KB Output is correct
31 Correct 26 ms 15324 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 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 456 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 456 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 2 ms 1876 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 324 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 480 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 484 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 27 ms 15200 KB Output is correct
48 Correct 29 ms 15260 KB Output is correct
49 Correct 37 ms 16844 KB Output is correct
50 Correct 44 ms 16740 KB Output is correct
51 Correct 36 ms 16800 KB Output is correct
52 Correct 37 ms 16808 KB Output is correct
53 Correct 36 ms 16800 KB Output is correct
54 Correct 37 ms 16716 KB Output is correct
55 Correct 36 ms 16808 KB Output is correct
56 Correct 40 ms 16740 KB Output is correct
57 Correct 39 ms 16756 KB Output is correct
58 Correct 37 ms 16800 KB Output is correct
59 Correct 39 ms 19916 KB Output is correct
60 Correct 32 ms 15340 KB Output is correct
61 Correct 26 ms 15324 KB Output is correct
62 Correct 36 ms 18424 KB Output is correct
63 Correct 381 ms 159340 KB Output is correct
64 Correct 358 ms 159432 KB Output is correct
65 Correct 46 ms 19600 KB Output is correct
66 Correct 57 ms 19544 KB Output is correct
67 Correct 46 ms 19908 KB Output is correct
68 Correct 51 ms 19904 KB Output is correct
69 Correct 54 ms 19964 KB Output is correct
70 Correct 48 ms 20048 KB Output is correct
71 Correct 59 ms 20044 KB Output is correct
72 Correct 49 ms 18972 KB Output is correct
73 Correct 248 ms 87888 KB Output is correct
74 Correct 277 ms 99708 KB Output is correct
75 Correct 285 ms 160420 KB Output is correct
76 Correct 412 ms 160844 KB Output is correct
77 Correct 288 ms 160844 KB Output is correct
78 Correct 285 ms 160116 KB Output is correct