# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365430 | tfg | parentrises (BOI18_parentrises) | C++17 | 91 ms | 110700 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
bool good(const std::string &str) {
int bal = 0;
for(auto ch : str) {
bal += ch == '(' ? 1 : -1;
if(bal < 0) return false;
}
return bal == 0;
}
void solve1() {
int t;
std::cin >> t;
while(t--) {
std::string str;
std::cin >> str;
int n = (int) str.size();
std::vector<int> pos[2];
std::vector<int> col(n, 3);
int bst = 0, sum = 0;
for(int i = 0; i < n; i++) {
pos[str[i] == '('].push_back(i);
sum += str[i] == '(' ? 1 : -1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |