oj.uz

Submission #676220

# Submission time Handle Problem Language Result Execution time Memory
676220 2022-12-29T21:48:31 Z Sam_a17 Painting Walls (APIO20_paint) C++17
28 / 100
 1500 ms 14428 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int maxN = 2e5 + 10, LOG = 20;
vector<int> st[maxN];
bool start[maxN];
int lst[maxN], dp[2][maxN];
int nxt[maxN], up[maxN][LOG];

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
  for(int i = 0; i < M; i++) {
    for(int j = 0; j < A[i]; j++) {
      st[B[i][j]].push_back(i);
    }
  }

  for(int i = 0; i < N; i++) {
    C.push_back(C[i]);
  }

  for(auto i: st[C[0]]) {
    dp[0][i] = 1;
    lst[0] = 1;
  }

  for(int i = 1; i < 2 * N; i++) {
    for(auto j: st[C[i]]) {
      int last_index = (j - 1 + M) % M;
      dp[i & 1][j] = max(dp[i & 1][j], dp[!(i & 1)][last_index] + 1);
      dp[i & 1][j] = min(dp[i & 1][j], M);
      lst[i] = max(lst[i], dp[i & 1][j]);
    }
    memset(dp[!(i & 1)], 0, sizeof(dp[!(i & 1)]));
  }

  for(int i = 0; i < 2 * N; i++) {
    if(lst[i] == M) {
      start[i] = true;
    }
  }

  
  for(int i = 0; i < LOG; i++) up[maxN - 10][i] = maxN - 10;
  nxt[maxN - 10] = maxN - 10;

  vector<int> xd{maxN - 10};
  for(int i = 2 * N - 1; i >= 0; i--) {
    if(start[i]) {
      xd.push_back(i);
      up[i][0] = max(0, i - M);
    }
    int len = xd.back() - i + 1;
    if(len <= M) {
      nxt[i] = xd.back();
    } else {
      nxt[i] = maxN - 10;
    }

    if(!start[i]) {
      up[i][0] = up[nxt[i]][0];
    }
  }


  for(int i = 1; i < LOG; i++) {
    for(int j = 2 * N - 1; j >= 0; j--) {
      int curr = up[j][i - 1];
      curr = nxt[curr];
      up[j][i] = up[curr][i - 1];
    }
  }

  int answ = maxN;
  for(int i = 2 * N - 1; i >= N; i--) {
    if(!start[i]) continue;
    
    int ina = 1, inb = N, aw = -1;
    int L = i - N;

    while(ina <= inb) {
      int mid = (ina + inb) / 2;
      int cr = i;
      for(int j = 0; j < LOG; j++) {
        if(mid & (1 << j)) {
          cr = up[cr][j];
        }
      }

      if(cr <= L) {
        aw = mid;
        inb = mid - 1;
      } else {
        ina = mid + 1;
      }
    }

    if(aw != -1) {
      answ = min(answ, aw);
    }
  }

  if(answ == maxN) answ = -1;
  return answ;
}

Compilation message

paint.cpp: In function 'void setIO(std::string)':
paint.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
paint.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 3 ms 6484 KB Output is correct
7 Correct 24 ms 6612 KB Output is correct
8 Correct 27 ms 6592 KB Output is correct
9 Correct 25 ms 6588 KB Output is correct
10 Correct 23 ms 6592 KB Output is correct
11 Correct 21 ms 6604 KB Output is correct
12 Correct 21 ms 6612 KB Output is correct
13 Correct 22 ms 6612 KB Output is correct
14 Correct 21 ms 6612 KB Output is correct
15 Correct 21 ms 6612 KB Output is correct
16 Correct 21 ms 6636 KB Output is correct
17 Correct 21 ms 6612 KB Output is correct
18 Correct 21 ms 6632 KB Output is correct
19 Correct 21 ms 6612 KB Output is correct
20 Correct 21 ms 6644 KB Output is correct
21 Correct 21 ms 6612 KB Output is correct
22 Correct 41 ms 10488 KB Output is correct
23 Correct 39 ms 10516 KB Output is correct
24 Correct 40 ms 10572 KB Output is correct
25 Correct 805 ms 10624 KB Output is correct
26 Correct 815 ms 10732 KB Output is correct
27 Correct 717 ms 10592 KB Output is correct
28 Correct 700 ms 10368 KB Output is correct
29 Correct 701 ms 10288 KB Output is correct
30 Correct 731 ms 10528 KB Output is correct
31 Correct 777 ms 11488 KB Output is correct
32 Correct 771 ms 11464 KB Output is correct
33 Correct 768 ms 11472 KB Output is correct
34 Correct 987 ms 11472 KB Output is correct
35 Correct 746 ms 11676 KB Output is correct
36 Correct 787 ms 11480 KB Output is correct
37 Correct 848 ms 14428 KB Output is correct
38 Correct 812 ms 14320 KB Output is correct
39 Correct 732 ms 14412 KB Output is correct
40 Execution timed out 1566 ms 8176 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 3 ms 6484 KB Output is correct
7 Correct 24 ms 6612 KB Output is correct
8 Correct 27 ms 6592 KB Output is correct
9 Correct 25 ms 6588 KB Output is correct
10 Correct 23 ms 6592 KB Output is correct
11 Correct 21 ms 6604 KB Output is correct
12 Correct 21 ms 6612 KB Output is correct
13 Correct 22 ms 6612 KB Output is correct
14 Correct 21 ms 6612 KB Output is correct
15 Correct 21 ms 6612 KB Output is correct
16 Correct 21 ms 6636 KB Output is correct
17 Correct 21 ms 6612 KB Output is correct
18 Correct 21 ms 6632 KB Output is correct
19 Correct 21 ms 6612 KB Output is correct
20 Correct 21 ms 6644 KB Output is correct
21 Correct 21 ms 6612 KB Output is correct
22 Correct 4 ms 6484 KB Output is correct
23 Correct 4 ms 6484 KB Output is correct
24 Correct 4 ms 6484 KB Output is correct
25 Correct 3 ms 6584 KB Output is correct
26 Correct 4 ms 6484 KB Output is correct
27 Correct 15 ms 6612 KB Output is correct
28 Correct 15 ms 6612 KB Output is correct
29 Correct 13 ms 6592 KB Output is correct
30 Correct 17 ms 6612 KB Output is correct
31 Correct 20 ms 6588 KB Output is correct
32 Correct 21 ms 6612 KB Output is correct
33 Correct 24 ms 6612 KB Output is correct
34 Correct 20 ms 6612 KB Output is correct
35 Correct 14 ms 6612 KB Output is correct
36 Correct 18 ms 6624 KB Output is correct
37 Correct 16 ms 6612 KB Output is correct
38 Correct 19 ms 6620 KB Output is correct
39 Correct 19 ms 6612 KB Output is correct
40 Correct 15 ms 6636 KB Output is correct
41 Correct 15 ms 6616 KB Output is correct
42 Correct 20 ms 6620 KB Output is correct
43 Correct 16 ms 6600 KB Output is correct
44 Correct 28 ms 6612 KB Output is correct
45 Correct 22 ms 6596 KB Output is correct
46 Correct 22 ms 6592 KB Output is correct
47 Correct 21 ms 6592 KB Output is correct
48 Correct 25 ms 6596 KB Output is correct
49 Correct 26 ms 6604 KB Output is correct
50 Correct 22 ms 6632 KB Output is correct
51 Correct 22 ms 6632 KB Output is correct
52 Correct 21 ms 6620 KB Output is correct
53 Correct 21 ms 6628 KB Output is correct
54 Correct 26 ms 6636 KB Output is correct
55 Correct 21 ms 6612 KB Output is correct
56 Correct 22 ms 6644 KB Output is correct
57 Correct 22 ms 6620 KB Output is correct
58 Correct 21 ms 6648 KB Output is correct
59 Correct 33 ms 6612 KB Output is correct
60 Correct 21 ms 6648 KB Output is correct
61 Correct 21 ms 6612 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6612 KB Output is correct
10 Correct 27 ms 6592 KB Output is correct
11 Correct 25 ms 6588 KB Output is correct
12 Correct 23 ms 6592 KB Output is correct
13 Correct 21 ms 6604 KB Output is correct
14 Correct 21 ms 6612 KB Output is correct
15 Correct 22 ms 6612 KB Output is correct
16 Correct 21 ms 6612 KB Output is correct
17 Correct 21 ms 6612 KB Output is correct
18 Correct 21 ms 6636 KB Output is correct
19 Correct 21 ms 6612 KB Output is correct
20 Correct 21 ms 6632 KB Output is correct
21 Correct 21 ms 6612 KB Output is correct
22 Correct 21 ms 6644 KB Output is correct
23 Correct 21 ms 6612 KB Output is correct
24 Correct 41 ms 10488 KB Output is correct
25 Correct 39 ms 10516 KB Output is correct
26 Correct 40 ms 10572 KB Output is correct
27 Correct 4 ms 6484 KB Output is correct
28 Correct 3 ms 6584 KB Output is correct
29 Correct 4 ms 6484 KB Output is correct
30 Correct 15 ms 6612 KB Output is correct
31 Correct 15 ms 6612 KB Output is correct
32 Correct 13 ms 6592 KB Output is correct
33 Correct 17 ms 6612 KB Output is correct
34 Correct 20 ms 6588 KB Output is correct
35 Correct 21 ms 6612 KB Output is correct
36 Correct 24 ms 6612 KB Output is correct
37 Correct 20 ms 6612 KB Output is correct
38 Correct 14 ms 6612 KB Output is correct
39 Correct 18 ms 6624 KB Output is correct
40 Correct 16 ms 6612 KB Output is correct
41 Correct 19 ms 6620 KB Output is correct
42 Correct 19 ms 6612 KB Output is correct
43 Correct 15 ms 6636 KB Output is correct
44 Correct 15 ms 6616 KB Output is correct
45 Correct 20 ms 6620 KB Output is correct
46 Correct 16 ms 6600 KB Output is correct
47 Correct 28 ms 6612 KB Output is correct
48 Correct 22 ms 6596 KB Output is correct
49 Correct 22 ms 6592 KB Output is correct
50 Correct 21 ms 6592 KB Output is correct
51 Correct 25 ms 6596 KB Output is correct
52 Correct 26 ms 6604 KB Output is correct
53 Correct 22 ms 6632 KB Output is correct
54 Correct 22 ms 6632 KB Output is correct
55 Correct 21 ms 6620 KB Output is correct
56 Correct 21 ms 6628 KB Output is correct
57 Correct 26 ms 6636 KB Output is correct
58 Correct 21 ms 6612 KB Output is correct
59 Correct 22 ms 6644 KB Output is correct
60 Correct 22 ms 6620 KB Output is correct
61 Correct 21 ms 6648 KB Output is correct
62 Correct 33 ms 6612 KB Output is correct
63 Correct 21 ms 6648 KB Output is correct
64 Correct 21 ms 6612 KB Output is correct
65 Correct 13 ms 6612 KB Output is correct
66 Correct 21 ms 6588 KB Output is correct
67 Correct 21 ms 6600 KB Output is correct
68 Correct 27 ms 6604 KB Output is correct
69 Correct 19 ms 6612 KB Output is correct
70 Correct 25 ms 6740 KB Output is correct
71 Correct 24 ms 6772 KB Output is correct
72 Correct 19 ms 6768 KB Output is correct
73 Correct 17 ms 6724 KB Output is correct
74 Correct 17 ms 6776 KB Output is correct
75 Correct 19 ms 6816 KB Output is correct
76 Correct 33 ms 9284 KB Output is correct
77 Correct 34 ms 9676 KB Output is correct
78 Correct 43 ms 10136 KB Output is correct
79 Correct 22 ms 6596 KB Output is correct
80 Correct 22 ms 6708 KB Output is correct
81 Correct 22 ms 6620 KB Output is correct
82 Correct 22 ms 6712 KB Output is correct
83 Correct 22 ms 6628 KB Output is correct
84 Correct 23 ms 6868 KB Output is correct
85 Correct 23 ms 6820 KB Output is correct
86 Correct 24 ms 6828 KB Output is correct
87 Correct 23 ms 6820 KB Output is correct
88 Correct 26 ms 6824 KB Output is correct
89 Correct 24 ms 6812 KB Output is correct
90 Correct 51 ms 10408 KB Output is correct
91 Correct 50 ms 10324 KB Output is correct
92 Correct 51 ms 10400 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6612 KB Output is correct
10 Correct 27 ms 6592 KB Output is correct
11 Correct 25 ms 6588 KB Output is correct
12 Correct 23 ms 6592 KB Output is correct
13 Correct 21 ms 6604 KB Output is correct
14 Correct 21 ms 6612 KB Output is correct
15 Correct 22 ms 6612 KB Output is correct
16 Correct 21 ms 6612 KB Output is correct
17 Correct 21 ms 6612 KB Output is correct
18 Correct 21 ms 6636 KB Output is correct
19 Correct 21 ms 6612 KB Output is correct
20 Correct 21 ms 6632 KB Output is correct
21 Correct 21 ms 6612 KB Output is correct
22 Correct 21 ms 6644 KB Output is correct
23 Correct 21 ms 6612 KB Output is correct
24 Correct 41 ms 10488 KB Output is correct
25 Correct 39 ms 10516 KB Output is correct
26 Correct 40 ms 10572 KB Output is correct
27 Correct 805 ms 10624 KB Output is correct
28 Correct 815 ms 10732 KB Output is correct
29 Correct 717 ms 10592 KB Output is correct
30 Correct 700 ms 10368 KB Output is correct
31 Correct 701 ms 10288 KB Output is correct
32 Correct 731 ms 10528 KB Output is correct
33 Correct 777 ms 11488 KB Output is correct
34 Correct 771 ms 11464 KB Output is correct
35 Correct 768 ms 11472 KB Output is correct
36 Correct 987 ms 11472 KB Output is correct
37 Correct 746 ms 11676 KB Output is correct
38 Correct 787 ms 11480 KB Output is correct
39 Correct 848 ms 14428 KB Output is correct
40 Correct 812 ms 14320 KB Output is correct
41 Correct 732 ms 14412 KB Output is correct
42 Correct 4 ms 6484 KB Output is correct
43 Correct 3 ms 6584 KB Output is correct
44 Correct 4 ms 6484 KB Output is correct
45 Correct 15 ms 6612 KB Output is correct
46 Correct 15 ms 6612 KB Output is correct
47 Correct 13 ms 6592 KB Output is correct
48 Correct 17 ms 6612 KB Output is correct
49 Correct 20 ms 6588 KB Output is correct
50 Correct 21 ms 6612 KB Output is correct
51 Correct 24 ms 6612 KB Output is correct
52 Correct 20 ms 6612 KB Output is correct
53 Correct 14 ms 6612 KB Output is correct
54 Correct 18 ms 6624 KB Output is correct
55 Correct 16 ms 6612 KB Output is correct
56 Correct 19 ms 6620 KB Output is correct
57 Correct 19 ms 6612 KB Output is correct
58 Correct 15 ms 6636 KB Output is correct
59 Correct 15 ms 6616 KB Output is correct
60 Correct 20 ms 6620 KB Output is correct
61 Correct 16 ms 6600 KB Output is correct
62 Correct 28 ms 6612 KB Output is correct
63 Correct 22 ms 6596 KB Output is correct
64 Correct 22 ms 6592 KB Output is correct
65 Correct 21 ms 6592 KB Output is correct
66 Correct 25 ms 6596 KB Output is correct
67 Correct 26 ms 6604 KB Output is correct
68 Correct 22 ms 6632 KB Output is correct
69 Correct 22 ms 6632 KB Output is correct
70 Correct 21 ms 6620 KB Output is correct
71 Correct 21 ms 6628 KB Output is correct
72 Correct 26 ms 6636 KB Output is correct
73 Correct 21 ms 6612 KB Output is correct
74 Correct 22 ms 6644 KB Output is correct
75 Correct 22 ms 6620 KB Output is correct
76 Correct 21 ms 6648 KB Output is correct
77 Correct 33 ms 6612 KB Output is correct
78 Correct 21 ms 6648 KB Output is correct
79 Correct 21 ms 6612 KB Output is correct
80 Correct 13 ms 6612 KB Output is correct
81 Correct 21 ms 6588 KB Output is correct
82 Correct 21 ms 6600 KB Output is correct
83 Correct 27 ms 6604 KB Output is correct
84 Correct 19 ms 6612 KB Output is correct
85 Correct 25 ms 6740 KB Output is correct
86 Correct 24 ms 6772 KB Output is correct
87 Correct 19 ms 6768 KB Output is correct
88 Correct 17 ms 6724 KB Output is correct
89 Correct 17 ms 6776 KB Output is correct
90 Correct 19 ms 6816 KB Output is correct
91 Correct 33 ms 9284 KB Output is correct
92 Correct 34 ms 9676 KB Output is correct
93 Correct 43 ms 10136 KB Output is correct
94 Correct 22 ms 6596 KB Output is correct
95 Correct 22 ms 6708 KB Output is correct
96 Correct 22 ms 6620 KB Output is correct
97 Correct 22 ms 6712 KB Output is correct
98 Correct 22 ms 6628 KB Output is correct
99 Correct 23 ms 6868 KB Output is correct
100 Correct 23 ms 6820 KB Output is correct
101 Correct 24 ms 6828 KB Output is correct
102 Correct 23 ms 6820 KB Output is correct
103 Correct 26 ms 6824 KB Output is correct
104 Correct 24 ms 6812 KB Output is correct
105 Correct 51 ms 10408 KB Output is correct
106 Correct 50 ms 10324 KB Output is correct
107 Correct 51 ms 10400 KB Output is correct
108 Correct 719 ms 10656 KB Output is correct
109 Correct 681 ms 9588 KB Output is correct
110 Correct 465 ms 8896 KB Output is correct
111 Correct 435 ms 8920 KB Output is correct
112 Correct 601 ms 9452 KB Output is correct
113 Correct 453 ms 8652 KB Output is correct
114 Correct 399 ms 9932 KB Output is correct
115 Correct 395 ms 9704 KB Output is correct
116 Correct 776 ms 11440 KB Output is correct
117 Correct 398 ms 9928 KB Output is correct
118 Correct 461 ms 10320 KB Output is correct
119 Correct 573 ms 10320 KB Output is correct
120 Correct 423 ms 11112 KB Output is correct
121 Correct 418 ms 9444 KB Output is correct
122 Correct 437 ms 11188 KB Output is correct
123 Correct 438 ms 9240 KB Output is correct
124 Correct 762 ms 13180 KB Output is correct
125 Correct 783 ms 10892 KB Output is correct
126 Incorrect 584 ms 10128 KB Output isn't correct
127 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 4 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6612 KB Output is correct
10 Correct 27 ms 6592 KB Output is correct
11 Correct 25 ms 6588 KB Output is correct
12 Correct 23 ms 6592 KB Output is correct
13 Correct 21 ms 6604 KB Output is correct
14 Correct 21 ms 6612 KB Output is correct
15 Correct 22 ms 6612 KB Output is correct
16 Correct 21 ms 6612 KB Output is correct
17 Correct 21 ms 6612 KB Output is correct
18 Correct 21 ms 6636 KB Output is correct
19 Correct 21 ms 6612 KB Output is correct
20 Correct 21 ms 6632 KB Output is correct
21 Correct 21 ms 6612 KB Output is correct
22 Correct 21 ms 6644 KB Output is correct
23 Correct 21 ms 6612 KB Output is correct
24 Correct 41 ms 10488 KB Output is correct
25 Correct 39 ms 10516 KB Output is correct
26 Correct 40 ms 10572 KB Output is correct
27 Correct 805 ms 10624 KB Output is correct
28 Correct 815 ms 10732 KB Output is correct
29 Correct 717 ms 10592 KB Output is correct
30 Correct 700 ms 10368 KB Output is correct
31 Correct 701 ms 10288 KB Output is correct
32 Correct 731 ms 10528 KB Output is correct
33 Correct 777 ms 11488 KB Output is correct
34 Correct 771 ms 11464 KB Output is correct
35 Correct 768 ms 11472 KB Output is correct
36 Correct 987 ms 11472 KB Output is correct
37 Correct 746 ms 11676 KB Output is correct
38 Correct 787 ms 11480 KB Output is correct
39 Correct 848 ms 14428 KB Output is correct
40 Correct 812 ms 14320 KB Output is correct
41 Correct 732 ms 14412 KB Output is correct
42 Execution timed out 1566 ms 8176 KB Time limit exceeded
43 Halted 0 ms 0 KB -