oj.uz

Submission #982393

# Submission time Handle Problem Language Result Execution time Memory
982393 2024-05-14T08:05:10 Z vjudge1 Painting Walls (APIO20_paint) C++17
0 / 100
 33 ms 12916 KB 
#include "paint.h"

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
	template <typename T1, typename T2>
	std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
	{
		in >> x.first >> x.second;
		return in;
	}

	template <typename T1, typename T2>
	std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
	{
		out << x.first << " " << x.second;
		return out;
	}

	template <typename T1>
	std::istream &operator>>(std::istream &in, std::vector<T1> &x)
	{
		for (auto &i : x)
			in >> i;
		return in;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
	ios_base ::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

int minimumInstructions(int N, int M, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B)
{
	int n = N, m = M, k = K;

	vector<vector<int>> col(k);
	map<pii, bool> good;
	for (int i = 0; i < m; ++i)
		for (auto el : B[i])
		{
			col[el].pb(i);
			good[{i, el}];
		}

	vector<int> isGood(n);
	map<int, int> isAdded;
	vector<pii> els;
	for (int i = 0; i < n; ++i)
	{
		vector<pii> nels;
		int curMaxLen = 0;
		for (auto [el, len] : els)
		{
			if (good.find({(el + 1) % m, C[i]}) != good.end())
			{
				nels.pb({(el + 1) % m, len + 1});
				curMaxLen = max(curMaxLen, len + 1);
			}
			else
				isAdded[el] = 0;
		}
		swap(nels, els);

		for (auto el : col[C[i]])
			if (!isAdded[el])
			{
				isAdded[el] = 1;
				els.pb({el, 1});
				curMaxLen = max(curMaxLen, 1);
			}
		assert(els.size() < 600);

		if (curMaxLen >= m)
			isGood[i - m + 1] = 1;
	}

	int pr = 0;
	int curDone = 0;
	int cnt = 0;
	while (curDone < n)
	{
		int curMax = -1;
		for (int i = pr; i <= curDone; ++i)
			if (isGood[i])
				curMax = i;
		if (curMax == -1)
			break;
		cnt++;
		pr = curDone + 1;
		curDone = curMax + m;
	}

	if (curDone < n)
		return -1;
	else
		return cnt;
}

// ////////////////////////////

// #include "paint.h"

// #include <cassert>
// #include <cstdio>

// #include <string>
// #include <vector>

// int main()
// {
// 	int N, M, K;
// 	assert(3 == scanf("%d %d %d", &N, &M, &K));

// 	std::vector<int> C(N);
// 	for (int i = 0; i < N; ++i)
// 	{
// 		assert(1 == scanf("%d", &C[i]));
// 	}

// 	std::vector<int> A(M);
// 	std::vector<std::vector<int>> B(M);
// 	for (int i = 0; i < M; ++i)
// 	{
// 		assert(1 == scanf("%d", &A[i]));
// 		B[i].resize(A[i]);
// 		for (int j = 0; j < A[i]; ++j)
// 		{
// 			assert(1 == scanf("%d", &B[i][j]));
// 		}
// 	}

// 	int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
// 	printf("%d\n", minimum_instructions);

// 	return 0;
// }

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 2652 KB Output is correct
14 Correct 3 ms 2648 KB Output is correct
15 Correct 3 ms 2652 KB Output is correct
16 Correct 4 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 3 ms 2652 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 33 ms 12916 KB Output is correct
23 Correct 33 ms 12740 KB Output is correct
24 Correct 32 ms 12912 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 664 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Runtime error 16 ms 10332 KB Execution killed with signal 6
32 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 4 ms 2652 KB Output is correct
14 Correct 3 ms 2648 KB Output is correct
15 Correct 3 ms 2652 KB Output is correct
16 Correct 4 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 3 ms 2652 KB Output is correct
19 Correct 2 ms 2908 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 544 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 2 ms 1628 KB Output is correct
36 Correct 2 ms 2648 KB Output is correct
37 Correct 2 ms 2140 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 2140 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 2 ms 2652 KB Output is correct
43 Incorrect 2 ms 2652 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 544 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 4 ms 2648 KB Output is correct
19 Correct 3 ms 2652 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 33 ms 12916 KB Output is correct
25 Correct 33 ms 12740 KB Output is correct
26 Correct 32 ms 12912 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 2396 KB Output is correct
37 Correct 2 ms 1884 KB Output is correct
38 Correct 2 ms 1628 KB Output is correct
39 Correct 2 ms 2648 KB Output is correct
40 Correct 2 ms 2140 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 2140 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Incorrect 2 ms 2652 KB Output isn't correct
47 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 544 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 4 ms 2648 KB Output is correct
19 Correct 3 ms 2652 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 33 ms 12916 KB Output is correct
25 Correct 33 ms 12740 KB Output is correct
26 Correct 32 ms 12912 KB Output is correct
27 Correct 2 ms 600 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 664 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Runtime error 16 ms 10332 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 544 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 4 ms 2648 KB Output is correct
19 Correct 3 ms 2652 KB Output is correct
20 Correct 3 ms 2652 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 33 ms 12916 KB Output is correct
25 Correct 33 ms 12740 KB Output is correct
26 Correct 32 ms 12912 KB Output is correct
27 Correct 2 ms 600 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 664 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Runtime error 16 ms 10332 KB Execution killed with signal 6
34 Halted 0 ms 0 KB -