Submission #1679190


Source Code Expand

//#include "IntMod.h"
//typedef IntMod<1000000007> MInt;

//#include "Union_Find.h"

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <list>
#include <bitset>

using namespace std;
#define REP(i,a,n) for(int i = (a); i < (int)(n); ++i)
#define REPM(i,n,a) for(int i = ((n) - 1); i >= (a); --i)
#define EPS 1e-11
#define INF 0x3FFFFFFF
#define INFLL 0x3FFFFFFF3FFFFFFF
#define INFD 1.0e+308
#define FLOAT setprecision(16)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;

template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(begin(dest), end(dest), val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
//sum, 累積和
// 負のときの割り算に注意
#if 1
#include <array>
#include <unordered_set>
#include <unordered_map>
template<class T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
#endif

//#include "Union_Find.h"
//#include "Graph.h"

int N;
string S;
int DP[512][513];
int main() {
	cin >> N >> S;

	for(int len = 2; len <= N * 2; len += 2) {
		REP(i, 0, N * 2){
			int j = i + len;
			if (j > N * 2) continue;
			if (len == 2) { DP[i][j] = (S[i] != S[i + 1] ? 0 : INF); continue; }
			DP[i][j] = INF;
			if (S[i] + S[j - 1] == '0' + '1') DP[i][j] = min(DP[i][j], DP[i + 1][j - 1] + 1);
			for (int k = i + 2; k < j; k += 2) {
				DP[i][j] = min(DP[i][j], DP[i][k] + DP[k][j]);
			}
		}
	}
 	cout << DP[0][N * 2] << endl;
	return 0;
}

Submission Info

Submission Time
Task C - 寿司タワー
User Aquarius
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2195 Byte
Status AC
Exec Time 15 ms
Memory 1280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 20
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 15 ms 1280 KB
01-06.txt AC 15 ms 1280 KB
01-07.txt AC 15 ms 1280 KB
01-08.txt AC 14 ms 1280 KB
01-09.txt AC 14 ms 1280 KB
01-10.txt AC 14 ms 1280 KB
01-11.txt AC 14 ms 1280 KB
01-12.txt AC 15 ms 1280 KB
01-13.txt AC 14 ms 1280 KB
01-14.txt AC 15 ms 1280 KB
01-15.txt AC 15 ms 1280 KB
01-16.txt AC 3 ms 768 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB