Submission #205652

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
205652	2020-02-29T11:27:52 Z	Kastanda	Rope (JOI17_rope)	C++11	45 / 100	2500 ms	16504 KB

rope

// In The Name Of The Queen
#include<bits/stdc++.h>
using namespace std;
const int N = 1000006;
int n, m, Mxc, A[N], C[N], dp[N][2][2];
inline void smin(int &a, int b) {a = min(a, b);}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i ++)
        scanf("%d", &A[i]), C[A[i]] ++;
    for (int i = 1; i <= m; i ++)
        if (C[i] > C[Mxc])
            Mxc = i;
    for (int c = 1; c <= m; c ++)
    {
        int Mn = n - C[c];
        for (int d = 1; d <= m; d ++)
            if (d != c)
            {
                int cls[2] = {c, d}, cnt[2] = {0, 0};
                memset(dp, 63, sizeof(dp));
                for (int i = 1; i <= n; i ++)
                {
                    cnt[0] += (A[i] != cls[0]);
                    cnt[1] += (A[i] != cls[1]);
                    dp[i][0][0] = dp[i][0][1] = cnt[0];
                    dp[i][1][0] = dp[i][1][1] = cnt[1];
                }
                for (int i = 1; i < n; i ++)
                    for (int w = 0; w <= 1; w ++)
                        for (int p = 0; p <= 1; p ++)
                        {
                            smin(dp[i + 1][w][!p], dp[i][w][p] + (A[i + 1] != cls[w]));
                            if (!p) smin(dp[i + 1][!w][1], dp[i][w][p] + (A[i + 1] != cls[!w]));
                        }
                for (int w = 0; w <= 1; w ++)
                    for (int p = 0; p <= 1; p ++)
                        Mn = min(Mn, dp[n][w][p]);
            }
        printf("%d\n", Mn);
    }
    return 0;
}

Compilation message

rope.cpp: In function 'int main()':
rope.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
rope.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]), C[A[i]] ++;
         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	15992 KB	Output is correct
2	Correct	220 ms	16032 KB	Output is correct
3	Correct	222 ms	16120 KB	Output is correct
4	Correct	43 ms	15992 KB	Output is correct
5	Correct	26 ms	15992 KB	Output is correct
6	Correct	236 ms	15992 KB	Output is correct
7	Correct	193 ms	16120 KB	Output is correct
8	Correct	120 ms	15992 KB	Output is correct
9	Correct	89 ms	15996 KB	Output is correct
10	Correct	64 ms	15992 KB	Output is correct
11	Correct	241 ms	16096 KB	Output is correct
12	Correct	222 ms	16032 KB	Output is correct
13	Correct	148 ms	16064 KB	Output is correct
14	Correct	40 ms	16032 KB	Output is correct
15	Correct	27 ms	15992 KB	Output is correct
16	Correct	28 ms	15992 KB	Output is correct
17	Correct	198 ms	15992 KB	Output is correct
18	Correct	121 ms	15992 KB	Output is correct
19	Correct	89 ms	15992 KB	Output is correct
20	Correct	64 ms	15992 KB	Output is correct
21	Correct	17 ms	16040 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	25 ms	16120 KB	Output is correct
24	Correct	22 ms	15992 KB	Output is correct
25	Correct	18 ms	15992 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	15992 KB	Output is correct
2	Correct	220 ms	16032 KB	Output is correct
3	Correct	222 ms	16120 KB	Output is correct
4	Correct	43 ms	15992 KB	Output is correct
5	Correct	26 ms	15992 KB	Output is correct
6	Correct	236 ms	15992 KB	Output is correct
7	Correct	193 ms	16120 KB	Output is correct
8	Correct	120 ms	15992 KB	Output is correct
9	Correct	89 ms	15996 KB	Output is correct
10	Correct	64 ms	15992 KB	Output is correct
11	Correct	241 ms	16096 KB	Output is correct
12	Correct	222 ms	16032 KB	Output is correct
13	Correct	148 ms	16064 KB	Output is correct
14	Correct	40 ms	16032 KB	Output is correct
15	Correct	27 ms	15992 KB	Output is correct
16	Correct	28 ms	15992 KB	Output is correct
17	Correct	198 ms	15992 KB	Output is correct
18	Correct	121 ms	15992 KB	Output is correct
19	Correct	89 ms	15992 KB	Output is correct
20	Correct	64 ms	15992 KB	Output is correct
21	Correct	17 ms	16040 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	25 ms	16120 KB	Output is correct
24	Correct	22 ms	15992 KB	Output is correct
25	Correct	18 ms	15992 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	309 ms	16504 KB	Output is correct
28	Correct	59 ms	16376 KB	Output is correct
29	Correct	302 ms	16428 KB	Output is correct
30	Correct	92 ms	16376 KB	Output is correct
31	Correct	348 ms	16424 KB	Output is correct
32	Correct	76 ms	16352 KB	Output is correct
33	Correct	273 ms	16428 KB	Output is correct
34	Correct	104 ms	16376 KB	Output is correct

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	15992 KB	Output is correct
2	Correct	220 ms	16032 KB	Output is correct
3	Correct	222 ms	16120 KB	Output is correct
4	Correct	43 ms	15992 KB	Output is correct
5	Correct	26 ms	15992 KB	Output is correct
6	Correct	236 ms	15992 KB	Output is correct
7	Correct	193 ms	16120 KB	Output is correct
8	Correct	120 ms	15992 KB	Output is correct
9	Correct	89 ms	15996 KB	Output is correct
10	Correct	64 ms	15992 KB	Output is correct
11	Correct	241 ms	16096 KB	Output is correct
12	Correct	222 ms	16032 KB	Output is correct
13	Correct	148 ms	16064 KB	Output is correct
14	Correct	40 ms	16032 KB	Output is correct
15	Correct	27 ms	15992 KB	Output is correct
16	Correct	28 ms	15992 KB	Output is correct
17	Correct	198 ms	15992 KB	Output is correct
18	Correct	121 ms	15992 KB	Output is correct
19	Correct	89 ms	15992 KB	Output is correct
20	Correct	64 ms	15992 KB	Output is correct
21	Correct	17 ms	16040 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	25 ms	16120 KB	Output is correct
24	Correct	22 ms	15992 KB	Output is correct
25	Correct	18 ms	15992 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	309 ms	16504 KB	Output is correct
28	Correct	59 ms	16376 KB	Output is correct
29	Correct	302 ms	16428 KB	Output is correct
30	Correct	92 ms	16376 KB	Output is correct
31	Correct	348 ms	16424 KB	Output is correct
32	Correct	76 ms	16352 KB	Output is correct
33	Correct	273 ms	16428 KB	Output is correct
34	Correct	104 ms	16376 KB	Output is correct
35	Execution timed out	2571 ms	16432 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	15992 KB	Output is correct
2	Correct	220 ms	16032 KB	Output is correct
3	Correct	222 ms	16120 KB	Output is correct
4	Correct	43 ms	15992 KB	Output is correct
5	Correct	26 ms	15992 KB	Output is correct
6	Correct	236 ms	15992 KB	Output is correct
7	Correct	193 ms	16120 KB	Output is correct
8	Correct	120 ms	15992 KB	Output is correct
9	Correct	89 ms	15996 KB	Output is correct
10	Correct	64 ms	15992 KB	Output is correct
11	Correct	241 ms	16096 KB	Output is correct
12	Correct	222 ms	16032 KB	Output is correct
13	Correct	148 ms	16064 KB	Output is correct
14	Correct	40 ms	16032 KB	Output is correct
15	Correct	27 ms	15992 KB	Output is correct
16	Correct	28 ms	15992 KB	Output is correct
17	Correct	198 ms	15992 KB	Output is correct
18	Correct	121 ms	15992 KB	Output is correct
19	Correct	89 ms	15992 KB	Output is correct
20	Correct	64 ms	15992 KB	Output is correct
21	Correct	17 ms	16040 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	25 ms	16120 KB	Output is correct
24	Correct	22 ms	15992 KB	Output is correct
25	Correct	18 ms	15992 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	309 ms	16504 KB	Output is correct
28	Correct	59 ms	16376 KB	Output is correct
29	Correct	302 ms	16428 KB	Output is correct
30	Correct	92 ms	16376 KB	Output is correct
31	Correct	348 ms	16424 KB	Output is correct
32	Correct	76 ms	16352 KB	Output is correct
33	Correct	273 ms	16428 KB	Output is correct
34	Correct	104 ms	16376 KB	Output is correct
35	Execution timed out	2571 ms	16432 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	233 ms	15992 KB	Output is correct
2	Correct	220 ms	16032 KB	Output is correct
3	Correct	222 ms	16120 KB	Output is correct
4	Correct	43 ms	15992 KB	Output is correct
5	Correct	26 ms	15992 KB	Output is correct
6	Correct	236 ms	15992 KB	Output is correct
7	Correct	193 ms	16120 KB	Output is correct
8	Correct	120 ms	15992 KB	Output is correct
9	Correct	89 ms	15996 KB	Output is correct
10	Correct	64 ms	15992 KB	Output is correct
11	Correct	241 ms	16096 KB	Output is correct
12	Correct	222 ms	16032 KB	Output is correct
13	Correct	148 ms	16064 KB	Output is correct
14	Correct	40 ms	16032 KB	Output is correct
15	Correct	27 ms	15992 KB	Output is correct
16	Correct	28 ms	15992 KB	Output is correct
17	Correct	198 ms	15992 KB	Output is correct
18	Correct	121 ms	15992 KB	Output is correct
19	Correct	89 ms	15992 KB	Output is correct
20	Correct	64 ms	15992 KB	Output is correct
21	Correct	17 ms	16040 KB	Output is correct
22	Correct	5 ms	376 KB	Output is correct
23	Correct	25 ms	16120 KB	Output is correct
24	Correct	22 ms	15992 KB	Output is correct
25	Correct	18 ms	15992 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	309 ms	16504 KB	Output is correct
28	Correct	59 ms	16376 KB	Output is correct
29	Correct	302 ms	16428 KB	Output is correct
30	Correct	92 ms	16376 KB	Output is correct
31	Correct	348 ms	16424 KB	Output is correct
32	Correct	76 ms	16352 KB	Output is correct
33	Correct	273 ms	16428 KB	Output is correct
34	Correct	104 ms	16376 KB	Output is correct
35	Execution timed out	2571 ms	16432 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-

Submission #205652

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 10.0

Subtask #4 0 / 25.0

Subtask #5 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 10.0

Subtask #4
0 / 25.0

Subtask #5
0 / 20.0