oj.uz

Submission #401923

# Submission time Handle Problem Language Result Execution time Memory
401923 2021-05-11T02:23:23 Z faresbasbs Painting Walls (APIO20_paint) C++14
0 / 100
 3 ms 2648 KB 
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
vector<int> vals[100001];

int minimumInstructions(int n , int m , int K , vector<int> c , vector<int> A , vector<vector<int>> B){
	for(int i = 0 ; i < m ; i += 1){
		for(auto j : B[i]){
			vals[j].push_back(i);
		}
	}
	vector<pair<int,pair<int,int>>> q,q2;
	for(int i : vals[c[0]]){
		q.push_back({i,{1,1}});
	}
	for(int i = 1 ; i < n ; i += 1){
		q2.clear();
		int mini = 1000000000;
		for(auto j : q){
			mini = min(mini,j.second.second);
			if(j.second.first == m){
				continue;
			}
			if(*lower_bound(vals[c[i]].begin(),vals[c[i]].end(),(j.first+1)%m) == (j.first+1)%m){
				q2.push_back({(j.first+1)%m,{j.second.first+1,j.second.second}});
			}
		}
		for(auto j : vals[c[i]]){
			q2.push_back({j,{1,mini+1}});
		}
		swap(q,q2);
	}
	int mini = 1000000000;
	for(auto i : q){
		if(i.second.first == m){
			mini = min(mini,i.second.second);
		}
	}
	if(mini == 1000000000){
		return -1;
	}
	return mini;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Incorrect 2 ms 2636 KB Output isn't correct
10 Halted 0 ms 0 KB -