oj.uz

답안 #1085606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085606 2024-09-08T13:18:12 Z I_am_Polish_Girl Maze (JOI23_ho_t3) C++14
8 / 100
 659 ms 273748 KB 
#pragma target("arch=icelake-server")

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack> 
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <bitset>

using namespace std;


typedef long long ll;
typedef long double ld;

int log_ = 21;
int inf = 1000000007;

long long mod = 998244353;

int p = 499;

int NADIYA = 39;

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int n, m, k;
	cin >> n >> m >> k;

	int i_st, j_st;
	cin >> i_st >> j_st;

	i_st--;
	j_st--;

	int i_f, j_f;
	cin >> i_f >> j_f;

	i_f--;
	j_f--;


	vector <int> deep;
	
	
	vector <string> vs(n);
	for (int i = 0; i < n; i++)
		cin >> vs[i];
	

	int X = 2;
	int c = 1;

	int sz = 0;

	int K = 2 * k - 1;

	
	while (c * X <= K)
	{
		c *= X;
		sz++;
	}

	sz++;

	vector <vector <vector<int>>> bin(n);

	vector <vector <int>> g(n*m*(2*sz));


	for (int i = 0; i < n; i++)
	{
		bin[i].resize(m);
		for (int j = 0; j < m; j++)
		{
			bin[i][j].resize(sz);
		}
	}

	int f = 0;

	vector <pair <int, int>> vp(n * m);


	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			bin[i][j][0] = f;
			
			vp[f] = { i , j };

			f++;
		}
	}

	int f2 = f;

	int y = 1;
	for (int k_ = 1; k_ < sz; k_ ++)
	{
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				bin[i][j][k_] = f;
				
				g[f].resize(X);

				for (int x = 0; x < X; x++)
				{
					g[f][x] = bin[i][min(j + y * x, m - 1)][k_ - 1];
				}
				
				f++;
			}
		}

		y *= X;
	}


	y /= X;



	vector <vector <vector<int>>> bin2(n);


	for (int i = 0; i < n; i++)
	{
		bin2[i].resize(m);
		for (int j = 0; j < m; j++)
		{
			bin2[i][j].resize(sz);
		}
	}


	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			bin2[i][j][0] = bin[i][j][0];
		}
	}

	y = 1;
	for (int k_ = 1; k_ < sz; k_++)
	{
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				bin2[i][j][k_] = f;

				g[f].resize(X);

				for (int x = 0; x < X; x++)
				{
					g[f][x] = bin2[min(i + y * x, n - 1)][j][k_ - 1];
				}

				f++;
			}
		}

		y *= X;
	}

	y /= X;






	deep.resize(g.size() ,inf);

	vector <vector < int>> q(2);

	for (int i = 0; i < 2; i++)
		q[i].resize(n * m + 2);

	int f1_ = 0;
	int f2_ = 0;

	q[0][0] = bin[i_st][j_st][0];

	f1_ = 1;
	
	deep[bin[i_st][j_st][0]] = 0;

	vector <pair <int, int>> go;

	go.push_back({ 1 , 0 });
	go.push_back({ -1 , 0 });
	go.push_back({ 0 , 1 });
	go.push_back({ 0 , -1 });

	int d2 = -1;
	for (int d = 0 ; d < n*m+1  ; d ^= 1)
	{
		d2++;

		if (f1_ == 0)
			break;

		for (int ind = 0; ind < f1_; ind++)
		{
			int ind__ = q[d][ind];

			if (ind__ < f2)
			{
				int i_ = vp[ind__].first;
				int j_ = vp[ind__].second;

				for (int i = 0; i < 4; i++)
				{
					int i__ = i_ + go[i].first;
					int j__ = j_ + go[i].second;

					if ((i__ >= 0) and (i__ < n))
					{
						if ((j__ >= 0) and (j__ < m))
						{
							if (deep[bin[i__][j__][0]] > d2)
							{
								if (vs[i__][j__] == '.')
								{
									deep[bin[i__][j__][0]] = d2;

									q[d][f1_] = bin[i__][j__][0];
									f1_++;
								}
							}
						}
					}
				}
			}
			else
			{
				for (int i = 0; i < g[ind__].size(); i++)
				{
					int ind_s = g[ind__][i];

					if (deep[ind_s] > d2)
					{	
						deep[ind_s] = d2;
						
						q[d][f1_] = ind_s;
						f1_++;
					}
				}
			}
		}



		for (int ind = 0; ind < f1_; ind++)
		{
			int ind__ = q[d][ind];

			if (ind__ < f2)
			{
				int i_ = vp[ind__].first;
				int j_ = vp[ind__].second;


				if (i_ >= k) 
				{
					int l = j_ - (k - 1);
					int r = j_ + (k - 1);

					l = max(l, 0);
					r = min(r, m - 1);

					int i__ = i_ - k;
					int j__ = l;

					int lenth = r - l + 1;

					int c = 0;
					int x = 1;

					while (x * X <= lenth)
					{
						x *= X;
						c++;
					}

					for (int c_ = 0; c_ < (lenth / x); c_++)
					{
						if (deep[bin[i__][j__ + (c_ * x)][c]] == inf)
						{
							deep[bin[i__][j__ + (c_ * x)][c]] = d2 + 1;

							q[d ^ 1][f2_] = bin[i__][j__ + (c_ * x)][c];
							f2_++;
							//q[d + 1].push_back(bin[i__][j__ + (c_ * x)][c]);
						}
					}

					if (deep[bin[i__][r - x + 1][c]] == inf)
					{
						deep[bin[i__][r - x + 1][c]] = d2 + 1;
						
						q[d ^ 1][f2_] = bin[i__][r - x + 1][c];
						f2_++;

						//q[d + 1].push_back(bin[i__][r - x + 1][c]);
					}
					//q[d + 1].push_back(bin[i__][r - x+1][c]);
				}

				if (i_+ k < n) 
				{
					int l = j_ - (k - 1);
					int r = j_ + (k - 1);

					l = max(l, 0);
					r = min(r, m - 1);

					int i__ = i_ + k;
					int j__ = l;

					int lenth = r - l + 1;

					int c = 0;
					int x = 1;

					while (x * X <= lenth)
					{
						x *= X;
						c++;
					}

					for (int c_ = 0; c_ < (lenth / x); c_++)
					{
						if (deep[bin[i__][j__ + (c_ * x)][c]] == inf)
						{
							deep[bin[i__][j__ + (c_ * x)][c]] = d2 + 1;

							q[d ^ 1][f2_] = bin[i__][j__ + (c_ * x)][c];
							f2_++;
							//q[d + 1].push_back(bin[i__][j__ + (c_ * x)][c]);
						}
					}

					if (deep[bin[i__][r - x + 1][c]] == inf)
					{
						deep[bin[i__][r - x + 1][c]] = d2 + 1;

						q[d ^ 1][f2_] = bin[i__][r - x + 1][c];
						f2_++;

						//q[d + 1].push_back(bin[i__][r - x + 1][c]);
					}
					//q[d + 1].push_back(bin[i__][r - x+1][c]);
				}
				




				if (j_ >= k)
				{
					int l = i_ - (k - 1);
					int r = i_ + (k - 1);

					l = max(l, 0);
					r = min(r, n - 1);

					int i__ = l;
					int j__ = j_ - k;

					int lenth = r - l + 1;

					int c = 0;
					int x = 1;

					while (x * X <= lenth)
					{
						x *= X;
						c++;
					}

					for (int c_ = 0; c_ < (lenth / x); c_++)
					{
						if (deep[bin2[i__ + (c_ * x)][j__][c]] > d2 + 1)
						{
							deep[bin2[i__ + (c_ * x)][j__][c]] = d2 + 1;
							//q[d + 1].push_back(bin2[i__ + (c_ * x)][j__][c]);

							q[d ^ 1][f2_] = bin2[i__ + (c_ * x)][j__][c];
							f2_++;
						}
					}


					if (deep[bin2[r - x + 1][j__][c]] == inf)
					{
						deep[bin2[r - x + 1][j__][c]] = d2 + 1;
						//q[d + 1].push_back(bin2[r - x + 1][j__][c]);

						q[d ^ 1][f2_] = bin2[r - x + 1][j__][c];
						f2_++;
					}

					//q[d + 1].push_back(bin[l - x+1][j__][c]);
				}


				if (j_+k < m)
				{
					int l = i_ - (k - 1);
					int r = i_ + (k - 1);

					l = max(l, 0);
					r = min(r, n - 1);

					int i__ = l;
					int j__ = j_ + k;

					int lenth = r - l + 1;

					int c = 0;
					int x = 1;

					while (x * X <= lenth)
					{
						x *= X;
						c++;
					}

					for (int c_ = 0; c_ < (lenth / x); c_++)
					{
						if (deep[bin2[i__ + (c_ * x)][j__][c]] > d2 + 1)
						{
							deep[bin2[i__ + (c_ * x)][j__][c]] = d2 + 1;
							//q[d + 1].push_back(bin2[i__ + (c_ * x)][j__][c]);

							q[d ^ 1][f2_] = bin2[i__ + (c_ * x)][j__][c];
							f2_++;
						}
					}


					if (deep[bin2[r - x + 1][j__][c]] > d2 + 1)
					{
						deep[bin2[r - x + 1][j__][c]] = d2 + 1;
						//q[d + 1].push_back(bin2[r - x + 1][j__][c]);

						q[d ^ 1][f2_] = bin2[r - x + 1][j__][c];
						f2_++;
					}

					//q[d + 1].push_back(bin[l - x+1][j__][c]);
				}


			}
		}

		for (int i = 0; i < f2_; i++)
		{
			q[d][i] = q[d ^ 1][i];
		}

		f1_ = f2_;
		f2_ = 0;
	}


	//cout << deep[i_f][j_f] << "\n";

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (abs(i - i_f) <= k)
			{
				if (abs(j - j_f) <= k)
				{
					if ((abs(i - i_f) + abs(j - j_f)) != 2 * k)
					{
						deep[bin[i_f][j_f][0]] = min(deep[bin[i_f][j_f][0]], deep[bin[i][j][0]] + 1);
					}
				}
			}
		}
	}

	cout << deep[bin[i_f][j_f][0]];
}

/*
5 5 2
2 2
4 4
#....
#.##.
####.
##...
.....
*/

Compilation message

Main.cpp:1: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    1 | #pragma target("arch=icelake-server")
      | 
Main.cpp: In function 'int main()':
Main.cpp:256:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  256 |     for (int i = 0; i < g[ind__].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 21 ms 11356 KB Output is correct
20 Correct 7 ms 8796 KB Output is correct
21 Correct 11 ms 11356 KB Output is correct
22 Correct 14 ms 11356 KB Output is correct
23 Correct 11 ms 11380 KB Output is correct
24 Correct 12 ms 11288 KB Output is correct
25 Correct 10 ms 11236 KB Output is correct
26 Correct 15 ms 11352 KB Output is correct
27 Correct 14 ms 11352 KB Output is correct
28 Correct 13 ms 11360 KB Output is correct
29 Correct 43 ms 27728 KB Output is correct
30 Correct 11 ms 11612 KB Output is correct
31 Correct 28 ms 27792 KB Output is correct
32 Correct 39 ms 27552 KB Output is correct
33 Correct 36 ms 27780 KB Output is correct
34 Correct 21 ms 27776 KB Output is correct
35 Correct 26 ms 27620 KB Output is correct
36 Correct 45 ms 27740 KB Output is correct
37 Correct 46 ms 27788 KB Output is correct
38 Correct 44 ms 27728 KB Output is correct
39 Correct 586 ms 273748 KB Output is correct
40 Correct 39 ms 31312 KB Output is correct
41 Correct 27 ms 34024 KB Output is correct
42 Correct 64 ms 39272 KB Output is correct
43 Correct 46 ms 44376 KB Output is correct
44 Correct 175 ms 135572 KB Output is correct
45 Correct 223 ms 146416 KB Output is correct
46 Correct 422 ms 273488 KB Output is correct
47 Correct 642 ms 273568 KB Output is correct
48 Correct 555 ms 273484 KB Output is correct
49 Correct 259 ms 273396 KB Output is correct
50 Correct 237 ms 273392 KB Output is correct
51 Correct 659 ms 273488 KB Output is correct
52 Correct 618 ms 273488 KB Output is correct
53 Correct 560 ms 273492 KB Output is correct

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Runtime error 1 ms 1372 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 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 452 KB Output is correct
7 Correct 1 ms 420 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 1220 KB Output is correct
10 Correct 1 ms 1224 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Runtime error 1 ms 1372 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Runtime error 1 ms 1372 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 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 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Runtime error 1 ms 1372 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 21 ms 11356 KB Output is correct
20 Correct 7 ms 8796 KB Output is correct
21 Correct 11 ms 11356 KB Output is correct
22 Correct 14 ms 11356 KB Output is correct
23 Correct 11 ms 11380 KB Output is correct
24 Correct 12 ms 11288 KB Output is correct
25 Correct 10 ms 11236 KB Output is correct
26 Correct 15 ms 11352 KB Output is correct
27 Correct 14 ms 11352 KB Output is correct
28 Correct 13 ms 11360 KB Output is correct
29 Correct 43 ms 27728 KB Output is correct
30 Correct 11 ms 11612 KB Output is correct
31 Correct 28 ms 27792 KB Output is correct
32 Correct 39 ms 27552 KB Output is correct
33 Correct 36 ms 27780 KB Output is correct
34 Correct 21 ms 27776 KB Output is correct
35 Correct 26 ms 27620 KB Output is correct
36 Correct 45 ms 27740 KB Output is correct
37 Correct 46 ms 27788 KB Output is correct
38 Correct 44 ms 27728 KB Output is correct
39 Correct 586 ms 273748 KB Output is correct
40 Correct 39 ms 31312 KB Output is correct
41 Correct 27 ms 34024 KB Output is correct
42 Correct 64 ms 39272 KB Output is correct
43 Correct 46 ms 44376 KB Output is correct
44 Correct 175 ms 135572 KB Output is correct
45 Correct 223 ms 146416 KB Output is correct
46 Correct 422 ms 273488 KB Output is correct
47 Correct 642 ms 273568 KB Output is correct
48 Correct 555 ms 273484 KB Output is correct
49 Correct 259 ms 273396 KB Output is correct
50 Correct 237 ms 273392 KB Output is correct
51 Correct 659 ms 273488 KB Output is correct
52 Correct 618 ms 273488 KB Output is correct
53 Correct 560 ms 273492 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 452 KB Output is correct
62 Correct 0 ms 604 KB Output is correct
63 Correct 0 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 1 ms 1116 KB Output is correct
66 Correct 1 ms 1116 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 0 ms 604 KB Output is correct
69 Correct 0 ms 604 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Runtime error 1 ms 1372 KB Execution killed with signal 11
73 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 21 ms 11356 KB Output is correct
20 Correct 7 ms 8796 KB Output is correct
21 Correct 11 ms 11356 KB Output is correct
22 Correct 14 ms 11356 KB Output is correct
23 Correct 11 ms 11380 KB Output is correct
24 Correct 12 ms 11288 KB Output is correct
25 Correct 10 ms 11236 KB Output is correct
26 Correct 15 ms 11352 KB Output is correct
27 Correct 14 ms 11352 KB Output is correct
28 Correct 13 ms 11360 KB Output is correct
29 Correct 43 ms 27728 KB Output is correct
30 Correct 11 ms 11612 KB Output is correct
31 Correct 28 ms 27792 KB Output is correct
32 Correct 39 ms 27552 KB Output is correct
33 Correct 36 ms 27780 KB Output is correct
34 Correct 21 ms 27776 KB Output is correct
35 Correct 26 ms 27620 KB Output is correct
36 Correct 45 ms 27740 KB Output is correct
37 Correct 46 ms 27788 KB Output is correct
38 Correct 44 ms 27728 KB Output is correct
39 Correct 586 ms 273748 KB Output is correct
40 Correct 39 ms 31312 KB Output is correct
41 Correct 27 ms 34024 KB Output is correct
42 Correct 64 ms 39272 KB Output is correct
43 Correct 46 ms 44376 KB Output is correct
44 Correct 175 ms 135572 KB Output is correct
45 Correct 223 ms 146416 KB Output is correct
46 Correct 422 ms 273488 KB Output is correct
47 Correct 642 ms 273568 KB Output is correct
48 Correct 555 ms 273484 KB Output is correct
49 Correct 259 ms 273396 KB Output is correct
50 Correct 237 ms 273392 KB Output is correct
51 Correct 659 ms 273488 KB Output is correct
52 Correct 618 ms 273488 KB Output is correct
53 Correct 560 ms 273492 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 452 KB Output is correct
62 Correct 0 ms 604 KB Output is correct
63 Correct 0 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 1 ms 1116 KB Output is correct
66 Correct 1 ms 1116 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 0 ms 604 KB Output is correct
69 Correct 0 ms 604 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Runtime error 1 ms 1372 KB Execution killed with signal 11
73 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 452 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 21 ms 11356 KB Output is correct
20 Correct 7 ms 8796 KB Output is correct
21 Correct 11 ms 11356 KB Output is correct
22 Correct 14 ms 11356 KB Output is correct
23 Correct 11 ms 11380 KB Output is correct
24 Correct 12 ms 11288 KB Output is correct
25 Correct 10 ms 11236 KB Output is correct
26 Correct 15 ms 11352 KB Output is correct
27 Correct 14 ms 11352 KB Output is correct
28 Correct 13 ms 11360 KB Output is correct
29 Correct 43 ms 27728 KB Output is correct
30 Correct 11 ms 11612 KB Output is correct
31 Correct 28 ms 27792 KB Output is correct
32 Correct 39 ms 27552 KB Output is correct
33 Correct 36 ms 27780 KB Output is correct
34 Correct 21 ms 27776 KB Output is correct
35 Correct 26 ms 27620 KB Output is correct
36 Correct 45 ms 27740 KB Output is correct
37 Correct 46 ms 27788 KB Output is correct
38 Correct 44 ms 27728 KB Output is correct
39 Correct 586 ms 273748 KB Output is correct
40 Correct 39 ms 31312 KB Output is correct
41 Correct 27 ms 34024 KB Output is correct
42 Correct 64 ms 39272 KB Output is correct
43 Correct 46 ms 44376 KB Output is correct
44 Correct 175 ms 135572 KB Output is correct
45 Correct 223 ms 146416 KB Output is correct
46 Correct 422 ms 273488 KB Output is correct
47 Correct 642 ms 273568 KB Output is correct
48 Correct 555 ms 273484 KB Output is correct
49 Correct 259 ms 273396 KB Output is correct
50 Correct 237 ms 273392 KB Output is correct
51 Correct 659 ms 273488 KB Output is correct
52 Correct 618 ms 273488 KB Output is correct
53 Correct 560 ms 273492 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 452 KB Output is correct
62 Correct 0 ms 604 KB Output is correct
63 Correct 0 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 1 ms 1116 KB Output is correct
66 Correct 1 ms 1116 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 0 ms 604 KB Output is correct
69 Correct 0 ms 604 KB Output is correct
70 Correct 1 ms 604 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Runtime error 1 ms 1372 KB Execution killed with signal 11
73 Halted 0 ms 0 KB -