oj.uz

답안 #996480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996480 2024-06-10T17:07:08 Z Dan4Life 벽 칠하기 (APIO20_paint) C++17
0 / 100
 937 ms 84844 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];

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

bool check(int i){
	for(int st = 0; st < m; st++){
		int x = st, y = i;
		if(x==0){
			if(has[m-1][i+m-1]) return true;
		}
		else if(has[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] = 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];
			
	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;
}

Compilation message

paint.cpp: In function 'bool check(int)':
paint.cpp:22:15: warning: unused variable 'y' [-Wunused-variable]
   22 |   int x = st, y = i;
      |               ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 40504 KB Output is correct
2 Correct 5 ms 40540 KB Output is correct
3 Correct 5 ms 40540 KB Output is correct
4 Correct 5 ms 40540 KB Output is correct
5 Correct 5 ms 40540 KB Output is correct
6 Correct 5 ms 40732 KB Output is correct
7 Correct 5 ms 40540 KB Output is correct
8 Correct 5 ms 40532 KB Output is correct
9 Correct 6 ms 40540 KB Output is correct
10 Correct 5 ms 40540 KB Output is correct
11 Correct 5 ms 40540 KB Output is correct
12 Correct 5 ms 40540 KB Output is correct
13 Correct 6 ms 40680 KB Output is correct
14 Correct 6 ms 40792 KB Output is correct
15 Correct 6 ms 40792 KB Output is correct
16 Correct 6 ms 41048 KB Output is correct
17 Correct 7 ms 40792 KB Output is correct
18 Correct 6 ms 40796 KB Output is correct
19 Correct 7 ms 40796 KB Output is correct
20 Correct 6 ms 40796 KB Output is correct
21 Correct 6 ms 40604 KB Output is correct
22 Correct 22 ms 46092 KB Output is correct
23 Correct 22 ms 46072 KB Output is correct
24 Correct 22 ms 46224 KB Output is correct
25 Correct 6 ms 41052 KB Output is correct
26 Correct 7 ms 41120 KB Output is correct
27 Correct 7 ms 41052 KB Output is correct
28 Correct 7 ms 41052 KB Output is correct
29 Correct 7 ms 40920 KB Output is correct
30 Correct 7 ms 41108 KB Output is correct
31 Correct 524 ms 42200 KB Output is correct
32 Correct 526 ms 42324 KB Output is correct
33 Correct 533 ms 42204 KB Output is correct
34 Correct 524 ms 42200 KB Output is correct
35 Correct 514 ms 42320 KB Output is correct
36 Correct 512 ms 42076 KB Output is correct
37 Correct 883 ms 46428 KB Output is correct
38 Correct 937 ms 47304 KB Output is correct
39 Correct 890 ms 47308 KB Output is correct
40 Runtime error 48 ms 84844 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 40504 KB Output is correct
2 Correct 5 ms 40540 KB Output is correct
3 Correct 5 ms 40540 KB Output is correct
4 Correct 5 ms 40540 KB Output is correct
5 Correct 5 ms 40540 KB Output is correct
6 Correct 5 ms 40732 KB Output is correct
7 Correct 5 ms 40540 KB Output is correct
8 Correct 5 ms 40532 KB Output is correct
9 Correct 6 ms 40540 KB Output is correct
10 Correct 5 ms 40540 KB Output is correct
11 Correct 5 ms 40540 KB Output is correct
12 Correct 5 ms 40540 KB Output is correct
13 Correct 6 ms 40680 KB Output is correct
14 Correct 6 ms 40792 KB Output is correct
15 Correct 6 ms 40792 KB Output is correct
16 Correct 6 ms 41048 KB Output is correct
17 Correct 7 ms 40792 KB Output is correct
18 Correct 6 ms 40796 KB Output is correct
19 Correct 7 ms 40796 KB Output is correct
20 Correct 6 ms 40796 KB Output is correct
21 Correct 6 ms 40604 KB Output is correct
22 Incorrect 5 ms 40536 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 40536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 40536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 40536 KB Output isn't correct
2 Halted 0 ms 0 KB -