Submission #996491

# Submission time Handle Problem Language Result Execution time Memory
996491 2024-06-10T17:18:20 Z Dan4Life Painting Walls (APIO20_paint) C++17
0 / 100
22 ms 50336 KB
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
 
#define all(a) begin(a),end(a)
#define sz(a) (int)a.size()
#define pb push_back
 
const int mxN = (int)2e4+10; 
const int mxM = (int)2e3+10; 
int n, m, k;
bool work[mxN];
vector<int> c, a;
set<int> b[mxN];

bool has[mxM][mxN], has2[mxM][mxN];

//has[x][y] = if contractor x contains the color used in cell y

bool check(int i){
	for(int x = 0; x < m; x++){
		if(i+m-1-x<n or !x){
			if(has2[m-1][i+m-1-x]) return true;
		}
		else if(has2[m-1][i+m-1-x] and has[x-1][i+m-1]) return true;
	}
	return false;
}
 
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	n = N, m = M, k = K;
	for(auto u : C) c.pb(u);
	for(auto u : A) a.pb(u);
	for(int i = 0; i < m; i++)
		for(auto u : B[i]) b[i].insert(u);
		
	memset(has,0,sizeof(has));
	
	for(int i = 0; i < m; i++)
		for(int j = 0; j < n; j++)
			has[i][j] = has2[i][j] = b[i].count(c[j]);
			
	for(int i = 1; i < m; i++)
		for(int j = 1; j < n; j++)
			has[i][j] &= has[i-1][j-1];
	for(int i = m-2; i>=0; i--)
		for(int j = n-2; j>=0; j--)
			has2[i][j] &= has2[i+1][j+1];
			
	memset(work,0,sizeof(work));
	for(int i = 0; i <= n-m; i++) work[i] = check(i);
	if(!work[0] or !work[n-m]) return -1;
	
	int tot = 1;
	for(int i = 0; i < n-m;){
		int j;
		for(j = i+m; j>=i; j--)
			if(work[j]) break;
		if(j==i) return -1;
		tot++; i = j;
	}
	return tot;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 40792 KB Output is correct
2 Correct 6 ms 40796 KB Output is correct
3 Correct 5 ms 40796 KB Output is correct
4 Correct 5 ms 40796 KB Output is correct
5 Correct 6 ms 40796 KB Output is correct
6 Correct 5 ms 40852 KB Output is correct
7 Correct 5 ms 40796 KB Output is correct
8 Correct 5 ms 40796 KB Output is correct
9 Correct 5 ms 40796 KB Output is correct
10 Correct 6 ms 40780 KB Output is correct
11 Correct 5 ms 40796 KB Output is correct
12 Correct 6 ms 40796 KB Output is correct
13 Correct 7 ms 44892 KB Output is correct
14 Correct 6 ms 44892 KB Output is correct
15 Correct 7 ms 44892 KB Output is correct
16 Correct 7 ms 45124 KB Output is correct
17 Correct 6 ms 44892 KB Output is correct
18 Correct 6 ms 44892 KB Output is correct
19 Correct 7 ms 45148 KB Output is correct
20 Correct 7 ms 45148 KB Output is correct
21 Correct 7 ms 45148 KB Output is correct
22 Incorrect 22 ms 50336 KB Output isn't correct
23 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 40792 KB Output is correct
2 Correct 6 ms 40796 KB Output is correct
3 Correct 5 ms 40796 KB Output is correct
4 Correct 5 ms 40796 KB Output is correct
5 Correct 6 ms 40796 KB Output is correct
6 Correct 5 ms 40852 KB Output is correct
7 Correct 5 ms 40796 KB Output is correct
8 Correct 5 ms 40796 KB Output is correct
9 Correct 5 ms 40796 KB Output is correct
10 Correct 6 ms 40780 KB Output is correct
11 Correct 5 ms 40796 KB Output is correct
12 Correct 6 ms 40796 KB Output is correct
13 Correct 7 ms 44892 KB Output is correct
14 Correct 6 ms 44892 KB Output is correct
15 Correct 7 ms 44892 KB Output is correct
16 Correct 7 ms 45124 KB Output is correct
17 Correct 6 ms 44892 KB Output is correct
18 Correct 6 ms 44892 KB Output is correct
19 Correct 7 ms 45148 KB Output is correct
20 Correct 7 ms 45148 KB Output is correct
21 Correct 7 ms 45148 KB Output is correct
22 Correct 5 ms 40792 KB Output is correct
23 Correct 5 ms 40796 KB Output is correct
24 Correct 5 ms 40796 KB Output is correct
25 Incorrect 6 ms 40928 KB Output isn't correct
26 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 40792 KB Output is correct
2 Correct 5 ms 40796 KB Output is correct
3 Correct 5 ms 40792 KB Output is correct
4 Correct 6 ms 40796 KB Output is correct
5 Correct 5 ms 40796 KB Output is correct
6 Correct 5 ms 40796 KB Output is correct
7 Correct 6 ms 40796 KB Output is correct
8 Correct 5 ms 40852 KB Output is correct
9 Correct 5 ms 40796 KB Output is correct
10 Correct 5 ms 40796 KB Output is correct
11 Correct 5 ms 40796 KB Output is correct
12 Correct 6 ms 40780 KB Output is correct
13 Correct 5 ms 40796 KB Output is correct
14 Correct 6 ms 40796 KB Output is correct
15 Correct 7 ms 44892 KB Output is correct
16 Correct 6 ms 44892 KB Output is correct
17 Correct 7 ms 44892 KB Output is correct
18 Correct 7 ms 45124 KB Output is correct
19 Correct 6 ms 44892 KB Output is correct
20 Correct 6 ms 44892 KB Output is correct
21 Correct 7 ms 45148 KB Output is correct
22 Correct 7 ms 45148 KB Output is correct
23 Correct 7 ms 45148 KB Output is correct
24 Incorrect 22 ms 50336 KB Output isn't correct
25 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 40792 KB Output is correct
2 Correct 5 ms 40796 KB Output is correct
3 Correct 5 ms 40792 KB Output is correct
4 Correct 6 ms 40796 KB Output is correct
5 Correct 5 ms 40796 KB Output is correct
6 Correct 5 ms 40796 KB Output is correct
7 Correct 6 ms 40796 KB Output is correct
8 Correct 5 ms 40852 KB Output is correct
9 Correct 5 ms 40796 KB Output is correct
10 Correct 5 ms 40796 KB Output is correct
11 Correct 5 ms 40796 KB Output is correct
12 Correct 6 ms 40780 KB Output is correct
13 Correct 5 ms 40796 KB Output is correct
14 Correct 6 ms 40796 KB Output is correct
15 Correct 7 ms 44892 KB Output is correct
16 Correct 6 ms 44892 KB Output is correct
17 Correct 7 ms 44892 KB Output is correct
18 Correct 7 ms 45124 KB Output is correct
19 Correct 6 ms 44892 KB Output is correct
20 Correct 6 ms 44892 KB Output is correct
21 Correct 7 ms 45148 KB Output is correct
22 Correct 7 ms 45148 KB Output is correct
23 Correct 7 ms 45148 KB Output is correct
24 Incorrect 22 ms 50336 KB Output isn't correct
25 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 40792 KB Output is correct
2 Correct 5 ms 40796 KB Output is correct
3 Correct 5 ms 40792 KB Output is correct
4 Correct 6 ms 40796 KB Output is correct
5 Correct 5 ms 40796 KB Output is correct
6 Correct 5 ms 40796 KB Output is correct
7 Correct 6 ms 40796 KB Output is correct
8 Correct 5 ms 40852 KB Output is correct
9 Correct 5 ms 40796 KB Output is correct
10 Correct 5 ms 40796 KB Output is correct
11 Correct 5 ms 40796 KB Output is correct
12 Correct 6 ms 40780 KB Output is correct
13 Correct 5 ms 40796 KB Output is correct
14 Correct 6 ms 40796 KB Output is correct
15 Correct 7 ms 44892 KB Output is correct
16 Correct 6 ms 44892 KB Output is correct
17 Correct 7 ms 44892 KB Output is correct
18 Correct 7 ms 45124 KB Output is correct
19 Correct 6 ms 44892 KB Output is correct
20 Correct 6 ms 44892 KB Output is correct
21 Correct 7 ms 45148 KB Output is correct
22 Correct 7 ms 45148 KB Output is correct
23 Correct 7 ms 45148 KB Output is correct
24 Incorrect 22 ms 50336 KB Output isn't correct
25 Halted 0 ms 0 KB -