oj.uz

답안 #799285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799285 2023-07-31T11:48:20 Z radaiosm7 Stone Arranging 2 (JOI23_ho_t1) C++
100 / 100
 253 ms 30116 KB 
#include <bits/stdc++.h>
using namespace std;
int n, m, i, x;
int seg[800020];
int ans[200005];
map<int, vector<int> > col;

void update(int from, int to, int l=1, int r=n, int indx=1) {
  if (from == l && to == r) {
    seg[indx] = x;
    return;
  }

  int mid = (l+r)/2;

  if (seg[indx] != 0) {
    seg[2*indx] = seg[indx];
    seg[2*indx+1] = seg[indx];
    seg[indx] = 0;
  }

  if (to <= mid) update(from, to, l, mid, 2*indx);
  else if (from > mid) update(from, to, mid+1, r, 2*indx+1);
  
  else {
    update(from, mid, l, mid, 2*indx);
    update(mid+1, to, mid+1, r, 2*indx+1);
  }
}

int query(int pos, int l=1, int r=n, int indx=1) {
  if (l == r) return seg[indx];
  int mid = (l+r)/2;

  if (seg[indx] != 0) {
    seg[2*indx] = seg[indx];
    seg[2*indx+1] = seg[indx];
    seg[indx] = 0;
  }

  if (pos <= mid) return query(pos, l, mid, 2*indx);
  else return query(pos, mid+1, r, 2*indx+1);
}

void build(int l=1, int r=n, int indx=1) {
  if (l == r) {
    ans[l] = seg[indx];
    return;
  }

  int mid = (l+r)/2;

  if (seg[indx] != 0) {
    seg[2*indx] = seg[indx];
    seg[2*indx+1] = seg[indx];
    seg[indx] = 0;
  }

  build(l, mid, 2*indx);
  build(mid+1, r, 2*indx+1);
}

int main() {
  scanf("%d", &n);
  fill(seg, seg+800015, 0);

  for (i=1; i <= n; ++i) {
    scanf("%d", &x);
    if (col.find(x) == col.end()) col[x] = {};
    while (!col[x].empty() && query(col[x].back()) != x) col[x].pop_back();
    if (!col[x].empty()) update(col[x].back(), i);
    else update(i, i);
    col[x].push_back(i);
  }

  build();
  for (i=1; i <= n; ++i) printf("%d\n", ans[i]);
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
Main.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     scanf("%d", &x);
      |     ~~~~~^~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 1 ms 3412 KB Output is correct
4 Correct 1 ms 3412 KB Output is correct
5 Correct 2 ms 3384 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 1 ms 3384 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 3 ms 3668 KB Output is correct
18 Correct 3 ms 3668 KB Output is correct
19 Correct 2 ms 3392 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 3 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 2 ms 3412 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 2 ms 3388 KB Output is correct
28 Correct 2 ms 3380 KB Output is correct
29 Correct 3 ms 3540 KB Output is correct
30 Correct 3 ms 3540 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3412 KB Output is correct
2 Correct 1 ms 3412 KB Output is correct
3 Correct 1 ms 3412 KB Output is correct
4 Correct 1 ms 3384 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3384 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3380 KB Output is correct
14 Correct 3 ms 3412 KB Output is correct
15 Correct 3 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 54 ms 5788 KB Output is correct
18 Correct 55 ms 5880 KB Output is correct
19 Correct 61 ms 5488 KB Output is correct
20 Correct 61 ms 5420 KB Output is correct
21 Correct 61 ms 5412 KB Output is correct
22 Correct 61 ms 5508 KB Output is correct
23 Correct 60 ms 5392 KB Output is correct
24 Correct 63 ms 5412 KB Output is correct
25 Correct 62 ms 5424 KB Output is correct
26 Correct 60 ms 5444 KB Output is correct
27 Correct 61 ms 5424 KB Output is correct
28 Correct 61 ms 5464 KB Output is correct
29 Correct 54 ms 5480 KB Output is correct
30 Correct 53 ms 5828 KB Output is correct
31 Correct 56 ms 5948 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 1 ms 3412 KB Output is correct
4 Correct 1 ms 3412 KB Output is correct
5 Correct 2 ms 3384 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 1 ms 3384 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3412 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3412 KB Output is correct
15 Correct 2 ms 3412 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 3 ms 3668 KB Output is correct
18 Correct 3 ms 3668 KB Output is correct
19 Correct 2 ms 3392 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 3 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 2 ms 3412 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 2 ms 3388 KB Output is correct
28 Correct 2 ms 3380 KB Output is correct
29 Correct 3 ms 3540 KB Output is correct
30 Correct 3 ms 3540 KB Output is correct
31 Correct 1 ms 3412 KB Output is correct
32 Correct 1 ms 3412 KB Output is correct
33 Correct 1 ms 3412 KB Output is correct
34 Correct 1 ms 3384 KB Output is correct
35 Correct 2 ms 3412 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct
37 Correct 2 ms 3412 KB Output is correct
38 Correct 2 ms 3384 KB Output is correct
39 Correct 2 ms 3412 KB Output is correct
40 Correct 2 ms 3412 KB Output is correct
41 Correct 2 ms 3412 KB Output is correct
42 Correct 2 ms 3412 KB Output is correct
43 Correct 2 ms 3380 KB Output is correct
44 Correct 3 ms 3412 KB Output is correct
45 Correct 3 ms 3412 KB Output is correct
46 Correct 2 ms 3412 KB Output is correct
47 Correct 54 ms 5788 KB Output is correct
48 Correct 55 ms 5880 KB Output is correct
49 Correct 61 ms 5488 KB Output is correct
50 Correct 61 ms 5420 KB Output is correct
51 Correct 61 ms 5412 KB Output is correct
52 Correct 61 ms 5508 KB Output is correct
53 Correct 60 ms 5392 KB Output is correct
54 Correct 63 ms 5412 KB Output is correct
55 Correct 62 ms 5424 KB Output is correct
56 Correct 60 ms 5444 KB Output is correct
57 Correct 61 ms 5424 KB Output is correct
58 Correct 61 ms 5464 KB Output is correct
59 Correct 54 ms 5480 KB Output is correct
60 Correct 53 ms 5828 KB Output is correct
61 Correct 56 ms 5948 KB Output is correct
62 Correct 64 ms 8968 KB Output is correct
63 Correct 229 ms 29976 KB Output is correct
64 Correct 233 ms 30116 KB Output is correct
65 Correct 70 ms 8348 KB Output is correct
66 Correct 71 ms 8240 KB Output is correct
67 Correct 72 ms 8616 KB Output is correct
68 Correct 72 ms 8660 KB Output is correct
69 Correct 78 ms 8536 KB Output is correct
70 Correct 76 ms 8456 KB Output is correct
71 Correct 74 ms 8516 KB Output is correct
72 Correct 74 ms 7564 KB Output is correct
73 Correct 227 ms 18788 KB Output is correct
74 Correct 216 ms 19064 KB Output is correct
75 Correct 232 ms 29624 KB Output is correct
76 Correct 234 ms 29948 KB Output is correct
77 Correct 239 ms 29928 KB Output is correct
78 Correct 253 ms 29236 KB Output is correct