oj.uz

Submission #919410

# Submission time Handle Problem Language Result Execution time Memory
919410 2024-01-31T17:46:16 Z hariaakas646 Painting Walls (APIO20_paint) C++17
51 / 100
 202 ms 81096 KB 
#include "paint.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, l, r) for(int i=l; i<r; i++)
#define frange(i, l) forr(i, 0, l)
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef long long lli;
typedef vector<vi> vvi;
typedef vector<lli> vll;
typedef vector<bool> vb;
typedef set<int> seti;
typedef multiset<int> mseti;

int minimumInstructions(
    int n, int m, int k, vector<int> col,
    vector<int> cnt, vector<std::vector<int>> fav) {

    // vector<vb> favb(m, vb(k));
    vector<vector<short>> val(k);

    frange(i, fav.size()) {
        for(auto e : fav[i]) {
            val[e].pb(i);
        }
    }


    vector<vector<short>> dp1(n), dp2(n);
    if(val[col[0]].size() >= 1 && val[col[0]][0] == 0) dp1[0].pb(0);

    forr(i, 1, n) {
        int id = 0;
        while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
        if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
        for(auto e : dp1[i-1]) {
            while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
        }
    }

    if(val[col[n-1]].size() && val[col[n-1]].back() == m-1) dp2[n-1].pb(m-1);

    for(int i=n-2; i>=0; i--) {
        int id = 0;
        for(auto e : dp2[i+1]) {
            while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
            if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
        }
        while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
        if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
    }

    vb pos(n);

    forr(i, m-1, n) {
        int id = 0;
        for(auto e : dp1[i]) {
            while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
            if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
        }
        
        if(dp1[i].size() && dp1[i].back() == m-1) pos[i] = true;
        if(dp2[i-m+1].size() && dp2[i-m+1].front() == 0) pos[i] = true;
    }

    vi dp(n, 1e9);

    if(pos[m-1]) dp[m-1] = 1;

    deque<int> dq;
    dq.pb(m-1);

    forr(i, m, n) {
        while(dq.size() && dq.front() < i-m) dq.pop_front();
        if(pos[i]) {
            if(dq.size())
                dp[i] = min(dp[i], dp[dq.front()]+1);
            while(dq.size() && dp[dq.back()] >= dp[i]) dq.pop_back();
            dq.pb(i);
        }
    }
    if(dp[n-1] >= 1e9) return -1;
    else return dp[n-1];
}

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:8:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define forr(i, l, r) for(int i=l; i<r; i++)
      |                                     ^
paint.cpp:9:22: note: in expansion of macro 'forr'
    9 | #define frange(i, l) forr(i, 0, l)
      |                      ^~~~
paint.cpp:33:5: note: in expansion of macro 'frange'
   33 |     frange(i, fav.size()) {
      |     ^~~~~~
paint.cpp:45:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         while(id < val[col[i]].size() && val[col[i]][id] < 0) id++;
      |               ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:46:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         if(id < val[col[i]].size() && val[col[i]][id] == 0) dp1[i].pb(0);
      |            ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             while(id < val[col[i]].size() && val[col[i]][id] < e+1) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             if(id < val[col[i]].size() && val[col[i]][id] == e+1) dp1[i].pb(e+1);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             while(id < val[col[i]].size() && val[col[i]][id] < e-1) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:59:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             if(id < val[col[i]].size() && val[col[i]][id] == e-1) dp2[i].pb(e-1);
      |                ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:61:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         while(id < val[col[i]].size() && val[col[i]][id] < m-1) id++;
      |               ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:62:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         if(id < val[col[i]].size() && val[col[i]][id] == m-1) dp2[i].pb(m-1);
      |            ~~~^~~~~~~~~~~~~~~~~~~~
paint.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             while(id < dp2[i-m+1].size() && dp2[i-m+1][id] < e+1) id++;
      |                   ~~~^~~~~~~~~~~~~~~~~~~
paint.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |             if(id < dp2[i-m+1].size() && dp2[i-m+1][id] == e+1) pos[i] = true;
      |                ~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 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 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 2648 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 2 ms 2808 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 14 ms 6744 KB Output is correct
23 Correct 16 ms 6744 KB Output is correct
24 Correct 14 ms 6492 KB Output is correct
25 Correct 4 ms 2648 KB Output is correct
26 Correct 5 ms 2648 KB Output is correct
27 Correct 4 ms 2392 KB Output is correct
28 Correct 4 ms 2136 KB Output is correct
29 Correct 3 ms 1880 KB Output is correct
30 Correct 3 ms 2136 KB Output is correct
31 Correct 9 ms 5980 KB Output is correct
32 Correct 10 ms 5980 KB Output is correct
33 Correct 9 ms 5976 KB Output is correct
34 Correct 10 ms 6000 KB Output is correct
35 Correct 10 ms 5976 KB Output is correct
36 Correct 11 ms 5980 KB Output is correct
37 Correct 20 ms 8024 KB Output is correct
38 Correct 19 ms 8028 KB Output is correct
39 Correct 17 ms 8024 KB Output is correct
40 Correct 19 ms 11352 KB Output is correct
41 Correct 12 ms 7256 KB Output is correct
42 Correct 20 ms 10840 KB Output is correct
43 Correct 12 ms 6232 KB Output is correct
44 Correct 9 ms 5208 KB Output is correct
45 Correct 14 ms 7796 KB Output is correct
46 Incorrect 35 ms 17488 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 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 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 2648 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 2 ms 2808 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 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 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 2 ms 2552 KB Output is correct
34 Correct 2 ms 1880 KB Output is correct
35 Correct 2 ms 1624 KB Output is correct
36 Correct 2 ms 2648 KB Output is correct
37 Correct 1 ms 2136 KB Output is correct
38 Correct 2 ms 2392 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 2136 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 2 ms 2648 KB Output is correct
43 Correct 2 ms 2652 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 2 ms 2648 KB Output is correct
51 Correct 2 ms 2648 KB Output is correct
52 Correct 2 ms 2648 KB Output is correct
53 Correct 2 ms 2648 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 2 ms 2648 KB Output is correct
56 Correct 2 ms 2648 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 2 ms 2648 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 2 ms 2648 KB Output is correct
61 Correct 1 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 344 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2808 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 14 ms 6492 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 2 ms 2552 KB Output is correct
37 Correct 2 ms 1880 KB Output is correct
38 Correct 2 ms 1624 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 1 ms 2136 KB Output is correct
41 Correct 2 ms 2392 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 2136 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 2 ms 2648 KB Output is correct
46 Correct 2 ms 2652 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 2 ms 2648 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 2 ms 2648 KB Output is correct
56 Correct 2 ms 2648 KB Output is correct
57 Correct 2 ms 2648 KB Output is correct
58 Correct 2 ms 2648 KB Output is correct
59 Correct 2 ms 2648 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 2 ms 2648 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 2 ms 2648 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 600 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 1 ms 604 KB Output is correct
68 Correct 1 ms 856 KB Output is correct
69 Correct 1 ms 600 KB Output is correct
70 Correct 3 ms 2396 KB Output is correct
71 Correct 2 ms 2136 KB Output is correct
72 Correct 2 ms 1884 KB Output is correct
73 Correct 2 ms 2136 KB Output is correct
74 Correct 3 ms 2392 KB Output is correct
75 Correct 3 ms 2908 KB Output is correct
76 Correct 15 ms 4696 KB Output is correct
77 Correct 15 ms 5464 KB Output is correct
78 Correct 18 ms 5980 KB Output is correct
79 Correct 2 ms 856 KB Output is correct
80 Correct 2 ms 856 KB Output is correct
81 Correct 2 ms 1112 KB Output is correct
82 Correct 2 ms 856 KB Output is correct
83 Correct 2 ms 860 KB Output is correct
84 Correct 3 ms 2992 KB Output is correct
85 Correct 3 ms 2904 KB Output is correct
86 Correct 3 ms 2908 KB Output is correct
87 Correct 3 ms 2904 KB Output is correct
88 Correct 3 ms 2904 KB Output is correct
89 Correct 3 ms 2904 KB Output is correct
90 Correct 24 ms 6492 KB Output is correct
91 Correct 21 ms 6488 KB Output is correct
92 Correct 20 ms 6492 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 344 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2808 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 14 ms 6492 KB Output is correct
27 Correct 4 ms 2648 KB Output is correct
28 Correct 5 ms 2648 KB Output is correct
29 Correct 4 ms 2392 KB Output is correct
30 Correct 4 ms 2136 KB Output is correct
31 Correct 3 ms 1880 KB Output is correct
32 Correct 3 ms 2136 KB Output is correct
33 Correct 9 ms 5980 KB Output is correct
34 Correct 10 ms 5980 KB Output is correct
35 Correct 9 ms 5976 KB Output is correct
36 Correct 10 ms 6000 KB Output is correct
37 Correct 10 ms 5976 KB Output is correct
38 Correct 11 ms 5980 KB Output is correct
39 Correct 20 ms 8024 KB Output is correct
40 Correct 19 ms 8028 KB Output is correct
41 Correct 17 ms 8024 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 2 ms 2552 KB Output is correct
52 Correct 2 ms 1880 KB Output is correct
53 Correct 2 ms 1624 KB Output is correct
54 Correct 2 ms 2648 KB Output is correct
55 Correct 1 ms 2136 KB Output is correct
56 Correct 2 ms 2392 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 2136 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 2 ms 2648 KB Output is correct
61 Correct 2 ms 2652 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 600 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 2 ms 2648 KB Output is correct
69 Correct 2 ms 2648 KB Output is correct
70 Correct 2 ms 2648 KB Output is correct
71 Correct 2 ms 2648 KB Output is correct
72 Correct 2 ms 2648 KB Output is correct
73 Correct 2 ms 2648 KB Output is correct
74 Correct 2 ms 2648 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 2 ms 2648 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 2 ms 2648 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 600 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 604 KB Output is correct
83 Correct 1 ms 856 KB Output is correct
84 Correct 1 ms 600 KB Output is correct
85 Correct 3 ms 2396 KB Output is correct
86 Correct 2 ms 2136 KB Output is correct
87 Correct 2 ms 1884 KB Output is correct
88 Correct 2 ms 2136 KB Output is correct
89 Correct 3 ms 2392 KB Output is correct
90 Correct 3 ms 2908 KB Output is correct
91 Correct 15 ms 4696 KB Output is correct
92 Correct 15 ms 5464 KB Output is correct
93 Correct 18 ms 5980 KB Output is correct
94 Correct 2 ms 856 KB Output is correct
95 Correct 2 ms 856 KB Output is correct
96 Correct 2 ms 1112 KB Output is correct
97 Correct 2 ms 856 KB Output is correct
98 Correct 2 ms 860 KB Output is correct
99 Correct 3 ms 2992 KB Output is correct
100 Correct 3 ms 2904 KB Output is correct
101 Correct 3 ms 2908 KB Output is correct
102 Correct 3 ms 2904 KB Output is correct
103 Correct 3 ms 2904 KB Output is correct
104 Correct 3 ms 2904 KB Output is correct
105 Correct 24 ms 6492 KB Output is correct
106 Correct 21 ms 6488 KB Output is correct
107 Correct 20 ms 6492 KB Output is correct
108 Correct 6 ms 2648 KB Output is correct
109 Correct 150 ms 58624 KB Output is correct
110 Correct 7 ms 1624 KB Output is correct
111 Correct 5 ms 1368 KB Output is correct
112 Correct 5 ms 1880 KB Output is correct
113 Correct 4 ms 1368 KB Output is correct
114 Correct 11 ms 4696 KB Output is correct
115 Correct 11 ms 4312 KB Output is correct
116 Correct 16 ms 5848 KB Output is correct
117 Correct 12 ms 4188 KB Output is correct
118 Correct 13 ms 4952 KB Output is correct
119 Correct 11 ms 5208 KB Output is correct
120 Correct 14 ms 4952 KB Output is correct
121 Correct 5 ms 2648 KB Output is correct
122 Correct 16 ms 4952 KB Output is correct
123 Correct 5 ms 2392 KB Output is correct
124 Correct 21 ms 6232 KB Output is correct
125 Correct 8 ms 3672 KB Output is correct
126 Correct 9 ms 3928 KB Output is correct
127 Correct 10 ms 4952 KB Output is correct
128 Correct 7 ms 3928 KB Output is correct
129 Correct 7 ms 3672 KB Output is correct
130 Correct 6 ms 2648 KB Output is correct
131 Correct 202 ms 81096 KB Output is correct
132 Correct 10 ms 2652 KB Output is correct
133 Correct 8 ms 2136 KB Output is correct
134 Correct 9 ms 2136 KB Output is correct
135 Correct 6 ms 1884 KB Output is correct
136 Correct 17 ms 6472 KB Output is correct
137 Correct 20 ms 6488 KB Output is correct
138 Correct 17 ms 6488 KB Output is correct
139 Correct 18 ms 6608 KB Output is correct
140 Correct 17 ms 6492 KB Output is correct
141 Correct 20 ms 6488 KB Output is correct
142 Correct 25 ms 7760 KB Output is correct
143 Correct 9 ms 3932 KB Output is correct
144 Correct 24 ms 7764 KB Output is correct
145 Correct 9 ms 3928 KB Output is correct
146 Correct 23 ms 7652 KB Output is correct
147 Correct 11 ms 3984 KB Output is correct
148 Correct 10 ms 5724 KB Output is correct
149 Correct 11 ms 5720 KB Output is correct
150 Correct 9 ms 5464 KB Output is correct
151 Correct 18 ms 5560 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 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 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 344 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2808 KB Output is correct
20 Correct 2 ms 2648 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2648 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 14 ms 6744 KB Output is correct
25 Correct 16 ms 6744 KB Output is correct
26 Correct 14 ms 6492 KB Output is correct
27 Correct 4 ms 2648 KB Output is correct
28 Correct 5 ms 2648 KB Output is correct
29 Correct 4 ms 2392 KB Output is correct
30 Correct 4 ms 2136 KB Output is correct
31 Correct 3 ms 1880 KB Output is correct
32 Correct 3 ms 2136 KB Output is correct
33 Correct 9 ms 5980 KB Output is correct
34 Correct 10 ms 5980 KB Output is correct
35 Correct 9 ms 5976 KB Output is correct
36 Correct 10 ms 6000 KB Output is correct
37 Correct 10 ms 5976 KB Output is correct
38 Correct 11 ms 5980 KB Output is correct
39 Correct 20 ms 8024 KB Output is correct
40 Correct 19 ms 8028 KB Output is correct
41 Correct 17 ms 8024 KB Output is correct
42 Correct 19 ms 11352 KB Output is correct
43 Correct 12 ms 7256 KB Output is correct
44 Correct 20 ms 10840 KB Output is correct
45 Correct 12 ms 6232 KB Output is correct
46 Correct 9 ms 5208 KB Output is correct
47 Correct 14 ms 7796 KB Output is correct
48 Incorrect 35 ms 17488 KB Output isn't correct
49 Halted 0 ms 0 KB -