oj.uz

Submission #387314

# Submission time Handle Problem Language Result Execution time Memory
387314 2021-04-08T09:02:16 Z talant117408 Painting Walls (APIO20_paint) C++17
0 / 100
 4 ms 3436 KB 
#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define sz(v) (int)v.size()
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()

const int MAXN = 1e5+7;
int n, m, k;
int color[MAXN], can[MAXN], rightmost[2][MAXN], L[MAXN];
vector <int> isLiked[MAXN];

int g(int i) {
	if (i >= n) return 0;
	else if (i - L[i] >= m) return 1e9;
	return 1+g(L[i]+m);
}

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	memset(rightmost, -1e9, sizeof(rightmost));
	n = N; m = M; k = K;
	for (int i = 0; i < n; i++) color[i] = C[i];
	for (int i = 0; i < m; i++) {
		for (auto to : B[i]) {
			isLiked[to].pb(i);
		}
	}
	
	for (int i = n-1; i >= 0; i--) {
		auto type = i&1;
		for (int j = sz(isLiked[color[i]])-1; j >= 0; j--) {
			auto to = isLiked[color[i]][j];
			if (i == n-1 || rightmost[type^1][(to+1)%m] < 0) {
				rightmost[type][to] = i;
			}
			else {
				rightmost[type][to] = rightmost[type^1][(to+1)%m];
			}
		}
		for (int j = 0; j < sz(isLiked[color[i]]); j++) {
			auto to  = isLiked[color[i]][j];
			if (rightmost[type][to] - to >= m-1) {
				can[i] = 1;
			}
		}
	}

	int prev = -1e9;
	for (int i = 0; i < n; i++) {
		if (can[i]) prev = i;
		L[i] = prev;
	}
	
	auto ans = g(0);
	return (ans >= 1e8 ? -1 : ans);
}

/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Incorrect 3 ms 3436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Incorrect 3 ms 3436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Incorrect 3 ms 3436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Incorrect 3 ms 3436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3436 KB Output is correct
2 Correct 3 ms 3436 KB Output is correct
3 Correct 3 ms 3436 KB Output is correct
4 Correct 3 ms 3436 KB Output is correct
5 Incorrect 3 ms 3436 KB Output isn't correct
6 Halted 0 ms 0 KB -