oj.uz

답안 #676222

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676222 2022-12-29T21:49:40 Z Sam_a17 벽 칠하기 (APIO20_paint) C++17
28 / 100
 1247 ms 11220 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 = 1e5 + 100, 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 + 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 11 ms 3540 KB Output is correct
8 Correct 10 ms 3540 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 11 ms 3540 KB Output is correct
11 Correct 14 ms 3460 KB Output is correct
12 Correct 12 ms 3464 KB Output is correct
13 Correct 11 ms 3504 KB Output is correct
14 Correct 11 ms 3540 KB Output is correct
15 Correct 13 ms 3496 KB Output is correct
16 Correct 11 ms 3500 KB Output is correct
17 Correct 11 ms 3540 KB Output is correct
18 Correct 11 ms 3504 KB Output is correct
19 Correct 13 ms 3516 KB Output is correct
20 Correct 13 ms 3540 KB Output is correct
21 Correct 11 ms 3512 KB Output is correct
22 Correct 27 ms 7416 KB Output is correct
23 Correct 28 ms 7400 KB Output is correct
24 Correct 28 ms 7384 KB Output is correct
25 Correct 367 ms 7300 KB Output is correct
26 Correct 478 ms 7168 KB Output is correct
27 Correct 367 ms 7116 KB Output is correct
28 Correct 371 ms 6860 KB Output is correct
29 Correct 352 ms 6936 KB Output is correct
30 Correct 339 ms 6864 KB Output is correct
31 Correct 403 ms 8232 KB Output is correct
32 Correct 362 ms 8084 KB Output is correct
33 Correct 367 ms 8484 KB Output is correct
34 Correct 363 ms 8100 KB Output is correct
35 Correct 399 ms 8216 KB Output is correct
36 Correct 359 ms 8092 KB Output is correct
37 Correct 381 ms 10924 KB Output is correct
38 Correct 469 ms 10956 KB Output is correct
39 Correct 406 ms 11220 KB Output is correct
40 Runtime error 1247 ms 9880 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 11 ms 3540 KB Output is correct
8 Correct 10 ms 3540 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 11 ms 3540 KB Output is correct
11 Correct 14 ms 3460 KB Output is correct
12 Correct 12 ms 3464 KB Output is correct
13 Correct 11 ms 3504 KB Output is correct
14 Correct 11 ms 3540 KB Output is correct
15 Correct 13 ms 3496 KB Output is correct
16 Correct 11 ms 3500 KB Output is correct
17 Correct 11 ms 3540 KB Output is correct
18 Correct 11 ms 3504 KB Output is correct
19 Correct 13 ms 3516 KB Output is correct
20 Correct 13 ms 3540 KB Output is correct
21 Correct 11 ms 3512 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 2 ms 3412 KB Output is correct
24 Correct 2 ms 3412 KB Output is correct
25 Correct 2 ms 3412 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 6 ms 3412 KB Output is correct
28 Correct 8 ms 3456 KB Output is correct
29 Correct 6 ms 3412 KB Output is correct
30 Correct 8 ms 3456 KB Output is correct
31 Correct 9 ms 3540 KB Output is correct
32 Correct 8 ms 3412 KB Output is correct
33 Correct 9 ms 3540 KB Output is correct
34 Correct 10 ms 3540 KB Output is correct
35 Correct 8 ms 3480 KB Output is correct
36 Correct 9 ms 3492 KB Output is correct
37 Correct 10 ms 3540 KB Output is correct
38 Correct 7 ms 3492 KB Output is correct
39 Correct 7 ms 3412 KB Output is correct
40 Correct 8 ms 3540 KB Output is correct
41 Correct 7 ms 3480 KB Output is correct
42 Correct 9 ms 3540 KB Output is correct
43 Correct 10 ms 3480 KB Output is correct
44 Correct 11 ms 3540 KB Output is correct
45 Correct 10 ms 3540 KB Output is correct
46 Correct 11 ms 3464 KB Output is correct
47 Correct 13 ms 3428 KB Output is correct
48 Correct 13 ms 3540 KB Output is correct
49 Correct 11 ms 3456 KB Output is correct
50 Correct 13 ms 3504 KB Output is correct
51 Correct 11 ms 3540 KB Output is correct
52 Correct 11 ms 3508 KB Output is correct
53 Correct 11 ms 3540 KB Output is correct
54 Correct 11 ms 3508 KB Output is correct
55 Correct 10 ms 3504 KB Output is correct
56 Correct 11 ms 3516 KB Output is correct
57 Correct 11 ms 3540 KB Output is correct
58 Correct 10 ms 3520 KB Output is correct
59 Correct 11 ms 3540 KB Output is correct
60 Correct 11 ms 3524 KB Output is correct
61 Correct 10 ms 3540 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 10 ms 3540 KB Output is correct
11 Correct 11 ms 3540 KB Output is correct
12 Correct 11 ms 3540 KB Output is correct
13 Correct 14 ms 3460 KB Output is correct
14 Correct 12 ms 3464 KB Output is correct
15 Correct 11 ms 3504 KB Output is correct
16 Correct 11 ms 3540 KB Output is correct
17 Correct 13 ms 3496 KB Output is correct
18 Correct 11 ms 3500 KB Output is correct
19 Correct 11 ms 3540 KB Output is correct
20 Correct 11 ms 3504 KB Output is correct
21 Correct 13 ms 3516 KB Output is correct
22 Correct 13 ms 3540 KB Output is correct
23 Correct 11 ms 3512 KB Output is correct
24 Correct 27 ms 7416 KB Output is correct
25 Correct 28 ms 7400 KB Output is correct
26 Correct 28 ms 7384 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3412 KB Output is correct
29 Correct 2 ms 3412 KB Output is correct
30 Correct 6 ms 3412 KB Output is correct
31 Correct 8 ms 3456 KB Output is correct
32 Correct 6 ms 3412 KB Output is correct
33 Correct 8 ms 3456 KB Output is correct
34 Correct 9 ms 3540 KB Output is correct
35 Correct 8 ms 3412 KB Output is correct
36 Correct 9 ms 3540 KB Output is correct
37 Correct 10 ms 3540 KB Output is correct
38 Correct 8 ms 3480 KB Output is correct
39 Correct 9 ms 3492 KB Output is correct
40 Correct 10 ms 3540 KB Output is correct
41 Correct 7 ms 3492 KB Output is correct
42 Correct 7 ms 3412 KB Output is correct
43 Correct 8 ms 3540 KB Output is correct
44 Correct 7 ms 3480 KB Output is correct
45 Correct 9 ms 3540 KB Output is correct
46 Correct 10 ms 3480 KB Output is correct
47 Correct 11 ms 3540 KB Output is correct
48 Correct 10 ms 3540 KB Output is correct
49 Correct 11 ms 3464 KB Output is correct
50 Correct 13 ms 3428 KB Output is correct
51 Correct 13 ms 3540 KB Output is correct
52 Correct 11 ms 3456 KB Output is correct
53 Correct 13 ms 3504 KB Output is correct
54 Correct 11 ms 3540 KB Output is correct
55 Correct 11 ms 3508 KB Output is correct
56 Correct 11 ms 3540 KB Output is correct
57 Correct 11 ms 3508 KB Output is correct
58 Correct 10 ms 3504 KB Output is correct
59 Correct 11 ms 3516 KB Output is correct
60 Correct 11 ms 3540 KB Output is correct
61 Correct 10 ms 3520 KB Output is correct
62 Correct 11 ms 3540 KB Output is correct
63 Correct 11 ms 3524 KB Output is correct
64 Correct 10 ms 3540 KB Output is correct
65 Correct 7 ms 3412 KB Output is correct
66 Correct 10 ms 3540 KB Output is correct
67 Correct 11 ms 3476 KB Output is correct
68 Correct 12 ms 3476 KB Output is correct
69 Correct 12 ms 3476 KB Output is correct
70 Correct 12 ms 3640 KB Output is correct
71 Correct 14 ms 3640 KB Output is correct
72 Correct 11 ms 3640 KB Output is correct
73 Correct 9 ms 3540 KB Output is correct
74 Correct 9 ms 3668 KB Output is correct
75 Correct 12 ms 3628 KB Output is correct
76 Correct 25 ms 6120 KB Output is correct
77 Correct 24 ms 6548 KB Output is correct
78 Correct 30 ms 6900 KB Output is correct
79 Correct 12 ms 3540 KB Output is correct
80 Correct 12 ms 3488 KB Output is correct
81 Correct 12 ms 3540 KB Output is correct
82 Correct 14 ms 3488 KB Output is correct
83 Correct 16 ms 3488 KB Output is correct
84 Correct 12 ms 3668 KB Output is correct
85 Correct 12 ms 3796 KB Output is correct
86 Correct 12 ms 3688 KB Output is correct
87 Correct 13 ms 3756 KB Output is correct
88 Correct 13 ms 3668 KB Output is correct
89 Correct 13 ms 3668 KB Output is correct
90 Correct 36 ms 7244 KB Output is correct
91 Correct 37 ms 7244 KB Output is correct
92 Correct 36 ms 7272 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 10 ms 3540 KB Output is correct
11 Correct 11 ms 3540 KB Output is correct
12 Correct 11 ms 3540 KB Output is correct
13 Correct 14 ms 3460 KB Output is correct
14 Correct 12 ms 3464 KB Output is correct
15 Correct 11 ms 3504 KB Output is correct
16 Correct 11 ms 3540 KB Output is correct
17 Correct 13 ms 3496 KB Output is correct
18 Correct 11 ms 3500 KB Output is correct
19 Correct 11 ms 3540 KB Output is correct
20 Correct 11 ms 3504 KB Output is correct
21 Correct 13 ms 3516 KB Output is correct
22 Correct 13 ms 3540 KB Output is correct
23 Correct 11 ms 3512 KB Output is correct
24 Correct 27 ms 7416 KB Output is correct
25 Correct 28 ms 7400 KB Output is correct
26 Correct 28 ms 7384 KB Output is correct
27 Correct 367 ms 7300 KB Output is correct
28 Correct 478 ms 7168 KB Output is correct
29 Correct 367 ms 7116 KB Output is correct
30 Correct 371 ms 6860 KB Output is correct
31 Correct 352 ms 6936 KB Output is correct
32 Correct 339 ms 6864 KB Output is correct
33 Correct 403 ms 8232 KB Output is correct
34 Correct 362 ms 8084 KB Output is correct
35 Correct 367 ms 8484 KB Output is correct
36 Correct 363 ms 8100 KB Output is correct
37 Correct 399 ms 8216 KB Output is correct
38 Correct 359 ms 8092 KB Output is correct
39 Correct 381 ms 10924 KB Output is correct
40 Correct 469 ms 10956 KB Output is correct
41 Correct 406 ms 11220 KB Output is correct
42 Correct 2 ms 3412 KB Output is correct
43 Correct 2 ms 3412 KB Output is correct
44 Correct 2 ms 3412 KB Output is correct
45 Correct 6 ms 3412 KB Output is correct
46 Correct 8 ms 3456 KB Output is correct
47 Correct 6 ms 3412 KB Output is correct
48 Correct 8 ms 3456 KB Output is correct
49 Correct 9 ms 3540 KB Output is correct
50 Correct 8 ms 3412 KB Output is correct
51 Correct 9 ms 3540 KB Output is correct
52 Correct 10 ms 3540 KB Output is correct
53 Correct 8 ms 3480 KB Output is correct
54 Correct 9 ms 3492 KB Output is correct
55 Correct 10 ms 3540 KB Output is correct
56 Correct 7 ms 3492 KB Output is correct
57 Correct 7 ms 3412 KB Output is correct
58 Correct 8 ms 3540 KB Output is correct
59 Correct 7 ms 3480 KB Output is correct
60 Correct 9 ms 3540 KB Output is correct
61 Correct 10 ms 3480 KB Output is correct
62 Correct 11 ms 3540 KB Output is correct
63 Correct 10 ms 3540 KB Output is correct
64 Correct 11 ms 3464 KB Output is correct
65 Correct 13 ms 3428 KB Output is correct
66 Correct 13 ms 3540 KB Output is correct
67 Correct 11 ms 3456 KB Output is correct
68 Correct 13 ms 3504 KB Output is correct
69 Correct 11 ms 3540 KB Output is correct
70 Correct 11 ms 3508 KB Output is correct
71 Correct 11 ms 3540 KB Output is correct
72 Correct 11 ms 3508 KB Output is correct
73 Correct 10 ms 3504 KB Output is correct
74 Correct 11 ms 3516 KB Output is correct
75 Correct 11 ms 3540 KB Output is correct
76 Correct 10 ms 3520 KB Output is correct
77 Correct 11 ms 3540 KB Output is correct
78 Correct 11 ms 3524 KB Output is correct
79 Correct 10 ms 3540 KB Output is correct
80 Correct 7 ms 3412 KB Output is correct
81 Correct 10 ms 3540 KB Output is correct
82 Correct 11 ms 3476 KB Output is correct
83 Correct 12 ms 3476 KB Output is correct
84 Correct 12 ms 3476 KB Output is correct
85 Correct 12 ms 3640 KB Output is correct
86 Correct 14 ms 3640 KB Output is correct
87 Correct 11 ms 3640 KB Output is correct
88 Correct 9 ms 3540 KB Output is correct
89 Correct 9 ms 3668 KB Output is correct
90 Correct 12 ms 3628 KB Output is correct
91 Correct 25 ms 6120 KB Output is correct
92 Correct 24 ms 6548 KB Output is correct
93 Correct 30 ms 6900 KB Output is correct
94 Correct 12 ms 3540 KB Output is correct
95 Correct 12 ms 3488 KB Output is correct
96 Correct 12 ms 3540 KB Output is correct
97 Correct 14 ms 3488 KB Output is correct
98 Correct 16 ms 3488 KB Output is correct
99 Correct 12 ms 3668 KB Output is correct
100 Correct 12 ms 3796 KB Output is correct
101 Correct 12 ms 3688 KB Output is correct
102 Correct 13 ms 3756 KB Output is correct
103 Correct 13 ms 3668 KB Output is correct
104 Correct 13 ms 3668 KB Output is correct
105 Correct 36 ms 7244 KB Output is correct
106 Correct 37 ms 7244 KB Output is correct
107 Correct 36 ms 7272 KB Output is correct
108 Correct 355 ms 7268 KB Output is correct
109 Correct 349 ms 6256 KB Output is correct
110 Correct 283 ms 5664 KB Output is correct
111 Correct 266 ms 5456 KB Output is correct
112 Correct 314 ms 6188 KB Output is correct
113 Correct 252 ms 5336 KB Output is correct
114 Correct 210 ms 6636 KB Output is correct
115 Correct 243 ms 6304 KB Output is correct
116 Correct 410 ms 8116 KB Output is correct
117 Correct 272 ms 6604 KB Output is correct
118 Correct 313 ms 7036 KB Output is correct
119 Correct 266 ms 6944 KB Output is correct
120 Correct 235 ms 7728 KB Output is correct
121 Correct 256 ms 6200 KB Output is correct
122 Correct 218 ms 7852 KB Output is correct
123 Correct 226 ms 5980 KB Output is correct
124 Correct 395 ms 9660 KB Output is correct
125 Correct 390 ms 7424 KB Output is correct
126 Incorrect 294 ms 6732 KB Output isn't correct
127 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 11 ms 3540 KB Output is correct
10 Correct 10 ms 3540 KB Output is correct
11 Correct 11 ms 3540 KB Output is correct
12 Correct 11 ms 3540 KB Output is correct
13 Correct 14 ms 3460 KB Output is correct
14 Correct 12 ms 3464 KB Output is correct
15 Correct 11 ms 3504 KB Output is correct
16 Correct 11 ms 3540 KB Output is correct
17 Correct 13 ms 3496 KB Output is correct
18 Correct 11 ms 3500 KB Output is correct
19 Correct 11 ms 3540 KB Output is correct
20 Correct 11 ms 3504 KB Output is correct
21 Correct 13 ms 3516 KB Output is correct
22 Correct 13 ms 3540 KB Output is correct
23 Correct 11 ms 3512 KB Output is correct
24 Correct 27 ms 7416 KB Output is correct
25 Correct 28 ms 7400 KB Output is correct
26 Correct 28 ms 7384 KB Output is correct
27 Correct 367 ms 7300 KB Output is correct
28 Correct 478 ms 7168 KB Output is correct
29 Correct 367 ms 7116 KB Output is correct
30 Correct 371 ms 6860 KB Output is correct
31 Correct 352 ms 6936 KB Output is correct
32 Correct 339 ms 6864 KB Output is correct
33 Correct 403 ms 8232 KB Output is correct
34 Correct 362 ms 8084 KB Output is correct
35 Correct 367 ms 8484 KB Output is correct
36 Correct 363 ms 8100 KB Output is correct
37 Correct 399 ms 8216 KB Output is correct
38 Correct 359 ms 8092 KB Output is correct
39 Correct 381 ms 10924 KB Output is correct
40 Correct 469 ms 10956 KB Output is correct
41 Correct 406 ms 11220 KB Output is correct
42 Runtime error 1247 ms 9880 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -