oj.uz

답안 #676228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676228 2022-12-29T21:55:42 Z Sam_a17 벽 칠하기 (APIO20_paint) C++17
28 / 100
 1500 ms 14172 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 + 15, LOG = 18;
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;
    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 = 0, inb = N + 5, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 3 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 6580 KB Output is correct
8 Correct 22 ms 6584 KB Output is correct
9 Correct 22 ms 6612 KB Output is correct
10 Correct 20 ms 6604 KB Output is correct
11 Correct 21 ms 6584 KB Output is correct
12 Correct 25 ms 6588 KB Output is correct
13 Correct 23 ms 6624 KB Output is correct
14 Correct 26 ms 6616 KB Output is correct
15 Correct 22 ms 6624 KB Output is correct
16 Correct 21 ms 6620 KB Output is correct
17 Correct 20 ms 6612 KB Output is correct
18 Correct 21 ms 6624 KB Output is correct
19 Correct 21 ms 6636 KB Output is correct
20 Correct 21 ms 6640 KB Output is correct
21 Correct 21 ms 6628 KB Output is correct
22 Correct 42 ms 10572 KB Output is correct
23 Correct 39 ms 10496 KB Output is correct
24 Correct 40 ms 10500 KB Output is correct
25 Correct 696 ms 10284 KB Output is correct
26 Correct 735 ms 10304 KB Output is correct
27 Correct 879 ms 10096 KB Output is correct
28 Correct 706 ms 9976 KB Output is correct
29 Correct 790 ms 10080 KB Output is correct
30 Correct 786 ms 10060 KB Output is correct
31 Correct 831 ms 11336 KB Output is correct
32 Correct 768 ms 11308 KB Output is correct
33 Correct 843 ms 11300 KB Output is correct
34 Correct 824 ms 11204 KB Output is correct
35 Correct 922 ms 11252 KB Output is correct
36 Correct 826 ms 11228 KB Output is correct
37 Correct 784 ms 14036 KB Output is correct
38 Correct 726 ms 14172 KB Output is correct
39 Correct 759 ms 14064 KB Output is correct
40 Execution timed out 1586 ms 8072 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5716 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 3 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 6580 KB Output is correct
8 Correct 22 ms 6584 KB Output is correct
9 Correct 22 ms 6612 KB Output is correct
10 Correct 20 ms 6604 KB Output is correct
11 Correct 21 ms 6584 KB Output is correct
12 Correct 25 ms 6588 KB Output is correct
13 Correct 23 ms 6624 KB Output is correct
14 Correct 26 ms 6616 KB Output is correct
15 Correct 22 ms 6624 KB Output is correct
16 Correct 21 ms 6620 KB Output is correct
17 Correct 20 ms 6612 KB Output is correct
18 Correct 21 ms 6624 KB Output is correct
19 Correct 21 ms 6636 KB Output is correct
20 Correct 21 ms 6640 KB Output is correct
21 Correct 21 ms 6628 KB Output is correct
22 Correct 3 ms 6484 KB Output is correct
23 Correct 3 ms 6484 KB Output is correct
24 Correct 3 ms 6484 KB Output is correct
25 Correct 3 ms 6484 KB Output is correct
26 Correct 3 ms 6484 KB Output is correct
27 Correct 14 ms 6580 KB Output is correct
28 Correct 15 ms 6612 KB Output is correct
29 Correct 13 ms 6584 KB Output is correct
30 Correct 15 ms 6612 KB Output is correct
31 Correct 19 ms 6580 KB Output is correct
32 Correct 16 ms 6612 KB Output is correct
33 Correct 20 ms 6612 KB Output is correct
34 Correct 25 ms 6604 KB Output is correct
35 Correct 13 ms 6656 KB Output is correct
36 Correct 16 ms 6616 KB Output is correct
37 Correct 15 ms 6676 KB Output is correct
38 Correct 14 ms 6612 KB Output is correct
39 Correct 14 ms 6612 KB Output is correct
40 Correct 18 ms 6632 KB Output is correct
41 Correct 15 ms 6612 KB Output is correct
42 Correct 19 ms 6612 KB Output is correct
43 Correct 14 ms 6600 KB Output is correct
44 Correct 20 ms 6592 KB Output is correct
45 Correct 21 ms 6612 KB Output is correct
46 Correct 21 ms 6588 KB Output is correct
47 Correct 24 ms 6592 KB Output is correct
48 Correct 25 ms 6596 KB Output is correct
49 Correct 20 ms 6612 KB Output is correct
50 Correct 23 ms 6624 KB Output is correct
51 Correct 21 ms 6616 KB Output is correct
52 Correct 22 ms 6620 KB Output is correct
53 Correct 26 ms 6612 KB Output is correct
54 Correct 22 ms 6624 KB Output is correct
55 Correct 23 ms 6628 KB Output is correct
56 Correct 21 ms 6632 KB Output is correct
57 Correct 21 ms 6616 KB Output is correct
58 Correct 21 ms 6612 KB Output is correct
59 Correct 26 ms 6616 KB Output is correct
60 Correct 21 ms 6720 KB Output is correct
61 Correct 29 ms 6612 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 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 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6580 KB Output is correct
10 Correct 22 ms 6584 KB Output is correct
11 Correct 22 ms 6612 KB Output is correct
12 Correct 20 ms 6604 KB Output is correct
13 Correct 21 ms 6584 KB Output is correct
14 Correct 25 ms 6588 KB Output is correct
15 Correct 23 ms 6624 KB Output is correct
16 Correct 26 ms 6616 KB Output is correct
17 Correct 22 ms 6624 KB Output is correct
18 Correct 21 ms 6620 KB Output is correct
19 Correct 20 ms 6612 KB Output is correct
20 Correct 21 ms 6624 KB Output is correct
21 Correct 21 ms 6636 KB Output is correct
22 Correct 21 ms 6640 KB Output is correct
23 Correct 21 ms 6628 KB Output is correct
24 Correct 42 ms 10572 KB Output is correct
25 Correct 39 ms 10496 KB Output is correct
26 Correct 40 ms 10500 KB Output is correct
27 Correct 3 ms 6484 KB Output is correct
28 Correct 3 ms 6484 KB Output is correct
29 Correct 3 ms 6484 KB Output is correct
30 Correct 14 ms 6580 KB Output is correct
31 Correct 15 ms 6612 KB Output is correct
32 Correct 13 ms 6584 KB Output is correct
33 Correct 15 ms 6612 KB Output is correct
34 Correct 19 ms 6580 KB Output is correct
35 Correct 16 ms 6612 KB Output is correct
36 Correct 20 ms 6612 KB Output is correct
37 Correct 25 ms 6604 KB Output is correct
38 Correct 13 ms 6656 KB Output is correct
39 Correct 16 ms 6616 KB Output is correct
40 Correct 15 ms 6676 KB Output is correct
41 Correct 14 ms 6612 KB Output is correct
42 Correct 14 ms 6612 KB Output is correct
43 Correct 18 ms 6632 KB Output is correct
44 Correct 15 ms 6612 KB Output is correct
45 Correct 19 ms 6612 KB Output is correct
46 Correct 14 ms 6600 KB Output is correct
47 Correct 20 ms 6592 KB Output is correct
48 Correct 21 ms 6612 KB Output is correct
49 Correct 21 ms 6588 KB Output is correct
50 Correct 24 ms 6592 KB Output is correct
51 Correct 25 ms 6596 KB Output is correct
52 Correct 20 ms 6612 KB Output is correct
53 Correct 23 ms 6624 KB Output is correct
54 Correct 21 ms 6616 KB Output is correct
55 Correct 22 ms 6620 KB Output is correct
56 Correct 26 ms 6612 KB Output is correct
57 Correct 22 ms 6624 KB Output is correct
58 Correct 23 ms 6628 KB Output is correct
59 Correct 21 ms 6632 KB Output is correct
60 Correct 21 ms 6616 KB Output is correct
61 Correct 21 ms 6612 KB Output is correct
62 Correct 26 ms 6616 KB Output is correct
63 Correct 21 ms 6720 KB Output is correct
64 Correct 29 ms 6612 KB Output is correct
65 Correct 12 ms 6652 KB Output is correct
66 Correct 23 ms 6584 KB Output is correct
67 Correct 23 ms 6604 KB Output is correct
68 Correct 20 ms 6596 KB Output is correct
69 Correct 22 ms 6600 KB Output is correct
70 Correct 20 ms 6764 KB Output is correct
71 Correct 21 ms 6820 KB Output is correct
72 Correct 20 ms 6764 KB Output is correct
73 Correct 17 ms 6684 KB Output is correct
74 Correct 16 ms 6760 KB Output is correct
75 Correct 16 ms 6740 KB Output is correct
76 Correct 35 ms 9284 KB Output is correct
77 Correct 32 ms 9612 KB Output is correct
78 Correct 41 ms 10024 KB Output is correct
79 Correct 22 ms 6608 KB Output is correct
80 Correct 28 ms 6608 KB Output is correct
81 Correct 23 ms 6612 KB Output is correct
82 Correct 22 ms 6624 KB Output is correct
83 Correct 28 ms 6612 KB Output is correct
84 Correct 23 ms 6820 KB Output is correct
85 Correct 23 ms 6816 KB Output is correct
86 Correct 23 ms 6812 KB Output is correct
87 Correct 23 ms 6816 KB Output is correct
88 Correct 23 ms 6812 KB Output is correct
89 Correct 24 ms 6860 KB Output is correct
90 Correct 47 ms 10312 KB Output is correct
91 Correct 51 ms 10316 KB Output is correct
92 Correct 49 ms 10316 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 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 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6580 KB Output is correct
10 Correct 22 ms 6584 KB Output is correct
11 Correct 22 ms 6612 KB Output is correct
12 Correct 20 ms 6604 KB Output is correct
13 Correct 21 ms 6584 KB Output is correct
14 Correct 25 ms 6588 KB Output is correct
15 Correct 23 ms 6624 KB Output is correct
16 Correct 26 ms 6616 KB Output is correct
17 Correct 22 ms 6624 KB Output is correct
18 Correct 21 ms 6620 KB Output is correct
19 Correct 20 ms 6612 KB Output is correct
20 Correct 21 ms 6624 KB Output is correct
21 Correct 21 ms 6636 KB Output is correct
22 Correct 21 ms 6640 KB Output is correct
23 Correct 21 ms 6628 KB Output is correct
24 Correct 42 ms 10572 KB Output is correct
25 Correct 39 ms 10496 KB Output is correct
26 Correct 40 ms 10500 KB Output is correct
27 Correct 696 ms 10284 KB Output is correct
28 Correct 735 ms 10304 KB Output is correct
29 Correct 879 ms 10096 KB Output is correct
30 Correct 706 ms 9976 KB Output is correct
31 Correct 790 ms 10080 KB Output is correct
32 Correct 786 ms 10060 KB Output is correct
33 Correct 831 ms 11336 KB Output is correct
34 Correct 768 ms 11308 KB Output is correct
35 Correct 843 ms 11300 KB Output is correct
36 Correct 824 ms 11204 KB Output is correct
37 Correct 922 ms 11252 KB Output is correct
38 Correct 826 ms 11228 KB Output is correct
39 Correct 784 ms 14036 KB Output is correct
40 Correct 726 ms 14172 KB Output is correct
41 Correct 759 ms 14064 KB Output is correct
42 Correct 3 ms 6484 KB Output is correct
43 Correct 3 ms 6484 KB Output is correct
44 Correct 3 ms 6484 KB Output is correct
45 Correct 14 ms 6580 KB Output is correct
46 Correct 15 ms 6612 KB Output is correct
47 Correct 13 ms 6584 KB Output is correct
48 Correct 15 ms 6612 KB Output is correct
49 Correct 19 ms 6580 KB Output is correct
50 Correct 16 ms 6612 KB Output is correct
51 Correct 20 ms 6612 KB Output is correct
52 Correct 25 ms 6604 KB Output is correct
53 Correct 13 ms 6656 KB Output is correct
54 Correct 16 ms 6616 KB Output is correct
55 Correct 15 ms 6676 KB Output is correct
56 Correct 14 ms 6612 KB Output is correct
57 Correct 14 ms 6612 KB Output is correct
58 Correct 18 ms 6632 KB Output is correct
59 Correct 15 ms 6612 KB Output is correct
60 Correct 19 ms 6612 KB Output is correct
61 Correct 14 ms 6600 KB Output is correct
62 Correct 20 ms 6592 KB Output is correct
63 Correct 21 ms 6612 KB Output is correct
64 Correct 21 ms 6588 KB Output is correct
65 Correct 24 ms 6592 KB Output is correct
66 Correct 25 ms 6596 KB Output is correct
67 Correct 20 ms 6612 KB Output is correct
68 Correct 23 ms 6624 KB Output is correct
69 Correct 21 ms 6616 KB Output is correct
70 Correct 22 ms 6620 KB Output is correct
71 Correct 26 ms 6612 KB Output is correct
72 Correct 22 ms 6624 KB Output is correct
73 Correct 23 ms 6628 KB Output is correct
74 Correct 21 ms 6632 KB Output is correct
75 Correct 21 ms 6616 KB Output is correct
76 Correct 21 ms 6612 KB Output is correct
77 Correct 26 ms 6616 KB Output is correct
78 Correct 21 ms 6720 KB Output is correct
79 Correct 29 ms 6612 KB Output is correct
80 Correct 12 ms 6652 KB Output is correct
81 Correct 23 ms 6584 KB Output is correct
82 Correct 23 ms 6604 KB Output is correct
83 Correct 20 ms 6596 KB Output is correct
84 Correct 22 ms 6600 KB Output is correct
85 Correct 20 ms 6764 KB Output is correct
86 Correct 21 ms 6820 KB Output is correct
87 Correct 20 ms 6764 KB Output is correct
88 Correct 17 ms 6684 KB Output is correct
89 Correct 16 ms 6760 KB Output is correct
90 Correct 16 ms 6740 KB Output is correct
91 Correct 35 ms 9284 KB Output is correct
92 Correct 32 ms 9612 KB Output is correct
93 Correct 41 ms 10024 KB Output is correct
94 Correct 22 ms 6608 KB Output is correct
95 Correct 28 ms 6608 KB Output is correct
96 Correct 23 ms 6612 KB Output is correct
97 Correct 22 ms 6624 KB Output is correct
98 Correct 28 ms 6612 KB Output is correct
99 Correct 23 ms 6820 KB Output is correct
100 Correct 23 ms 6816 KB Output is correct
101 Correct 23 ms 6812 KB Output is correct
102 Correct 23 ms 6816 KB Output is correct
103 Correct 23 ms 6812 KB Output is correct
104 Correct 24 ms 6860 KB Output is correct
105 Correct 47 ms 10312 KB Output is correct
106 Correct 51 ms 10316 KB Output is correct
107 Correct 49 ms 10316 KB Output is correct
108 Correct 739 ms 10336 KB Output is correct
109 Correct 592 ms 9276 KB Output is correct
110 Correct 477 ms 8708 KB Output is correct
111 Correct 432 ms 8536 KB Output is correct
112 Correct 649 ms 9248 KB Output is correct
113 Correct 477 ms 8576 KB Output is correct
114 Correct 424 ms 9884 KB Output is correct
115 Correct 379 ms 9544 KB Output is correct
116 Correct 707 ms 11332 KB Output is correct
117 Correct 503 ms 9852 KB Output is correct
118 Correct 463 ms 10100 KB Output is correct
119 Correct 541 ms 10304 KB Output is correct
120 Correct 509 ms 10932 KB Output is correct
121 Correct 491 ms 9388 KB Output is correct
122 Correct 454 ms 11264 KB Output is correct
123 Correct 405 ms 9032 KB Output is correct
124 Correct 744 ms 12788 KB Output is correct
125 Correct 703 ms 10688 KB Output is correct
126 Incorrect 581 ms 9836 KB Output isn't correct
127 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 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 3 ms 6484 KB Output is correct
8 Correct 3 ms 6484 KB Output is correct
9 Correct 24 ms 6580 KB Output is correct
10 Correct 22 ms 6584 KB Output is correct
11 Correct 22 ms 6612 KB Output is correct
12 Correct 20 ms 6604 KB Output is correct
13 Correct 21 ms 6584 KB Output is correct
14 Correct 25 ms 6588 KB Output is correct
15 Correct 23 ms 6624 KB Output is correct
16 Correct 26 ms 6616 KB Output is correct
17 Correct 22 ms 6624 KB Output is correct
18 Correct 21 ms 6620 KB Output is correct
19 Correct 20 ms 6612 KB Output is correct
20 Correct 21 ms 6624 KB Output is correct
21 Correct 21 ms 6636 KB Output is correct
22 Correct 21 ms 6640 KB Output is correct
23 Correct 21 ms 6628 KB Output is correct
24 Correct 42 ms 10572 KB Output is correct
25 Correct 39 ms 10496 KB Output is correct
26 Correct 40 ms 10500 KB Output is correct
27 Correct 696 ms 10284 KB Output is correct
28 Correct 735 ms 10304 KB Output is correct
29 Correct 879 ms 10096 KB Output is correct
30 Correct 706 ms 9976 KB Output is correct
31 Correct 790 ms 10080 KB Output is correct
32 Correct 786 ms 10060 KB Output is correct
33 Correct 831 ms 11336 KB Output is correct
34 Correct 768 ms 11308 KB Output is correct
35 Correct 843 ms 11300 KB Output is correct
36 Correct 824 ms 11204 KB Output is correct
37 Correct 922 ms 11252 KB Output is correct
38 Correct 826 ms 11228 KB Output is correct
39 Correct 784 ms 14036 KB Output is correct
40 Correct 726 ms 14172 KB Output is correct
41 Correct 759 ms 14064 KB Output is correct
42 Execution timed out 1586 ms 8072 KB Time limit exceeded
43 Halted 0 ms 0 KB -