Submission #846994

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
846994	2023-09-08T22:16:00 Z	StefanSebez	Stone Arranging 2 (JOI23_ho_t1)	C++14	100 / 100	155 ms	15304 KB

Main

#include <bits/stdc++.h>
using namespace std;
map<int,int>mapa;
int main()
{
    int n;
    scanf("%i",&n);
    int a[n+1];
    for(int i=1;i<=n;i++)
	{
		scanf("%i",&a[i]);
	}
	vector<int>b;
	for(int i=1;i<=n;i++)
	{
		if(mapa[a[i]]>0)
		{
			while(a[b.back()]!=a[i])
			{
				mapa[a[b.back()]]--;
				b.pop_back();
			}
		}
		mapa[a[i]]++;
		b.push_back(i);
	}
	/*for(auto i:b)cout<<i<<" ";
	cout<<endl;*/
	for(int i=0;i<b.size();i++)
	{
		printf("%i ",a[b[i]]);
		if(i==b.size()-1) break;
		for(int j=b[i]+1;j<b[i+1];j++)
		{
			printf("%i ",a[b[i]]);
		}
	}
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(int i=0;i<b.size();i++)
      |              ~^~~~~~~~~
Main.cpp:32:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   if(i==b.size()-1) break;
      |      ~^~~~~~~~~~~~
Main.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |     scanf("%i",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   scanf("%i",&a[i]);
      |   ~~~~~^~~~~~~~~~~~

Subtask #1
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 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	432 KB	Output is correct
6	Correct	1 ms	388 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	476 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	1 ms	348 KB	Output is correct
17	Correct	1 ms	352 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	352 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	456 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	344 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	1 ms	352 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	1 ms	500 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	352 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	352 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	552 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	28 ms	2844 KB	Output is correct
18	Correct	28 ms	2820 KB	Output is correct
19	Correct	31 ms	2480 KB	Output is correct
20	Correct	30 ms	2508 KB	Output is correct
21	Correct	30 ms	2508 KB	Output is correct
22	Correct	29 ms	2516 KB	Output is correct
23	Correct	30 ms	2508 KB	Output is correct
24	Correct	29 ms	2760 KB	Output is correct
25	Correct	30 ms	2516 KB	Output is correct
26	Correct	29 ms	2460 KB	Output is correct
27	Correct	30 ms	2464 KB	Output is correct
28	Correct	37 ms	2336 KB	Output is correct
29	Correct	27 ms	2516 KB	Output is correct
30	Correct	28 ms	2868 KB	Output is correct
31	Correct	28 ms	2772 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	1 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	432 KB	Output is correct
6	Correct	1 ms	388 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	476 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	1 ms	348 KB	Output is correct
17	Correct	1 ms	352 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	352 KB	Output is correct
22	Correct	1 ms	452 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	456 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	352 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	1 ms	500 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	352 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	1 ms	352 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	552 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	28 ms	2844 KB	Output is correct
48	Correct	28 ms	2820 KB	Output is correct
49	Correct	31 ms	2480 KB	Output is correct
50	Correct	30 ms	2508 KB	Output is correct
51	Correct	30 ms	2508 KB	Output is correct
52	Correct	29 ms	2516 KB	Output is correct
53	Correct	30 ms	2508 KB	Output is correct
54	Correct	29 ms	2760 KB	Output is correct
55	Correct	30 ms	2516 KB	Output is correct
56	Correct	29 ms	2460 KB	Output is correct
57	Correct	30 ms	2464 KB	Output is correct
58	Correct	37 ms	2336 KB	Output is correct
59	Correct	27 ms	2516 KB	Output is correct
60	Correct	28 ms	2868 KB	Output is correct
61	Correct	28 ms	2772 KB	Output is correct
62	Correct	35 ms	6044 KB	Output is correct
63	Correct	142 ms	14792 KB	Output is correct
64	Correct	146 ms	14756 KB	Output is correct
65	Correct	37 ms	5340 KB	Output is correct
66	Correct	37 ms	5068 KB	Output is correct
67	Correct	36 ms	5456 KB	Output is correct
68	Correct	39 ms	5648 KB	Output is correct
69	Correct	43 ms	5400 KB	Output is correct
70	Correct	37 ms	5324 KB	Output is correct
71	Correct	38 ms	5408 KB	Output is correct
72	Correct	43 ms	5272 KB	Output is correct
73	Correct	112 ms	10016 KB	Output is correct
74	Correct	127 ms	10188 KB	Output is correct
75	Correct	124 ms	15304 KB	Output is correct
76	Correct	155 ms	15076 KB	Output is correct
77	Correct	114 ms	15288 KB	Output is correct
78	Correct	112 ms	15300 KB	Output is correct

Submission #846994

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