oj.uz

답안 #158548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
158548 2019-10-17T18:40:21 Z Mounir Lamps (JOI19_lamps) C++14
4 / 100
 190 ms 29916 KB 
#include <bits/stdc++.h>
#define chmin(x, v) x = min(x, v)
using namespace std;

const int TAILLE_CHAINE = 1e6 + 1;
int dp[TAILLE_CHAINE][3][2];
int lenChaine;
bool depart[TAILLE_CHAINE], arrivee[TAILLE_CHAINE];
string d, a;

void litEntree();
void solve();

int main()
{
	litEntree();
	solve();
	return 0;
}

void litEntree()
{
	cin >> lenChaine;
	cin.ignore();
	
	
	getline(cin, d);
	for (int idCara = 0; idCara < lenChaine; ++idCara){
		depart[idCara] = d[idCara] - '0';
	//	cout << depart[idCara];
	}
	
	//cin.ignore();
	getline(cin, a);
	for (int idCara = 0; idCara < lenChaine; ++idCara)
		arrivee[idCara] = a[idCara] - '0';
	for (int i = 0; i < lenChaine; ++i)
		for (int j = 0; j < 3; ++j)
			for (int k = 0; k < 2; ++k)
				dp[i][j][k] = 1e6 + 5;
}

void solve()
{
	for (int idCara = 0; idCara < lenChaine; ++idCara)
	{
		if (idCara == 0)
		{
			if (depart[idCara] == arrivee[idCara])
				dp[idCara][2][0] = 0;
			else
				dp[idCara][2][1] = 1;
			
			dp[idCara][arrivee[idCara]][0] = dp[idCara][arrivee[idCara]][1] =  1;
		}
		else
		{
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][arrivee[idCara]][0]);
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][arrivee[idCara]][1]);
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][!arrivee[idCara]][0] + 1);
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][!arrivee[idCara]][1] + 1);
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][2][0] + 1);
			chmin(dp[idCara][arrivee[idCara]][0], dp[idCara - 1][2][1] + 1);
			
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][arrivee[idCara]][0] + 1);
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][arrivee[idCara]][1]);
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][!arrivee[idCara]][0] + 2);
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][!arrivee[idCara]][1] + 1);
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][2][0] + 2);
			chmin(dp[idCara][arrivee[idCara]][1], dp[idCara - 1][2][1] + 1);
			
			for (int idDelta = 0; idDelta < 3; ++idDelta)
				for (int idChange = 0; idChange < 2; ++ idChange)
				{
					if (arrivee[idCara] == depart[idCara])
						chmin(dp[idCara][2][0], dp[idCara - 1][idDelta][idChange]);
					else
						chmin(dp[idCara][2][1], dp[idCara - 1][idDelta][idChange] + 1 - idChange);
				}
		}
	}
	
	int mini = 1e6 + 10;
	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < 2; ++j)
			chmin(mini, dp[lenChaine - 1][i][j]);
	
	cout << mini << endl;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 165 ms 29772 KB Output is correct
8 Correct 160 ms 29864 KB Output is correct
9 Correct 159 ms 29860 KB Output is correct
10 Correct 157 ms 29844 KB Output is correct
11 Correct 157 ms 29796 KB Output is correct
12 Correct 156 ms 29796 KB Output is correct
13 Correct 162 ms 29864 KB Output is correct
14 Correct 190 ms 29916 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -