Submission #957682

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
957682	2024-04-04T07:55:29 Z	VinhLuu	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	154 ms	54468 KB

Main

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int oo = 2e18;

int n, a[N], b[N], t, p[N];

vector<int> vr[N];

int c[N];
void sub1(){
    for(int i = 1; i <= n; i ++){
        c[i] = a[i];
        for(int j = i - 1; j >= 1; j --){
            if(c[j] == c[i]){
                for(int k = j; k <= i; k ++) c[k] = a[i];
                break;
            }
        }
    }
    for(int i = 1; i <= n; i ++) cout << c[i] << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n;
    set<int> s;
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
        s.insert(a[i]);
    }
    for(auto j : s) p[++t] = j;
    for(int i = 1; i <= n; i ++) a[i] = lower_bound(p + 1, p + t + 1, a[i]) - p;
    vector<int> cur;
    for(int i = 1; i <= n; i ++){
        if(!vr[a[i]].empty()){
            int u = vr[a[i]].back();
            int v = i;
            while(!cur.empty() && cur.back() > u){
                int tmp = cur.back();
                vr[a[tmp]].pop_back();
                cur.pop_back();
            }
        }
        vr[a[i]].pb(i);
        cur.pb(i);
    }
    for(int i = 1; i <= t; i ++){
        if(!vr[i].empty()){
            b[vr[i][0]] = p[i];
            for(int j = vr[i][0]; j <= vr[i].back(); j ++) b[j] = p[i];
        }
    }
    for(int i = 1; i <= n; i ++) cout << b[i] << "\n";
}

Compilation message

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

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	29016 KB	Output is correct
2	Correct	6 ms	29020 KB	Output is correct
3	Correct	7 ms	29120 KB	Output is correct
4	Correct	6 ms	29020 KB	Output is correct
5	Correct	7 ms	29132 KB	Output is correct
6	Correct	7 ms	29436 KB	Output is correct
7	Correct	6 ms	29020 KB	Output is correct
8	Correct	6 ms	29192 KB	Output is correct
9	Correct	7 ms	29020 KB	Output is correct
10	Correct	7 ms	29272 KB	Output is correct
11	Correct	7 ms	29272 KB	Output is correct
12	Correct	7 ms	29020 KB	Output is correct
13	Correct	9 ms	29176 KB	Output is correct
14	Correct	11 ms	29016 KB	Output is correct
15	Correct	6 ms	29016 KB	Output is correct
16	Correct	8 ms	29020 KB	Output is correct
17	Correct	7 ms	29276 KB	Output is correct
18	Correct	8 ms	29276 KB	Output is correct
19	Correct	7 ms	29020 KB	Output is correct
20	Correct	7 ms	29136 KB	Output is correct
21	Correct	7 ms	29020 KB	Output is correct
22	Correct	6 ms	29020 KB	Output is correct
23	Correct	6 ms	29020 KB	Output is correct
24	Correct	7 ms	29020 KB	Output is correct
25	Correct	6 ms	29020 KB	Output is correct
26	Correct	7 ms	29020 KB	Output is correct
27	Correct	7 ms	29020 KB	Output is correct
28	Correct	8 ms	29020 KB	Output is correct
29	Correct	7 ms	29276 KB	Output is correct
30	Correct	7 ms	29276 KB	Output is correct

Subtask #2
35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	29020 KB	Output is correct
2	Correct	6 ms	29020 KB	Output is correct
3	Correct	6 ms	29020 KB	Output is correct
4	Correct	6 ms	29020 KB	Output is correct
5	Correct	6 ms	29020 KB	Output is correct
6	Correct	7 ms	29020 KB	Output is correct
7	Correct	7 ms	29020 KB	Output is correct
8	Correct	7 ms	29020 KB	Output is correct
9	Correct	7 ms	29276 KB	Output is correct
10	Correct	8 ms	29020 KB	Output is correct
11	Correct	7 ms	29244 KB	Output is correct
12	Correct	8 ms	29020 KB	Output is correct
13	Correct	7 ms	29016 KB	Output is correct
14	Correct	7 ms	29016 KB	Output is correct
15	Correct	6 ms	29016 KB	Output is correct
16	Correct	6 ms	29020 KB	Output is correct
17	Correct	28 ms	36912 KB	Output is correct
18	Correct	39 ms	36952 KB	Output is correct
19	Correct	31 ms	35260 KB	Output is correct
20	Correct	31 ms	35288 KB	Output is correct
21	Correct	32 ms	35400 KB	Output is correct
22	Correct	29 ms	35272 KB	Output is correct
23	Correct	32 ms	35344 KB	Output is correct
24	Correct	30 ms	35288 KB	Output is correct
25	Correct	30 ms	35268 KB	Output is correct
26	Correct	34 ms	35364 KB	Output is correct
27	Correct	30 ms	35392 KB	Output is correct
28	Correct	30 ms	35780 KB	Output is correct
29	Correct	27 ms	35440 KB	Output is correct
30	Correct	30 ms	37496 KB	Output is correct
31	Correct	29 ms	37300 KB	Output is correct

Subtask #3
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	29016 KB	Output is correct
2	Correct	6 ms	29020 KB	Output is correct
3	Correct	7 ms	29120 KB	Output is correct
4	Correct	6 ms	29020 KB	Output is correct
5	Correct	7 ms	29132 KB	Output is correct
6	Correct	7 ms	29436 KB	Output is correct
7	Correct	6 ms	29020 KB	Output is correct
8	Correct	6 ms	29192 KB	Output is correct
9	Correct	7 ms	29020 KB	Output is correct
10	Correct	7 ms	29272 KB	Output is correct
11	Correct	7 ms	29272 KB	Output is correct
12	Correct	7 ms	29020 KB	Output is correct
13	Correct	9 ms	29176 KB	Output is correct
14	Correct	11 ms	29016 KB	Output is correct
15	Correct	6 ms	29016 KB	Output is correct
16	Correct	8 ms	29020 KB	Output is correct
17	Correct	7 ms	29276 KB	Output is correct
18	Correct	8 ms	29276 KB	Output is correct
19	Correct	7 ms	29020 KB	Output is correct
20	Correct	7 ms	29136 KB	Output is correct
21	Correct	7 ms	29020 KB	Output is correct
22	Correct	6 ms	29020 KB	Output is correct
23	Correct	6 ms	29020 KB	Output is correct
24	Correct	7 ms	29020 KB	Output is correct
25	Correct	6 ms	29020 KB	Output is correct
26	Correct	7 ms	29020 KB	Output is correct
27	Correct	7 ms	29020 KB	Output is correct
28	Correct	8 ms	29020 KB	Output is correct
29	Correct	7 ms	29276 KB	Output is correct
30	Correct	7 ms	29276 KB	Output is correct
31	Correct	6 ms	29020 KB	Output is correct
32	Correct	6 ms	29020 KB	Output is correct
33	Correct	6 ms	29020 KB	Output is correct
34	Correct	6 ms	29020 KB	Output is correct
35	Correct	6 ms	29020 KB	Output is correct
36	Correct	7 ms	29020 KB	Output is correct
37	Correct	7 ms	29020 KB	Output is correct
38	Correct	7 ms	29020 KB	Output is correct
39	Correct	7 ms	29276 KB	Output is correct
40	Correct	8 ms	29020 KB	Output is correct
41	Correct	7 ms	29244 KB	Output is correct
42	Correct	8 ms	29020 KB	Output is correct
43	Correct	7 ms	29016 KB	Output is correct
44	Correct	7 ms	29016 KB	Output is correct
45	Correct	6 ms	29016 KB	Output is correct
46	Correct	6 ms	29020 KB	Output is correct
47	Correct	28 ms	36912 KB	Output is correct
48	Correct	39 ms	36952 KB	Output is correct
49	Correct	31 ms	35260 KB	Output is correct
50	Correct	31 ms	35288 KB	Output is correct
51	Correct	32 ms	35400 KB	Output is correct
52	Correct	29 ms	35272 KB	Output is correct
53	Correct	32 ms	35344 KB	Output is correct
54	Correct	30 ms	35288 KB	Output is correct
55	Correct	30 ms	35268 KB	Output is correct
56	Correct	34 ms	35364 KB	Output is correct
57	Correct	30 ms	35392 KB	Output is correct
58	Correct	30 ms	35780 KB	Output is correct
59	Correct	27 ms	35440 KB	Output is correct
60	Correct	30 ms	37496 KB	Output is correct
61	Correct	29 ms	37300 KB	Output is correct
62	Correct	38 ms	40404 KB	Output is correct
63	Correct	142 ms	53300 KB	Output is correct
64	Correct	144 ms	53160 KB	Output is correct
65	Correct	42 ms	38592 KB	Output is correct
66	Correct	40 ms	38692 KB	Output is correct
67	Correct	40 ms	38964 KB	Output is correct
68	Correct	42 ms	38836 KB	Output is correct
69	Correct	42 ms	38280 KB	Output is correct
70	Correct	43 ms	38416 KB	Output is correct
71	Correct	41 ms	38332 KB	Output is correct
72	Correct	41 ms	38372 KB	Output is correct
73	Correct	108 ms	45656 KB	Output is correct
74	Correct	109 ms	45764 KB	Output is correct
75	Correct	145 ms	54464 KB	Output is correct
76	Correct	146 ms	54468 KB	Output is correct
77	Correct	154 ms	54308 KB	Output is correct
78	Correct	144 ms	54212 KB	Output is correct

Submission #957682

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