oj.uz

Submission #397849

# Submission time Handle Problem Language Result Execution time Memory
397849 2021-05-03T09:37:03 Z ZikXewen Painting Walls (APIO20_paint) C++17
0 / 100
 1 ms 204 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions( int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	vector<vector<int>> f(K);
	vector<int> mem(M), an;
	for(int i = 0; i < M; ++i) for(int j: B[i]) f[j].emplace_back(i);
	for(int i = 0, ct = 0, tem; i < N; ++i) {
		if(i >= M) for(int j: f[C[i - M]]) if(--mem[j] == M - 1) --ct;
		for(int j: f[C[i]]) if(++mem[j] == M) ++ct;
		if(ct) an.emplace_back(i);
		tem = mem[M - 1];
		for(int i = M - 1; i; --i) mem[i] = mem[i - 1];
		mem[0] = tem;
	}
	for(int i = 0, ct = 1, tem; an.size(); i = tem, ++ct){
		tem = *(upper_bound(an.begin(), an.end(), i + M) - 1);
		if(tem == N - 1) return ct;
		if(tem == i) return -1;
	}
	return -1;
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 37.0

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