oj.uz

Submission #931596

# Submission time Handle Problem Language Result Execution time Memory
931596 2024-02-22T06:24:04 Z vjudge1 Zagrade (COI17_zagrade) C++17
0 / 100
 62 ms 19428 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, ps[N];
string s;
vector <int> adj[N];

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);
  }
  ps[0] = (s[0] == '(' ? 1 : -1);
  for (int i = 1; i < s.size(); ++ i){
    ps[i] = ps[i-1] + (s[i] == '(' ? 1 : -1);
  }
  vector <pii> r;
  r.pb({0, 1});
  for (int i = 0; i < n; ++ i){
    while (r.size() && r.back().F > ps[i]){
      r.ppb();
    }
    if (r.size() && r.back().F == ps[i + 1]){
      ans += r.back().S;
      //cout << r.back().F << " " << r.back().S << '\n';
      pii p = r.back();
      r.ppb();
      ++ p.S;
      r.pb(p);
    }
    else {
      r.pb({ps[i], 1});
    }
  }
  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 'int32_t main()':
zagrade.cpp:60:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for (int i = 1; i < s.size(); ++ i){
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 8796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 19428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 8796 KB Output isn't correct
2 Halted 0 ms 0 KB -