Submission #774633

# Submission time Handle Problem Language Result Execution time Memory
774633 2023-07-06T00:49:04 Z Antonn_114 Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
132 ms 39812 KB
#include <bits/stdc++.h>
using namespace std;

// Write down the limits of the problem here

inline void compress(vector<int> &a, unordered_map<int, int> &key){
    unordered_map<int, int> b;
    int n = a.size();
    for (int i = 0, t = 0; i < n; i++)
        if (b.find(a[i]) == b.end())
            key[t] = a[i], b[a[i]] = t++;
    for (int i = 0; i < n; i++)
        a[i] = b[a[i]];
}

int main() {
	// Try to avoid cin, cout :)

	int tc = 1; // scanf("%d", &tc);
	while(tc--) {
		/// Your solution here
	    int n;
        scanf("%d", &n);
        vector<int> a(n);
        vector<set<int>> b(n);
        for (auto &i : a) scanf("%d", &i);
        unordered_map<int, int> uncompress;
        compress(a, uncompress);
        for (int i = 0; i < n; i++) b[a[i]].insert(i);
        vector<int> res(n + 1);
        int ptr = 0;
        while (ptr < n){
            res[ptr] += a[ptr];
            res[(*b[a[ptr]].rbegin()) + 1] -= a[ptr];
            ptr = (*b[a[ptr]].rbegin()) + 1; 
        }
        for (int i = 1;i < n; i++){
            res[i] += res[i - 1];
        }
        for (int i = 0; i < n; i++){
            printf("%d\n", uncompress[res[i]]);
        }
		
	}
	return 0;
}

/*
 * Ermm don't underestimate Div2A, pls...
 * 
 * IMPORTANT:: If there isn't a clear-cut approach for your program, DO NOT CODE YET!
 * 
 * Analyze the time complexity and space complexity even if it *seems* efficient
 *
 * Write down some notes for more complicated problems
 * 
 * Also, please, CP isn't supposed to be complicated
 * 
**/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
Main.cpp:26:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         for (auto &i : a) scanf("%d", &i);
      |                           ~~~~~^~~~~~~~~~
# 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 468 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 212 KB Output is correct
10 Correct 1 ms 468 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 428 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 568 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 432 KB Output is correct
20 Correct 2 ms 416 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 2 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 596 KB Output is correct
30 Correct 1 ms 564 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 1 ms 256 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 424 KB Output is correct
10 Correct 1 ms 468 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 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 62 ms 21300 KB Output is correct
18 Correct 62 ms 21312 KB Output is correct
19 Correct 57 ms 21420 KB Output is correct
20 Correct 57 ms 21312 KB Output is correct
21 Correct 56 ms 21424 KB Output is correct
22 Correct 58 ms 21348 KB Output is correct
23 Correct 56 ms 21348 KB Output is correct
24 Correct 65 ms 21356 KB Output is correct
25 Correct 65 ms 21424 KB Output is correct
26 Correct 65 ms 21344 KB Output is correct
27 Correct 71 ms 21344 KB Output is correct
28 Correct 56 ms 21408 KB Output is correct
29 Correct 64 ms 21324 KB Output is correct
30 Correct 66 ms 21368 KB Output is correct
31 Correct 63 ms 21344 KB Output is correct
# 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 468 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 212 KB Output is correct
10 Correct 1 ms 468 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 428 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 568 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 432 KB Output is correct
20 Correct 2 ms 416 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 2 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 596 KB Output is correct
30 Correct 1 ms 564 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 432 KB Output is correct
36 Correct 1 ms 256 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 424 KB Output is correct
40 Correct 1 ms 468 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 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 62 ms 21300 KB Output is correct
48 Correct 62 ms 21312 KB Output is correct
49 Correct 57 ms 21420 KB Output is correct
50 Correct 57 ms 21312 KB Output is correct
51 Correct 56 ms 21424 KB Output is correct
52 Correct 58 ms 21348 KB Output is correct
53 Correct 56 ms 21348 KB Output is correct
54 Correct 65 ms 21356 KB Output is correct
55 Correct 65 ms 21424 KB Output is correct
56 Correct 65 ms 21344 KB Output is correct
57 Correct 71 ms 21344 KB Output is correct
58 Correct 56 ms 21408 KB Output is correct
59 Correct 64 ms 21324 KB Output is correct
60 Correct 66 ms 21368 KB Output is correct
61 Correct 63 ms 21344 KB Output is correct
62 Correct 78 ms 24532 KB Output is correct
63 Correct 132 ms 39756 KB Output is correct
64 Correct 109 ms 39780 KB Output is correct
65 Correct 71 ms 24216 KB Output is correct
66 Correct 67 ms 24156 KB Output is correct
67 Correct 67 ms 24592 KB Output is correct
68 Correct 70 ms 24584 KB Output is correct
69 Correct 67 ms 24548 KB Output is correct
70 Correct 75 ms 24580 KB Output is correct
71 Correct 73 ms 24580 KB Output is correct
72 Correct 68 ms 23532 KB Output is correct
73 Correct 75 ms 31904 KB Output is correct
74 Correct 76 ms 32132 KB Output is correct
75 Correct 117 ms 39428 KB Output is correct
76 Correct 104 ms 39804 KB Output is correct
77 Correct 118 ms 39812 KB Output is correct
78 Correct 107 ms 39052 KB Output is correct