oj.uz

Submission #931582

# Submission time Handle Problem Language Result Execution time Memory
931582 2024-02-22T06:08:26 Z vjudge1 Zagrade (COI17_zagrade) C++17
10 / 100
 3000 ms 47832 KB 
/// ITNOG
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

constexpr int MOD = 1e9 + 7, N = 3e5 + 8, M = 1e6, SQ = 600, INF = 1e15 + 8, LGN = 22, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, ans;
string s;
vector <int> r;
vector <int> adj[N];

void dfs (int u, int par = -1){
  r.pb(s[u]);
  for (int i : adj[u]){
    if (i != par){
      dfs (i, u);
    }
  }
  vector <int> tmp;
  for (int i = 0; i < r.size(); ++ i){
    if (tmp.size() && tmp.back() == '(' && r[i] == ')'){
      tmp.ppb();
    }
    else {
      tmp.pb(r[i]);
    }
  }
  if (tmp.size() == 0){
    ++ ans;
  }
  r.ppb();
}

int32_t main(){
  fast_io;
  cin >> n >> s;
  FOR (i, 0, n - 1){
    int aa, bb;
    cin >> aa >> bb;
    adj[--aa].pb(--bb);
    adj[bb].pb(aa);
  }
  FOR (i, 0, n){
    dfs (i);
  }
  cout << ans;
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Compilation message

zagrade.cpp: In function 'void dfs(long long int, long long int)':
zagrade.cpp:59:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for (int i = 0; i < r.size(); ++ i){
      |                   ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 7536 KB Output is correct
2 Correct 130 ms 7516 KB Output is correct
3 Correct 116 ms 7516 KB Output is correct
4 Correct 130 ms 7516 KB Output is correct
5 Correct 126 ms 7532 KB Output is correct
6 Correct 133 ms 7516 KB Output is correct
7 Correct 126 ms 7532 KB Output is correct
8 Correct 122 ms 7536 KB Output is correct
9 Correct 125 ms 7512 KB Output is correct
10 Correct 66 ms 7536 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3061 ms 47832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 7536 KB Output is correct
2 Correct 130 ms 7516 KB Output is correct
3 Correct 116 ms 7516 KB Output is correct
4 Correct 130 ms 7516 KB Output is correct
5 Correct 126 ms 7532 KB Output is correct
6 Correct 133 ms 7516 KB Output is correct
7 Correct 126 ms 7532 KB Output is correct
8 Correct 122 ms 7536 KB Output is correct
9 Correct 125 ms 7512 KB Output is correct
10 Correct 66 ms 7536 KB Output is correct
11 Execution timed out 3061 ms 47832 KB Time limit exceeded
12 Halted 0 ms 0 KB -