oj.uz

Submission #594136

# Submission time Handle Problem Language Result Execution time Memory
594136 2022-07-12T06:53:08 Z 장태환(#8433) Sandcastle 2 (JOI22_ho_t5) C++17
80 / 100
 3210 ms 16932 KB 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>x;
vector<vector<vector<int>>>val;
vector<vector<vector<int>>>psum;
signed main()
{
	int N, M;
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N >> M;
	int sw = 0;
	int i, j;
	for (i = 0; i < N; i++)
	{
		vector<int>y;
		for (j = 0; j < M; j++)
		{
			int a;
			cin >> a;
			y.push_back(a);
		}
		x.push_back(y);
	}
	if (N > M)
	{
		vector<vector<int>>t;
		int i, j;
		for (i = 0; i < M; i++)
		{
			vector<int>y;
			for (j = 0; j < N; j++)
			{
				y.push_back(x[j][i]);
			}
			t.push_back(y);
		}
		x = t;
		swap(N, M);
	}
	for (i = 0; i < N; i++)
	{
		vector<vector<int>>te;
		for (j = 0; j < M; j++)
		{
			vector<int>t;
			int k;
			for (k = 0; k < 16; k++)
			{
				vector<int>t3;
				if ((k & 1)&&i)
				{
					t3.push_back(x[i - 1][j]);
				}
				if ((k & 2) && j)
				{
					t3.push_back(x[i][j-1]);
				}
				if ((k & 4) && i!=N-1)
				{
					t3.push_back(x[i+1][j]);
				}
				if ((k & 8) && j != M - 1)
				{
					t3.push_back(x[i][j+1]);
				}
				sort(t3.begin(), t3.end());
				int l;
				int ll = 0;
				int u = 0;
				for (l = 0; l < t3.size(); l++)
				{
					if (t3[l] < x[i][j])
						ll = t3[l];
					else
					{
						u = 1;
						break;
					}
				}
				if (!u)
				{
					t.push_back((1 << 26) - ll);
				}
				else
				{
					t.push_back(x[i][j] - ll);
				}
			}
			te.push_back(t);
		}
		val.push_back(te);
		psum.push_back(te);
	}
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < M; j++)
		{
			int k;
			for (k = 0; k < 16; k++)
			{
				if(i)
					psum[i][j][k] += psum[i - 1][j][k];
			}
		}
	}
	int ans = N*M;
	for (i = 0; i < N; i++)
	{
		for (j = i + 1; j < N; j++)
		{
			int k;
			for (k = 0; k < M; k++)
			{
				int v = val[j][k][9] + val[i][k][12];
				v += psum[j - 1][k][13]-psum[i][k][13];
				int l;
				for (l = k + 1; l < M; l++)
				{
					if (v + val[j][l][3] + val[i][l][6] + psum[j - 1][l][7] - psum[i][l][7]==(1 << 26))
					{
						ans++;
					}
					v += val[i][l][14]+val[j][l][11];
					v += -psum[i][l][15] + psum[j-1][l][15];
				}
			}
		}
	}
	for (i = 0; i < N; i++)
	{
		int k;
		for (k = 0; k < M; k++)
		{
			int v = val[i][k][8];
			int l;
			for (l = k + 1; l < M; l++)
			{
				if (v + val[i][l][2] == (1 << 26))
				{
					ans++;
				}
				v += val[i][l][10];
			}
		}
	}
	for (i = 0; i < M; i++)
	{
		int k;
		for (k = 0; k < N; k++)
		{
			int v = val[k][i][4];
			int l;
			for (l = k + 1; l < N; l++)
			{
				if (v + val[l][i][1] == (1 << 26))
				{
					ans++;
				}
				v += val[l][i][5];
			}
		}
	}
	cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:71:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for (l = 0; l < t3.size(); l++)
      |                 ~~^~~~~~~~~~~
Main.cpp:12:6: warning: unused variable 'sw' [-Wunused-variable]
   12 |  int sw = 0;
      |      ^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2239 ms 15756 KB Output is correct
3 Correct 2144 ms 15476 KB Output is correct
4 Correct 2276 ms 15700 KB Output is correct
5 Correct 2348 ms 15676 KB Output is correct
6 Correct 2215 ms 15676 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 6 ms 596 KB Output is correct
14 Correct 3 ms 468 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 652 KB Output is correct

Subtask #4
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 6 ms 596 KB Output is correct
14 Correct 3 ms 468 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 652 KB Output is correct
17 Correct 43 ms 2644 KB Output is correct
18 Correct 57 ms 1788 KB Output is correct
19 Correct 62 ms 1756 KB Output is correct
20 Correct 44 ms 1748 KB Output is correct
21 Correct 61 ms 1748 KB Output is correct
22 Correct 45 ms 1748 KB Output is correct
23 Correct 53 ms 1620 KB Output is correct
24 Correct 37 ms 1600 KB Output is correct
25 Correct 46 ms 1776 KB Output is correct
26 Correct 45 ms 1736 KB Output is correct
27 Correct 48 ms 1780 KB Output is correct
28 Correct 53 ms 1836 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 6 ms 596 KB Output is correct
14 Correct 3 ms 468 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 7 ms 652 KB Output is correct
17 Correct 43 ms 2644 KB Output is correct
18 Correct 57 ms 1788 KB Output is correct
19 Correct 62 ms 1756 KB Output is correct
20 Correct 44 ms 1748 KB Output is correct
21 Correct 61 ms 1748 KB Output is correct
22 Correct 45 ms 1748 KB Output is correct
23 Correct 53 ms 1620 KB Output is correct
24 Correct 37 ms 1600 KB Output is correct
25 Correct 46 ms 1776 KB Output is correct
26 Correct 45 ms 1736 KB Output is correct
27 Correct 48 ms 1780 KB Output is correct
28 Correct 53 ms 1836 KB Output is correct
29 Correct 2276 ms 16932 KB Output is correct
30 Correct 3210 ms 10812 KB Output is correct
31 Correct 2991 ms 10732 KB Output is correct
32 Correct 3111 ms 13240 KB Output is correct
33 Correct 2894 ms 10676 KB Output is correct
34 Correct 2889 ms 10672 KB Output is correct
35 Incorrect 1262 ms 7148 KB Output isn't correct
36 Halted 0 ms 0 KB -