QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#63925 | #5108. Prehistoric Programs | Noobie_99 | WA | 7ms | 6164kb | C++20 | 1.6kb | 2022-11-23 18:19:23 | 2022-11-23 18:19:26 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[" << __LINE__ << ' ' << #x << "]: " << (x) << endl
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<tuple<int, int, string, int>> a, b;
for (int i=0; i<n; i++) {
string s;
cin >> s;
int cur = 0, mn = 0, mx = 0;
for (char c : s) {
if (c == '(') cur++;
else cur--;
mn = min(mn, cur);
mx = min(mx, cur);
}
if (cur >= 0) a.emplace_back(mn, cur, s, i);
else b.emplace_back(-mx, -cur, s, i);
}
sort(a.begin(), a.end(), [&](auto& x, auto& y) {
if (get<0>(x) != get<0>(y)) return get<0>(x) > get<0>(y);
return get<1>(x) > get<1>(y);
});
sort(b.begin(), b.end(), [&](auto& x, auto& y) {
if (get<0>(x) != get<0>(y)) return get<0>(x) < get<0>(y);
return get<1>(x) < get<1>(y);
});
vector<int> ans;
int cur = 0;
bool flag = true;
for (auto& [x, _, y, z] : a) {
for (char c : y) {
if (c == '(') cur++;
else cur--;
if (cur < 0) flag = false;
}
ans.push_back(z);
}
for (auto& [x, _, y, z] : b) {
for (char c : y) {
if (c == '(') cur++;
else cur--;
if (cur < 0) flag = false;
}
ans.push_back(z);
}
if (cur != 0 || !flag) cout << "impossible\n";
else {
for (int e : ans) cout << e+1 << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 7ms
memory: 6164kb
input:
50000 ( ( ))))()))()(()))()()()))()(((((()(((()))()(((()))((()(())))))(()( ) ( ) ((( ( ( ( ( ( () ( ) ( )((())()(( )))))( ( ) )) )() ( ) ) )()( ( ( () ( ) ( )()((((())()))())( ( ( )( ( ( (()())()) ) ) ( ( ( )((())))((())))))))))((((()()))()))))))))((()())())) ) )() ) ) ) ) ) ())(())))))()(()((()(())...
output:
impossible
result:
wrong answer you didn't find a solution but jury did