답안 #601789

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601789	2022-07-22T10:02:27 Z	Minindu2006	Arranging Shoes (IOI19_shoes)	C++14	85 / 100	1000 ms	12436 KB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
ll count_swaps(vector<int> s)
{
    ll n = s.size() / 2;
    if (n == 1)
        return s[0] > 0;
	set<int> st;
    int isb4 = 1;
    for (int i = 0; i < n; i++)
    {
        if (s[i] != -s[i + n] || s[i] > 0)
        {
            isb4 = 0;
            break;
        }
    }
    if (isb4)
        return n * (n - 1) / 2;
	for(int i=0;i<2*n;i++)
		st.insert(s[i]);
	

	if (st.size() == 2)
	{
		
		vector<int> l;
		for (int i = 0; i < 2 * n; i++)
			if (s[i] < 0)
				l.push_back(i);
		ll ans = 0, j = 0;
		for (int i = 0; i < 2 * n; i += 2)
			ans += abs(i - l[j]), j++;
		return ans;
	}
    ll pos = 0, ans = 0;
    while (pos < 2 * n)
    {
        if (s[pos] > 0)
        {
            int i;
            for (i = pos + 1; i < 2 * n; i++)
                if (s[i] == -s[pos])
                    break;
            int num = s[i];
            s.erase(s.begin() + i);
            s.insert(s.begin() + pos, num);
            ans += (i - pos);
        }
        else if (s[pos] + s[pos + 1] != 0)
        {
            int i;
            for (i = pos + 2; i < 2 * n; i++)
                if (s[i] == -s[pos])
                    break;
            int num = s[i];
            s.erase(s.begin() + i);
            s.insert(s.begin() + pos + 1, num);
            ans += (i - pos - 1);
        }
        // cout << s[pos] << " " << s[pos + 1] << '\n';
        pos += 2;
        
    }
    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:9:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    9 |     if (n == 1)
      |     ^~
shoes.cpp:11:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   11 |  set<int> st;
      |  ^~~
shoes.cpp:21:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   21 |     if (isb4)
      |     ^~
shoes.cpp:23:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   23 |  for(int i=0;i<2*n;i++)
      |  ^~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	300 KB	Output is correct
17	Correct	0 ms	300 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	296 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	296 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	3 ms	468 KB	Output is correct
21	Correct	2 ms	468 KB	Output is correct
22	Correct	26 ms	2492 KB	Output is correct
23	Correct	24 ms	2488 KB	Output is correct
24	Correct	24 ms	2492 KB	Output is correct
25	Correct	21 ms	2496 KB	Output is correct
26	Correct	24 ms	2476 KB	Output is correct
27	Correct	23 ms	2496 KB	Output is correct
28	Correct	21 ms	2500 KB	Output is correct
29	Correct	21 ms	2512 KB	Output is correct
30	Correct	21 ms	2492 KB	Output is correct
31	Correct	25 ms	2488 KB	Output is correct
32	Correct	19 ms	1748 KB	Output is correct
33	Correct	21 ms	2500 KB	Output is correct
34	Correct	21 ms	2488 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	19 ms	1856 KB	Output is correct
38	Correct	21 ms	1876 KB	Output is correct
39	Correct	19 ms	1864 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	20 ms	1856 KB	Output is correct
6	Correct	20 ms	1852 KB	Output is correct
7	Correct	19 ms	1864 KB	Output is correct
8	Correct	21 ms	1780 KB	Output is correct
9	Correct	19 ms	1860 KB	Output is correct
10	Correct	19 ms	1876 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	300 KB	Output is correct
17	Correct	0 ms	300 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	296 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	296 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	1 ms	304 KB	Output is correct
40	Correct	1 ms	300 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	300 KB	Output is correct
46	Correct	2 ms	312 KB	Output is correct
47	Correct	2 ms	308 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	1 ms	312 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	2 ms	348 KB	Output is correct

Subtask #6
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	296 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	300 KB	Output is correct
17	Correct	0 ms	300 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	296 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	296 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	304 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	296 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	1 ms	212 KB	Output is correct
53	Correct	1 ms	212 KB	Output is correct
54	Correct	3 ms	468 KB	Output is correct
55	Correct	2 ms	468 KB	Output is correct
56	Correct	26 ms	2492 KB	Output is correct
57	Correct	24 ms	2488 KB	Output is correct
58	Correct	24 ms	2492 KB	Output is correct
59	Correct	21 ms	2496 KB	Output is correct
60	Correct	24 ms	2476 KB	Output is correct
61	Correct	23 ms	2496 KB	Output is correct
62	Correct	21 ms	2500 KB	Output is correct
63	Correct	21 ms	2512 KB	Output is correct
64	Correct	21 ms	2492 KB	Output is correct
65	Correct	25 ms	2488 KB	Output is correct
66	Correct	19 ms	1748 KB	Output is correct
67	Correct	21 ms	2500 KB	Output is correct
68	Correct	21 ms	2488 KB	Output is correct
69	Correct	0 ms	212 KB	Output is correct
70	Correct	0 ms	212 KB	Output is correct
71	Correct	19 ms	1856 KB	Output is correct
72	Correct	21 ms	1876 KB	Output is correct
73	Correct	19 ms	1864 KB	Output is correct
74	Correct	0 ms	212 KB	Output is correct
75	Correct	0 ms	212 KB	Output is correct
76	Correct	1 ms	212 KB	Output is correct
77	Correct	0 ms	212 KB	Output is correct
78	Correct	20 ms	1856 KB	Output is correct
79	Correct	20 ms	1852 KB	Output is correct
80	Correct	19 ms	1864 KB	Output is correct
81	Correct	21 ms	1780 KB	Output is correct
82	Correct	19 ms	1860 KB	Output is correct
83	Correct	19 ms	1876 KB	Output is correct
84	Correct	0 ms	212 KB	Output is correct
85	Correct	1 ms	212 KB	Output is correct
86	Correct	1 ms	304 KB	Output is correct
87	Correct	1 ms	300 KB	Output is correct
88	Correct	1 ms	340 KB	Output is correct
89	Correct	1 ms	340 KB	Output is correct
90	Correct	1 ms	340 KB	Output is correct
91	Correct	1 ms	340 KB	Output is correct
92	Correct	1 ms	300 KB	Output is correct
93	Correct	2 ms	312 KB	Output is correct
94	Correct	2 ms	308 KB	Output is correct
95	Correct	1 ms	340 KB	Output is correct
96	Correct	2 ms	340 KB	Output is correct
97	Correct	1 ms	312 KB	Output is correct
98	Correct	1 ms	212 KB	Output is correct
99	Correct	2 ms	348 KB	Output is correct
100	Correct	1 ms	340 KB	Output is correct
101	Correct	47 ms	1380 KB	Output is correct
102	Correct	33 ms	704 KB	Output is correct
103	Execution timed out	1085 ms	12436 KB	Time limit exceeded
104	Halted	0 ms	0 KB	-

답안 #601789

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 15.0