oj.uz

답안 #144974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144974 2019-08-18T10:08:05 Z emilem Zagrade (COI17_zagrade) C++14
0 / 100
 859 ms 20792 KB 
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

long long ans;
int n;
int op, clos;
string path;
vector< vector<int> > nei;
string a;

long long Chain(const string& a)
{
	vector< pair<int, int> > pref(a.length());
	for (int i = 0; i < pref.size(); ++i)
	{
		pref[i].second = i;
		if (a[i] == '(') ++pref[i].first;
		else --pref[i].first;
		if (i) pref[i].first += pref[i - 1].first;
	}
	vector<int> r(n);
	for (int i = 0; i < n; ++i)
	{
		r[i] = -1;
		int minElem = pref[i].first;
		for (int j = i; j < n; ++j)
		{
			minElem = min(minElem, pref[j].first);
			if (minElem - (i ? pref[i - 1].first : 0) < 0)
				break;
			else
				r[i] = j;
		}
	}
	sort(pref.begin(), pref.end());
	for (int i = 0; i < n; ++i)
		if (r[i] != -1)
			for (int j = i; j < n && pref[j].second <= r[i]; ++j)
				if (pref[j].first == (i ? pref[i - 1].first : 0))
					++ans;
				else
					break;
	return 0;
}
void Dfs(int v, int par)
{
	if (op == clos && a[v] == ')')
		return;
	if (a[v] == ')') ++clos;
	else ++op;
	path += a[v];
	if (clos == op)
		++ans;
	for (int i = 0; i < nei[v].size(); ++i)
	{
		int to = nei[v][i];
		if (to == par) continue;
		Dfs(to, v);
	}
	path.pop_back();
	if (a[v] == ')') --clos;
	else --op;
}
int main()
{
	cin >> n;
	nei.resize(n);
	cin >> a;
	for (int i = 1; i < n; ++i)
	{
		int u, v;
		cin >> u >> v; --u; --v;
		nei[u].push_back(v);
		nei[v].push_back(u);
	}
	if (false/*n <= 1000*/)
	{
		for (int v = 0; v < n; ++v)
		{
			op = clos = 0;
			path = "";
			Dfs(v, -1);
		}
		cout << ans << endl;
		return 0;
	}
	else // Is a chain.
	{
		ans += Chain(a);
		reverse(a.begin(), a.end());
		ans += Chain(a);
		cout << ans << endl;

		char I;
		cin >> I;
	}

	char I;
	cin >> I;
}

Compilation message

zagrade.cpp: In function 'long long int Chain(const string&)':
zagrade.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < pref.size(); ++i)
                  ~~^~~~~~~~~~~~~
zagrade.cpp:40:6: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if (r[i] != -1)
      ^
zagrade.cpp: In function 'void Dfs(int, int)':
zagrade.cpp:57:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < nei[v].size(); ++i)
                  ~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 60.0

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