oj.uz

Submission #781989

# Submission time Handle Problem Language Result Execution time Memory
781989 2023-07-13T14:35:27 Z RecursiveCo Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 193 ms 23272 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long

signed main() {
    improvePerformance;
    //getTest;

    //eachTest {
        get(n);
        getList(n, nums);
        stack<pair<int, int>> segs;
        map<int, int> seen;
        int l = 0;
        int val = nums[0];
        forto(n, i) {
            if (nums[i] != val) {
                if (seen.find(val) != seen.end() && seen[val] != 0) {
                    int len = 0;
                    while (segs.top().first != val) len += segs.top().second, seen[segs.top().first]--, segs.pop();
                    len += segs.top().second;
                    segs.pop();
                    segs.push({val, len + i - l});
                    l = i;
                    val = nums[i];
                } else {
                    segs.push({val, i - l});
                    if (seen.find(val) == seen.end()) seen[val] = 1;
                    else seen[val]++;
                    l = i;
                    val = nums[i];
                }
            }
        }
        if (seen.find(val) != seen.end() && seen[val] != 0) {
            int len = 0;
            while (segs.top().first != val) len += segs.top().second, seen[segs.top().first]--, segs.pop();
            len += segs.top().second;
            segs.pop();
            segs.push({val, len + n - l});
        } else {
            segs.push({val, n - l});
        }
        vector<int> res;
        while (!segs.empty()) {
            int el = segs.top().first;
            int cnt = segs.top().second;
            segs.pop();
            forto(cnt, i) res.push_back(el);
        }
        rev(res);
        forto(n, i) {
            out(res[i]);
            out("\n");
        }
    //}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:25:9: note: in expansion of macro 'get'
   25 |         get(n);
      |         ^~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'nums' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:26:9: note: in expansion of macro 'getList'
   26 |         getList(n, nums);
      |         ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
Main.cpp:26:9: note: in expansion of macro 'getList'
   26 |         getList(n, nums);
      |         ^~~~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:31:9: note: in expansion of macro 'forto'
   31 |         forto(n, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:64:13: note: in expansion of macro 'forto'
   64 |             forto(cnt, i) res.push_back(el);
      |             ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:67:9: note: in expansion of macro 'forto'
   67 |         forto(n, i) {
      |         ^~~~~

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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 20 ms 5220 KB Output is correct
18 Correct 20 ms 5340 KB Output is correct
19 Correct 22 ms 5324 KB Output is correct
20 Correct 22 ms 5220 KB Output is correct
21 Correct 21 ms 5324 KB Output is correct
22 Correct 21 ms 5332 KB Output is correct
23 Correct 21 ms 5344 KB Output is correct
24 Correct 22 ms 5324 KB Output is correct
25 Correct 22 ms 5312 KB Output is correct
26 Correct 22 ms 5324 KB Output is correct
27 Correct 22 ms 5324 KB Output is correct
28 Correct 22 ms 5316 KB Output is correct
29 Correct 22 ms 5364 KB Output is correct
30 Correct 20 ms 5364 KB Output is correct
31 Correct 19 ms 5344 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 20 ms 5220 KB Output is correct
48 Correct 20 ms 5340 KB Output is correct
49 Correct 22 ms 5324 KB Output is correct
50 Correct 22 ms 5220 KB Output is correct
51 Correct 21 ms 5324 KB Output is correct
52 Correct 21 ms 5332 KB Output is correct
53 Correct 21 ms 5344 KB Output is correct
54 Correct 22 ms 5324 KB Output is correct
55 Correct 22 ms 5312 KB Output is correct
56 Correct 22 ms 5324 KB Output is correct
57 Correct 22 ms 5324 KB Output is correct
58 Correct 22 ms 5316 KB Output is correct
59 Correct 22 ms 5364 KB Output is correct
60 Correct 20 ms 5364 KB Output is correct
61 Correct 19 ms 5344 KB Output is correct
62 Correct 36 ms 7512 KB Output is correct
63 Correct 184 ms 20384 KB Output is correct
64 Correct 167 ms 20604 KB Output is correct
65 Correct 31 ms 7240 KB Output is correct
66 Correct 30 ms 7108 KB Output is correct
67 Correct 35 ms 7548 KB Output is correct
68 Correct 31 ms 7552 KB Output is correct
69 Correct 34 ms 7508 KB Output is correct
70 Correct 33 ms 7528 KB Output is correct
71 Correct 32 ms 7456 KB Output is correct
72 Correct 38 ms 6696 KB Output is correct
73 Correct 131 ms 15052 KB Output is correct
74 Correct 115 ms 15436 KB Output is correct
75 Correct 141 ms 22956 KB Output is correct
76 Correct 193 ms 23224 KB Output is correct
77 Correct 148 ms 23272 KB Output is correct
78 Correct 143 ms 22552 KB Output is correct