oj.uz

Submission #961319

# Submission time Handle Problem Language Result Execution time Memory
961319 2024-04-11T20:02:38 Z mannshah1211 Stone Arranging 2 (JOI23_ho_t1) C++17
60 / 100
 2000 ms 18260 KB 
/**
 *  author: hashman
 *  created: 
**/

#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
   if (!first) {
    res += ", ";
   }
   first = false;
   res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() {
  cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<int, pair<int, int>> who;
  for (int i = 0; i < n; i++) {
    who[a[i]] = make_pair(-1, -1);
  }
  for (int i = 0; i < n; i++) {
    if (who[a[i]] == make_pair(-1, -1)) {
      who[a[i]] = make_pair(i, i);
    } else {
      int old = who[a[i]].second;
      who[a[i]].second = i;
      for (int j = old + 1; j <= who[a[i]].second; j++) {
        if (a[j] != a[i]) {
          who[a[j]] = make_pair(-1, -1);
        }
        a[j] = a[i];
      }
    }
  }
  vector<int> ans(n);
  for (auto [_, p] : who) {
    if (p != make_pair(-1, -1)) {
      for (int i = p.first; i <= p.second; i++) {
        ans[i] = _;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << '\n';
  }
}

Subtask #1
25.0 / 25.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 0 ms 344 KB Output is correct
6 Correct 1 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 344 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 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 600 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 344 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 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 23 ms 344 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 0 ms 600 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 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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 348 KB Output is correct
12 Correct 1 ms 344 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 19 ms 2272 KB Output is correct
18 Correct 20 ms 2816 KB Output is correct
19 Correct 23 ms 2644 KB Output is correct
20 Correct 22 ms 2652 KB Output is correct
21 Correct 22 ms 2580 KB Output is correct
22 Correct 24 ms 2648 KB Output is correct
23 Correct 22 ms 2644 KB Output is correct
24 Correct 23 ms 2640 KB Output is correct
25 Correct 24 ms 2656 KB Output is correct
26 Correct 22 ms 2716 KB Output is correct
27 Correct 23 ms 2668 KB Output is correct
28 Correct 23 ms 2652 KB Output is correct
29 Correct 21 ms 2652 KB Output is correct
30 Correct 21 ms 2640 KB Output is correct
31 Correct 19 ms 2652 KB Output is correct

Subtask #3
0 / 40.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 0 ms 344 KB Output is correct
6 Correct 1 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 344 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 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 600 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 344 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 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 23 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 360 KB Output is correct
33 Correct 0 ms 600 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 600 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 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 348 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 19 ms 2272 KB Output is correct
48 Correct 20 ms 2816 KB Output is correct
49 Correct 23 ms 2644 KB Output is correct
50 Correct 22 ms 2652 KB Output is correct
51 Correct 22 ms 2580 KB Output is correct
52 Correct 24 ms 2648 KB Output is correct
53 Correct 22 ms 2644 KB Output is correct
54 Correct 23 ms 2640 KB Output is correct
55 Correct 24 ms 2656 KB Output is correct
56 Correct 22 ms 2716 KB Output is correct
57 Correct 23 ms 2668 KB Output is correct
58 Correct 23 ms 2652 KB Output is correct
59 Correct 21 ms 2652 KB Output is correct
60 Correct 21 ms 2640 KB Output is correct
61 Correct 19 ms 2652 KB Output is correct
62 Correct 29 ms 5844 KB Output is correct
63 Correct 276 ms 18256 KB Output is correct
64 Correct 229 ms 18260 KB Output is correct
65 Correct 31 ms 5448 KB Output is correct
66 Correct 36 ms 5460 KB Output is correct
67 Correct 34 ms 5980 KB Output is correct
68 Correct 36 ms 5760 KB Output is correct
69 Correct 34 ms 5764 KB Output is correct
70 Correct 35 ms 5952 KB Output is correct
71 Correct 34 ms 5848 KB Output is correct
72 Correct 35 ms 5916 KB Output is correct
73 Correct 153 ms 11988 KB Output is correct
74 Execution timed out 2013 ms 9368 KB Time limit exceeded
75 Halted 0 ms 0 KB -