Submission #3376933
Source Code Expand
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
/* ---------- container ---------- */
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define gsort(b, e) sort(b, e, greater<decltype(*b)>())
#define SORT(v) sort((v).begin(), (v).end())
#define GSORT(v) sort((v).begin(), (v).end(), greater<decltype((v).front())>())
/* ----------- debug ---------- */
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
os << "[";
for (auto vv : v)
os << vv << ",";
return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
return os << "(" << p.fst << "," << p.snd << ")";
}
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// mt19937 mt(LL(time(0)));
/* ---------- Short Functions ---------- */
template <typename T>
T sq(T a) {
return a * a;
}
template <typename T>
T gcd(T a, T b) {
if (a > b) return gcd(b, a);
return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
if (n == 0) return 1;
if (n == 1) return b /* % MOD */;
if (n % 2 == 0) {
return mypow(b * b /* % MOD */, n / 2);
} else {
return mypow(b, n - 1) * b /* % MOD */;
}
}
ll pcnt(ll b) {
return __builtin_popcountll(b);
}
/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */
int main() {
string S;
cin >> S;
int N = S.size();
set<int> change;
for (int q = 0; q < 1000; ++q) {
int cnt = 0;
for (char c : S) {
cnt += (c == '(' ? 1 : -1);
if (cnt < 0) break;
}
if (cnt < 0) {
for (int i = 0; i < N; ++i) {
if (S[i] == ')') {
S[i] = '(';
change.insert(i);
break;
}
}
} else if (cnt > 0) {
cnt = 0;
int front = -1;
for (int i = 0; i < N; ++i) {
cnt += (S[i] == '(' ? 1 : -1);
if (cnt == 0) {
front = i;
}
}
cnt = 0;
int idx = -1;
for (int i = front + 1; i < N; ++i) {
cnt += (S[i] == '(' ? 1 : -1);
if (idx < 0 && S[i] == '(' && cnt > 1) idx = i;
if (cnt <= 1) idx = -1;
}
change.insert(idx);
S[idx] = ')';
} else {
break;
}
}
cout << change.size() + *change.rbegin() << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 天下一魔力発電 |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4093 Byte |
Status |
RE |
Exec Time |
97 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 400 |
Status |
|
Set Name |
Test Cases |
All |
01_sample_01, 01_sample_02, 01_sample_03, 02_manual_01, 02_manual_02, 02_manual_03, 10_random_00, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 10_random_10, 10_random_11, 10_random_12, 10_random_13, 10_random_14, 10_random_15, 10_random_16, 10_random_17, 10_random_18, 10_random_19, 20_max_00, 20_max_01, 20_max_02, 20_max_03, 20_max_04, 20_max_05 |
Case Name |
Status |
Exec Time |
Memory |
01_sample_01 |
AC |
1 ms |
256 KB |
01_sample_02 |
AC |
1 ms |
256 KB |
01_sample_03 |
AC |
1 ms |
256 KB |
02_manual_01 |
AC |
1 ms |
256 KB |
02_manual_02 |
AC |
1 ms |
256 KB |
02_manual_03 |
AC |
1 ms |
256 KB |
10_random_00 |
AC |
1 ms |
256 KB |
10_random_01 |
AC |
1 ms |
256 KB |
10_random_02 |
AC |
1 ms |
256 KB |
10_random_03 |
AC |
1 ms |
256 KB |
10_random_04 |
AC |
1 ms |
256 KB |
10_random_05 |
AC |
1 ms |
256 KB |
10_random_06 |
AC |
1 ms |
256 KB |
10_random_07 |
AC |
1 ms |
256 KB |
10_random_08 |
AC |
1 ms |
256 KB |
10_random_09 |
AC |
1 ms |
256 KB |
10_random_10 |
AC |
1 ms |
256 KB |
10_random_11 |
AC |
1 ms |
256 KB |
10_random_12 |
AC |
1 ms |
256 KB |
10_random_13 |
AC |
1 ms |
256 KB |
10_random_14 |
AC |
1 ms |
256 KB |
10_random_15 |
AC |
1 ms |
256 KB |
10_random_16 |
AC |
1 ms |
256 KB |
10_random_17 |
AC |
1 ms |
256 KB |
10_random_18 |
AC |
1 ms |
256 KB |
10_random_19 |
AC |
1 ms |
256 KB |
20_max_00 |
AC |
1 ms |
256 KB |
20_max_01 |
AC |
1 ms |
256 KB |
20_max_02 |
AC |
1 ms |
256 KB |
20_max_03 |
RE |
97 ms |
256 KB |
20_max_04 |
RE |
97 ms |
256 KB |
20_max_05 |
AC |
1 ms |
256 KB |