답안 #473933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473933	2021-09-16T12:29:44 Z	model_code	L-triominoes (CEOI21_ltriominoes)	C++17	100 / 100	1728 ms	3712 KB

ltrominoes

#include <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <cstring>
#include <iostream>
#include <cmath>
#include <string>

#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define TRACE(x) cerr << #x << " = " << x << endl
#define _ << " _ " <<
#define X first
#define Y second

using namespace std;

typedef pair<int, int> P;
typedef long long ll;

const int M = 13, MAX = 13;
int W, H;
int zero_one, one_zero;

void print_mask(int msk) {
  REP(i, W) {
    if (msk >> i & 1) printf("X");
    else printf(".");
  }
}

namespace brute {
  int brute_h;
  bool vis[M+2][MAX+1][1<<(MAX+1)];

  bool has(int msk, int pos) { return (msk >> pos) & 1; }

  void rek(int row, int col, int msk) {
    if (vis[row][col][msk]) return;
    vis[row][col][msk] = true;
    if (row == brute_h) return;

    if (col == W) {
      assert(!has(msk, W));
      rek(row+1, 0, msk);
      return;
    }

    if (msk & 1) rek(row, col+1, msk>>1);
    else {
      //up and up-left
      if (col && !has(msk, W) && !has(msk, W-1)) {
        int nmask = (msk | (1<<W) | (1<<(W-1))) >> 1;
        rek(row, col+1, nmask);
      }

      //up and up-right
      if (col != W-1 && !has(msk, W)) {
        int nmask = ((msk | (1<<W)) | (1<<(W+1))) >> 1;
        rek(row, col+1, nmask);
      }

      //right and up-right
      if (col != W-1 && !has(msk, 1)) {
        int nmask = (msk | (1<<(W+1)) | (1<<1)) >> 1;
        rek(row, col+1, nmask);
      }

      //up and right
      if (col != W-1 && !has(msk, W) && !has(msk, 1)) {
        int nmask = (msk | (1<<W) | (1<<1)) >> 1;
        rek(row, col+1, nmask);
      }
    }
  }

  vector <bool> reaches(const vector <bool> &V, int len) {
    assert(len >= 0 && len <= M);
    if (len == 0) return V;

    brute_h = len;
    memset(vis, 0, sizeof vis);

    REP(i, 1<<W)
      if (V[i])
        rek(0, 0, i);

    vector <bool> R((1<<W), false);
    REP(i, 1<<W)
      R[i] = vis[len][0][i];

    return R;
  }
}

vector <bool> reaches_single(int a, int len) {
  assert(len >= M);
  vector <bool> R(1<<W);

  if (W % 2 && a == zero_one) return R;

  if (W == 3) {
    int pc = __builtin_popcount(a);
    if (pc == 1) {
      R[zero_one] = true;
      if (len % 2) R[5 ^ a] = true;
      else R[a] = true;
    }
    else if (pc == 2) {
      if (a == one_zero) R[3] = R[6] = true;
      else if (len % 2) R[9-a] = true;
      else R[a] = true;
    }
    else {
      if (len % 2) R[7 ^ a] = true;
      else R[a] = true;
    }

    return R;
  }

  int pc = __builtin_popcount(a);
  len %= 3;
  REP(i, 1<<W)
    if (W % 2 == 0 || i != one_zero)
      R[i] = ((pc - len * W - __builtin_popcount(i)) % 3 == 0);

  return R;
}

vector <bool> reaches(const vector <bool> &V, int len) {
  if (len < M)
    return brute::reaches(V, len);

  vector <bool> R(1<<W);

  if (W <= 3) {
    REP(i, 1<<W)  {
      if (V[i]) {
        vector <bool> T = reaches_single(i, len);
        REP(j, 1<<W)
          R[j] = R[j] | T[j];
      }
    }
    return R;
  }

  bool has[3] = {false};
  REP(i, 1<<W) {
    if (V[i]) {
      if (i == zero_one && (W % 2)) continue;
      int pc = __builtin_popcount(i) % 3;
      if (has[pc]) continue;
      has[pc] = true;
      auto T = reaches_single(i, len);
      REP(j, 1<<W)
        R[j] = R[j] | T[j];
    }
  }

  return R;
}

vector <P> Mask_rows;
void load() {
  int k;
  scanf("%d%d%d", &W, &H, &k);
  vector <P> Tiles(k);

  REP(i, k) {
    int a, b;
    scanf("%d%d", &a, &b);
    Tiles[i] = P(b-1, a-1);
  }

  sort(Tiles.begin(), Tiles.end());

  for (int i=0; i<k; ) {
    int msk = 0, j = i;
    for (; j<k && Tiles[i].X == Tiles[j].X; j++)
      msk |= 1<<Tiles[j].Y;

    Mask_rows.push_back(P(Tiles[i].X, msk));
    i=j;
  }

  Mask_rows.push_back(P(H, (1<<W) - 1));
}

int main()
{
  load();

  REP(i, W) {
    if (i & 1) zero_one |= 1<<i;
    else one_zero |= 1<<i;
  }

  vector <bool> Curr_masks(1<<W, false);
  Curr_masks[0] = true;
  int prev=0;

  for (auto msk_row : Mask_rows) {
    int len = msk_row.X - prev;
    vector <bool> T = reaches(Curr_masks, len);
    vector <bool> Nxt(1<<W, false);

    REP(i, 1<<W)
      if (T[i] && !(i & msk_row.Y))
        Nxt[i | msk_row.Y] = true;

    Curr_masks = Nxt;
    prev = msk_row.X;
  }

  if (Curr_masks[(1<<W)-1]) printf("YES\n");
  else printf("NO\n");

  return 0;
}

Compilation message

ltrominoes.cpp: In function 'void load()':
ltrominoes.cpp:168:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  168 |   scanf("%d%d%d", &W, &H, &k);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
ltrominoes.cpp:173:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |     scanf("%d%d", &a, &b);
      |     ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	3 ms	3544 KB	Output is correct
3	Correct	0 ms	216 KB	Output is correct
4	Correct	23 ms	3540 KB	Output is correct
5	Correct	18 ms	3656 KB	Output is correct
6	Correct	28 ms	3660 KB	Output is correct
7	Correct	3 ms	3660 KB	Output is correct
8	Correct	0 ms	216 KB	Output is correct
9	Correct	3 ms	3672 KB	Output is correct
10	Correct	2 ms	3672 KB	Output is correct
11	Correct	1 ms	216 KB	Output is correct
12	Correct	2 ms	3544 KB	Output is correct
13	Correct	3 ms	3544 KB	Output is correct
14	Correct	3 ms	3544 KB	Output is correct
15	Correct	9 ms	3672 KB	Output is correct
16	Correct	592 ms	3672 KB	Output is correct
17	Correct	16 ms	3672 KB	Output is correct
18	Correct	232 ms	3644 KB	Output is correct
19	Correct	30 ms	3532 KB	Output is correct
20	Correct	322 ms	3660 KB	Output is correct
21	Correct	156 ms	3544 KB	Output is correct
22	Correct	5 ms	3540 KB	Output is correct
23	Correct	30 ms	3660 KB	Output is correct
24	Correct	4 ms	3660 KB	Output is correct
25	Correct	62 ms	3660 KB	Output is correct
26	Correct	235 ms	3660 KB	Output is correct
27	Correct	8 ms	3532 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	2 ms	3532 KB	Output is correct
3	Correct	2 ms	3660 KB	Output is correct
4	Correct	2 ms	3660 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	216 KB	Output is correct
9	Correct	1 ms	216 KB	Output is correct
10	Correct	1 ms	216 KB	Output is correct
11	Correct	0 ms	216 KB	Output is correct
12	Correct	0 ms	216 KB	Output is correct
13	Correct	1 ms	216 KB	Output is correct
14	Correct	0 ms	216 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	2 ms	3660 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	216 KB	Output is correct
6	Correct	0 ms	216 KB	Output is correct
7	Correct	0 ms	216 KB	Output is correct
8	Correct	1 ms	216 KB	Output is correct
9	Correct	0 ms	216 KB	Output is correct
10	Correct	0 ms	216 KB	Output is correct
11	Correct	1 ms	216 KB	Output is correct
12	Correct	1 ms	216 KB	Output is correct
13	Correct	1 ms	216 KB	Output is correct
14	Correct	1 ms	216 KB	Output is correct
15	Correct	1 ms	216 KB	Output is correct
16	Correct	0 ms	216 KB	Output is correct
17	Correct	1 ms	216 KB	Output is correct
18	Correct	1 ms	216 KB	Output is correct
19	Correct	1 ms	216 KB	Output is correct
20	Correct	1 ms	216 KB	Output is correct
21	Correct	1 ms	216 KB	Output is correct
22	Correct	0 ms	216 KB	Output is correct
23	Correct	0 ms	216 KB	Output is correct
24	Correct	0 ms	216 KB	Output is correct
25	Correct	1 ms	216 KB	Output is correct
26	Correct	1 ms	216 KB	Output is correct
27	Correct	1 ms	216 KB	Output is correct
28	Correct	0 ms	216 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	0 ms	216 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	204 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	208 KB	Output is correct
46	Correct	25 ms	3672 KB	Output is correct
47	Correct	32 ms	3672 KB	Output is correct
48	Correct	25 ms	3660 KB	Output is correct
49	Correct	33 ms	3668 KB	Output is correct

Subtask #4
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	3660 KB	Output is correct
2	Correct	9 ms	3660 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	3 ms	3532 KB	Output is correct
8	Correct	3 ms	3576 KB	Output is correct
9	Correct	3 ms	3660 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	216 KB	Output is correct
13	Correct	1 ms	216 KB	Output is correct
14	Correct	4 ms	3672 KB	Output is correct
15	Correct	3 ms	3672 KB	Output is correct
16	Correct	4 ms	3672 KB	Output is correct
17	Correct	3 ms	3660 KB	Output is correct
18	Correct	3 ms	3660 KB	Output is correct
19	Correct	11 ms	3660 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	4 ms	3660 KB	Output is correct
25	Correct	10 ms	3660 KB	Output is correct
26	Correct	9 ms	3668 KB	Output is correct
27	Correct	3 ms	3660 KB	Output is correct
28	Correct	5 ms	3660 KB	Output is correct
29	Correct	7 ms	3660 KB	Output is correct
30	Correct	3 ms	3660 KB	Output is correct
31	Correct	3 ms	3672 KB	Output is correct
32	Correct	3 ms	3672 KB	Output is correct
33	Correct	3 ms	3672 KB	Output is correct
34	Correct	29 ms	3672 KB	Output is correct
35	Correct	26 ms	3672 KB	Output is correct
36	Correct	32 ms	3672 KB	Output is correct
37	Correct	41 ms	3672 KB	Output is correct

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	3544 KB	Output is correct
2	Correct	4 ms	3672 KB	Output is correct
3	Correct	1 ms	216 KB	Output is correct
4	Correct	7 ms	208 KB	Output is correct
5	Correct	7 ms	3660 KB	Output is correct
6	Correct	8 ms	3660 KB	Output is correct
7	Correct	9 ms	3636 KB	Output is correct
8	Correct	10 ms	3660 KB	Output is correct
9	Correct	13 ms	3620 KB	Output is correct
10	Correct	15 ms	3660 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	4 ms	3652 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	10 ms	3660 KB	Output is correct
15	Correct	5 ms	3660 KB	Output is correct
16	Correct	4 ms	3660 KB	Output is correct
17	Correct	10 ms	3660 KB	Output is correct
18	Correct	7 ms	3660 KB	Output is correct
19	Correct	6 ms	3660 KB	Output is correct
20	Correct	10 ms	204 KB	Output is correct
21	Correct	8 ms	3660 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	3 ms	256 KB	Output is correct
24	Correct	29 ms	204 KB	Output is correct
25	Correct	19 ms	204 KB	Output is correct
26	Correct	29 ms	204 KB	Output is correct
27	Correct	29 ms	204 KB	Output is correct
28	Correct	31 ms	3660 KB	Output is correct
29	Correct	29 ms	3640 KB	Output is correct
30	Correct	164 ms	3668 KB	Output is correct
31	Correct	10 ms	3660 KB	Output is correct
32	Correct	34 ms	3664 KB	Output is correct
33	Correct	13 ms	216 KB	Output is correct
34	Correct	19 ms	216 KB	Output is correct
35	Correct	29 ms	216 KB	Output is correct
36	Correct	30 ms	284 KB	Output is correct
37	Correct	13 ms	3660 KB	Output is correct
38	Correct	36 ms	3664 KB	Output is correct
39	Correct	12 ms	3672 KB	Output is correct
40	Correct	36 ms	3640 KB	Output is correct
41	Correct	18 ms	3668 KB	Output is correct
42	Correct	25 ms	3660 KB	Output is correct
43	Correct	158 ms	3668 KB	Output is correct
44	Correct	30 ms	3672 KB	Output is correct
45	Correct	27 ms	212 KB	Output is correct
46	Correct	15 ms	3660 KB	Output is correct
47	Correct	1717 ms	3664 KB	Output is correct
48	Correct	1394 ms	3660 KB	Output is correct
49	Correct	395 ms	3712 KB	Output is correct
50	Correct	195 ms	3664 KB	Output is correct

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	3 ms	3544 KB	Output is correct
3	Correct	0 ms	216 KB	Output is correct
4	Correct	23 ms	3540 KB	Output is correct
5	Correct	18 ms	3656 KB	Output is correct
6	Correct	28 ms	3660 KB	Output is correct
7	Correct	3 ms	3660 KB	Output is correct
8	Correct	0 ms	216 KB	Output is correct
9	Correct	3 ms	3672 KB	Output is correct
10	Correct	2 ms	3672 KB	Output is correct
11	Correct	1 ms	216 KB	Output is correct
12	Correct	2 ms	3544 KB	Output is correct
13	Correct	3 ms	3544 KB	Output is correct
14	Correct	3 ms	3544 KB	Output is correct
15	Correct	9 ms	3672 KB	Output is correct
16	Correct	592 ms	3672 KB	Output is correct
17	Correct	16 ms	3672 KB	Output is correct
18	Correct	232 ms	3644 KB	Output is correct
19	Correct	30 ms	3532 KB	Output is correct
20	Correct	322 ms	3660 KB	Output is correct
21	Correct	156 ms	3544 KB	Output is correct
22	Correct	5 ms	3540 KB	Output is correct
23	Correct	30 ms	3660 KB	Output is correct
24	Correct	4 ms	3660 KB	Output is correct
25	Correct	62 ms	3660 KB	Output is correct
26	Correct	235 ms	3660 KB	Output is correct
27	Correct	8 ms	3532 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	2 ms	3532 KB	Output is correct
30	Correct	2 ms	3660 KB	Output is correct
31	Correct	2 ms	3660 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	0 ms	204 KB	Output is correct
35	Correct	1 ms	216 KB	Output is correct
36	Correct	1 ms	216 KB	Output is correct
37	Correct	1 ms	216 KB	Output is correct
38	Correct	0 ms	216 KB	Output is correct
39	Correct	0 ms	216 KB	Output is correct
40	Correct	1 ms	216 KB	Output is correct
41	Correct	0 ms	216 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	0 ms	204 KB	Output is correct
44	Correct	0 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	1 ms	204 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	2 ms	3660 KB	Output is correct
50	Correct	0 ms	204 KB	Output is correct
51	Correct	0 ms	204 KB	Output is correct
52	Correct	0 ms	204 KB	Output is correct
53	Correct	0 ms	204 KB	Output is correct
54	Correct	0 ms	204 KB	Output is correct
55	Correct	0 ms	212 KB	Output is correct
56	Correct	0 ms	216 KB	Output is correct
57	Correct	0 ms	216 KB	Output is correct
58	Correct	0 ms	216 KB	Output is correct
59	Correct	1 ms	216 KB	Output is correct
60	Correct	0 ms	216 KB	Output is correct
61	Correct	0 ms	216 KB	Output is correct
62	Correct	1 ms	216 KB	Output is correct
63	Correct	1 ms	216 KB	Output is correct
64	Correct	1 ms	216 KB	Output is correct
65	Correct	1 ms	216 KB	Output is correct
66	Correct	1 ms	216 KB	Output is correct
67	Correct	0 ms	216 KB	Output is correct
68	Correct	1 ms	216 KB	Output is correct
69	Correct	1 ms	216 KB	Output is correct
70	Correct	1 ms	216 KB	Output is correct
71	Correct	1 ms	216 KB	Output is correct
72	Correct	1 ms	216 KB	Output is correct
73	Correct	0 ms	216 KB	Output is correct
74	Correct	0 ms	216 KB	Output is correct
75	Correct	0 ms	216 KB	Output is correct
76	Correct	1 ms	216 KB	Output is correct
77	Correct	1 ms	216 KB	Output is correct
78	Correct	1 ms	216 KB	Output is correct
79	Correct	0 ms	216 KB	Output is correct
80	Correct	1 ms	204 KB	Output is correct
81	Correct	1 ms	204 KB	Output is correct
82	Correct	1 ms	204 KB	Output is correct
83	Correct	1 ms	204 KB	Output is correct
84	Correct	1 ms	204 KB	Output is correct
85	Correct	1 ms	204 KB	Output is correct
86	Correct	1 ms	208 KB	Output is correct
87	Correct	0 ms	216 KB	Output is correct
88	Correct	1 ms	212 KB	Output is correct
89	Correct	1 ms	204 KB	Output is correct
90	Correct	1 ms	204 KB	Output is correct
91	Correct	1 ms	204 KB	Output is correct
92	Correct	1 ms	204 KB	Output is correct
93	Correct	1 ms	204 KB	Output is correct
94	Correct	1 ms	204 KB	Output is correct
95	Correct	1 ms	204 KB	Output is correct
96	Correct	1 ms	208 KB	Output is correct
97	Correct	25 ms	3672 KB	Output is correct
98	Correct	32 ms	3672 KB	Output is correct
99	Correct	25 ms	3660 KB	Output is correct
100	Correct	33 ms	3668 KB	Output is correct
101	Correct	10 ms	3660 KB	Output is correct
102	Correct	9 ms	3660 KB	Output is correct
103	Correct	1 ms	204 KB	Output is correct
104	Correct	0 ms	204 KB	Output is correct
105	Correct	1 ms	204 KB	Output is correct
106	Correct	1 ms	204 KB	Output is correct
107	Correct	3 ms	3532 KB	Output is correct
108	Correct	3 ms	3576 KB	Output is correct
109	Correct	3 ms	3660 KB	Output is correct
110	Correct	1 ms	204 KB	Output is correct
111	Correct	1 ms	212 KB	Output is correct
112	Correct	1 ms	216 KB	Output is correct
113	Correct	1 ms	216 KB	Output is correct
114	Correct	4 ms	3672 KB	Output is correct
115	Correct	3 ms	3672 KB	Output is correct
116	Correct	4 ms	3672 KB	Output is correct
117	Correct	3 ms	3660 KB	Output is correct
118	Correct	3 ms	3660 KB	Output is correct
119	Correct	11 ms	3660 KB	Output is correct
120	Correct	1 ms	204 KB	Output is correct
121	Correct	1 ms	204 KB	Output is correct
122	Correct	1 ms	204 KB	Output is correct
123	Correct	1 ms	204 KB	Output is correct
124	Correct	4 ms	3660 KB	Output is correct
125	Correct	10 ms	3660 KB	Output is correct
126	Correct	9 ms	3668 KB	Output is correct
127	Correct	3 ms	3660 KB	Output is correct
128	Correct	5 ms	3660 KB	Output is correct
129	Correct	7 ms	3660 KB	Output is correct
130	Correct	3 ms	3660 KB	Output is correct
131	Correct	3 ms	3672 KB	Output is correct
132	Correct	3 ms	3672 KB	Output is correct
133	Correct	3 ms	3672 KB	Output is correct
134	Correct	29 ms	3672 KB	Output is correct
135	Correct	26 ms	3672 KB	Output is correct
136	Correct	32 ms	3672 KB	Output is correct
137	Correct	41 ms	3672 KB	Output is correct
138	Correct	5 ms	3544 KB	Output is correct
139	Correct	4 ms	3672 KB	Output is correct
140	Correct	1 ms	216 KB	Output is correct
141	Correct	7 ms	208 KB	Output is correct
142	Correct	7 ms	3660 KB	Output is correct
143	Correct	8 ms	3660 KB	Output is correct
144	Correct	9 ms	3636 KB	Output is correct
145	Correct	10 ms	3660 KB	Output is correct
146	Correct	13 ms	3620 KB	Output is correct
147	Correct	15 ms	3660 KB	Output is correct
148	Correct	1 ms	204 KB	Output is correct
149	Correct	4 ms	3652 KB	Output is correct
150	Correct	1 ms	204 KB	Output is correct
151	Correct	10 ms	3660 KB	Output is correct
152	Correct	5 ms	3660 KB	Output is correct
153	Correct	4 ms	3660 KB	Output is correct
154	Correct	10 ms	3660 KB	Output is correct
155	Correct	7 ms	3660 KB	Output is correct
156	Correct	6 ms	3660 KB	Output is correct
157	Correct	10 ms	204 KB	Output is correct
158	Correct	8 ms	3660 KB	Output is correct
159	Correct	1 ms	204 KB	Output is correct
160	Correct	3 ms	256 KB	Output is correct
161	Correct	29 ms	204 KB	Output is correct
162	Correct	19 ms	204 KB	Output is correct
163	Correct	29 ms	204 KB	Output is correct
164	Correct	29 ms	204 KB	Output is correct
165	Correct	31 ms	3660 KB	Output is correct
166	Correct	29 ms	3640 KB	Output is correct
167	Correct	164 ms	3668 KB	Output is correct
168	Correct	10 ms	3660 KB	Output is correct
169	Correct	34 ms	3664 KB	Output is correct
170	Correct	13 ms	216 KB	Output is correct
171	Correct	19 ms	216 KB	Output is correct
172	Correct	29 ms	216 KB	Output is correct
173	Correct	30 ms	284 KB	Output is correct
174	Correct	13 ms	3660 KB	Output is correct
175	Correct	36 ms	3664 KB	Output is correct
176	Correct	12 ms	3672 KB	Output is correct
177	Correct	36 ms	3640 KB	Output is correct
178	Correct	18 ms	3668 KB	Output is correct
179	Correct	25 ms	3660 KB	Output is correct
180	Correct	158 ms	3668 KB	Output is correct
181	Correct	30 ms	3672 KB	Output is correct
182	Correct	27 ms	212 KB	Output is correct
183	Correct	15 ms	3660 KB	Output is correct
184	Correct	1717 ms	3664 KB	Output is correct
185	Correct	1394 ms	3660 KB	Output is correct
186	Correct	395 ms	3712 KB	Output is correct
187	Correct	195 ms	3664 KB	Output is correct
188	Correct	20 ms	316 KB	Output is correct
189	Correct	1 ms	204 KB	Output is correct
190	Correct	1 ms	216 KB	Output is correct
191	Correct	0 ms	204 KB	Output is correct
192	Correct	1 ms	208 KB	Output is correct
193	Correct	5 ms	3532 KB	Output is correct
194	Correct	1 ms	204 KB	Output is correct
195	Correct	1 ms	204 KB	Output is correct
196	Correct	1 ms	212 KB	Output is correct
197	Correct	1 ms	208 KB	Output is correct
198	Correct	1 ms	204 KB	Output is correct
199	Correct	8 ms	3664 KB	Output is correct
200	Correct	1 ms	204 KB	Output is correct
201	Correct	9 ms	3672 KB	Output is correct
202	Correct	14 ms	3664 KB	Output is correct
203	Correct	1 ms	216 KB	Output is correct
204	Correct	1 ms	208 KB	Output is correct
205	Correct	1 ms	212 KB	Output is correct
206	Correct	3 ms	3668 KB	Output is correct
207	Correct	1 ms	208 KB	Output is correct
208	Correct	806 ms	3656 KB	Output is correct
209	Correct	861 ms	3664 KB	Output is correct
210	Correct	5 ms	3664 KB	Output is correct
211	Correct	10 ms	3672 KB	Output is correct
212	Correct	11 ms	308 KB	Output is correct
213	Correct	1 ms	208 KB	Output is correct
214	Correct	2 ms	212 KB	Output is correct
215	Correct	1 ms	208 KB	Output is correct
216	Correct	30 ms	212 KB	Output is correct
217	Correct	29 ms	204 KB	Output is correct
218	Correct	1 ms	208 KB	Output is correct
219	Correct	1 ms	208 KB	Output is correct
220	Correct	1 ms	212 KB	Output is correct
221	Correct	1 ms	212 KB	Output is correct
222	Correct	1 ms	208 KB	Output is correct
223	Correct	3 ms	3676 KB	Output is correct
224	Correct	1728 ms	3660 KB	Output is correct
225	Correct	1 ms	204 KB	Output is correct
226	Correct	3 ms	3672 KB	Output is correct
227	Correct	3 ms	3660 KB	Output is correct
228	Correct	25 ms	3628 KB	Output is correct
229	Correct	11 ms	3668 KB	Output is correct
230	Correct	24 ms	304 KB	Output is correct
231	Correct	30 ms	216 KB	Output is correct
232	Correct	1 ms	208 KB	Output is correct
233	Correct	1 ms	212 KB	Output is correct
234	Correct	33 ms	212 KB	Output is correct
235	Correct	1 ms	212 KB	Output is correct
236	Correct	27 ms	3568 KB	Output is correct
237	Correct	10 ms	3668 KB	Output is correct
238	Correct	3 ms	3664 KB	Output is correct
239	Correct	18 ms	3664 KB	Output is correct
240	Correct	25 ms	3660 KB	Output is correct
241	Correct	4 ms	3660 KB	Output is correct
242	Correct	3 ms	3668 KB	Output is correct
243	Correct	3 ms	3664 KB	Output is correct
244	Correct	3 ms	3540 KB	Output is correct
245	Correct	11 ms	3664 KB	Output is correct

답안 #473933

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 7.0 / 7.0

Subtask #3 11.0 / 11.0

Subtask #4 17.0 / 17.0

Subtask #5 35.0 / 35.0

Subtask #6 20.0 / 20.0

Subtask #1
10.0 / 10.0

Subtask #2
7.0 / 7.0

Subtask #3
11.0 / 11.0

Subtask #4
17.0 / 17.0

Subtask #5
35.0 / 35.0

Subtask #6
20.0 / 20.0