Submission #1054946

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1054946	2024-08-12T13:15:48 Z	CodeLakVN	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	128 ms	12624 KB

Main

#include <bits/stdc++.h>

#define no "NO"
#define yes "YES"
#define F first
#define S second
#define vec vector
#define task "main"
#define ll long long
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maximize(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool minimize(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;

int a[N];
map<int, int> pos;

void main_code() {
    int n;
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i];
        pos[a[i]] = i;
    }
    FOR(i, 1, n) {
        FOR(j, i + 1, pos[a[i]]) a[j] = a[i];
        i = pos[a[i]];
    }
    FOR(i, 1, n) cout << a[i] << " ";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0;
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); cout << "\n"; }
}

/* Lak lu theo dieu nhac */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	564 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	480 KB	Output is correct
28	Correct	0 ms	472 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct

Subtask #2
35.0 / 35.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	348 KB	Output is correct
6	Correct	0 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	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	18 ms	1628 KB	Output is correct
18	Correct	13 ms	1628 KB	Output is correct
19	Correct	14 ms	1628 KB	Output is correct
20	Correct	14 ms	1628 KB	Output is correct
21	Correct	13 ms	1628 KB	Output is correct
22	Correct	15 ms	1628 KB	Output is correct
23	Correct	13 ms	1628 KB	Output is correct
24	Correct	13 ms	1624 KB	Output is correct
25	Correct	13 ms	1628 KB	Output is correct
26	Correct	13 ms	1628 KB	Output is correct
27	Correct	15 ms	1624 KB	Output is correct
28	Correct	14 ms	1628 KB	Output is correct
29	Correct	12 ms	1628 KB	Output is correct
30	Correct	12 ms	1628 KB	Output is correct
31	Correct	13 ms	1628 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	564 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	480 KB	Output is correct
28	Correct	0 ms	472 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	1 ms	344 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	18 ms	1628 KB	Output is correct
48	Correct	13 ms	1628 KB	Output is correct
49	Correct	14 ms	1628 KB	Output is correct
50	Correct	14 ms	1628 KB	Output is correct
51	Correct	13 ms	1628 KB	Output is correct
52	Correct	15 ms	1628 KB	Output is correct
53	Correct	13 ms	1628 KB	Output is correct
54	Correct	13 ms	1624 KB	Output is correct
55	Correct	13 ms	1628 KB	Output is correct
56	Correct	13 ms	1628 KB	Output is correct
57	Correct	15 ms	1624 KB	Output is correct
58	Correct	14 ms	1628 KB	Output is correct
59	Correct	12 ms	1628 KB	Output is correct
60	Correct	12 ms	1628 KB	Output is correct
61	Correct	13 ms	1628 KB	Output is correct
62	Correct	20 ms	3164 KB	Output is correct
63	Correct	86 ms	12544 KB	Output is correct
64	Correct	79 ms	12372 KB	Output is correct
65	Correct	22 ms	2904 KB	Output is correct
66	Correct	20 ms	2908 KB	Output is correct
67	Correct	23 ms	3156 KB	Output is correct
68	Correct	23 ms	3164 KB	Output is correct
69	Correct	21 ms	3160 KB	Output is correct
70	Correct	21 ms	3164 KB	Output is correct
71	Correct	21 ms	3160 KB	Output is correct
72	Correct	21 ms	3160 KB	Output is correct
73	Correct	81 ms	7776 KB	Output is correct
74	Correct	78 ms	7760 KB	Output is correct
75	Correct	117 ms	12364 KB	Output is correct
76	Correct	72 ms	12624 KB	Output is correct
77	Correct	128 ms	12368 KB	Output is correct
78	Correct	122 ms	12512 KB	Output is correct

Submission #1054946

Compilation message

Subtask #1 25.0 / 25.0

Subtask #2 35.0 / 35.0

Subtask #3 40.0 / 40.0

Subtask #1
25.0 / 25.0

Subtask #2
35.0 / 35.0

Subtask #3
40.0 / 40.0