oj.uz

Submission #486196

# Submission time Handle Problem Language Result Execution time Memory
486196 2021-11-10T20:30:05 Z evenvalue Experimental Charges (NOI19_charges) C++17
100 / 100
 34 ms 2664 KB 
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;

class solution {
  using int64 = int64_t;
  using ld = long double;

  class dsu {
    vector<int> e;

    int find(const int x) {
      return (e[x] < 0 ? x : find(e[x]));
    }

  public:
    vector<int> opp;

    explicit dsu(const int n) : e(2 * n, -1), opp(2 * n) {
      for (int i = 0; i < n; i++) {
        opp[i] = i + n;
        opp[i + n] = i;
      }
    }

    bool unite_same(int x, int y) {
      x = find(x), y = find(y);
      if (x == y) return false;
      int opp_x = opp[x], opp_y = opp[y];
      if (e[y] < e[x]) swap(x, y);
      if (e[opp_y] < e[opp_x]) swap(opp_x, opp_y);
      e[x] += e[y];
      e[y] = x;
      e[opp_x] += e[opp_y];
      e[opp_y] = opp_x;
      opp[x] = opp_x;
      opp[opp_x] = x;
      return true;
    }

    bool unite_diff(int x, int y) {
      return unite_same(x, opp[y]);
    }

    bool same(const int x, const int y) {
      return (find(x) == find(y));
    }
  };

  void main() {
    const int n = readInt();
    int q = readInt();
    dsu d(n);
    while (q--) {
      const char type = readChar();
      const int x = readInt() - 1, y = readInt() - 1;
      if (type == 'Q') {
        if (const bool same = d.same(x, y), diff = d.same(x, d.opp[y]); same or diff) {
          print(same ? 'R' : 'A'), println();
        } else {
          print('?'), println();
        }
      } else if (type == 'R') {
        d.unite_same(x, y);
      } else {
        d.unite_diff(x, y);
      }
    }
  }
  
public:
  explicit solution() {
    main();
  }

private:
  //inputting stuff (cin)
  [[maybe_unused]] static int readInt() {
    int x;
    cin >> x;
    return x;
  }
  [[maybe_unused]] static int64 readInt64() {
    int64 x;
    cin >> x;
    return x;
  }
  [[maybe_unused]] static char readChar() {
    char c;
    cin >> c;
    return c;
  }
  [[maybe_unused]] static string readString() {
    string s;
    cin >> s;
    return s;
  }
  [[maybe_unused]] static double readDouble() {
    return stod(readString());
  }
  [[maybe_unused]] static ld readLongDouble() {
    return stold(readString());
  }
  template<typename T1, typename T2>
  [[maybe_unused]] static pair<T1, T2> readPair() {
    pair<T1, T2> p;
    cin >> p.first >> p.second;
    return p;
  }
  template<typename T>
  [[maybe_unused]] static vector<T> readVec(const int sz) {
    vector<T> v(sz);
    for (T &x : v) {
      cin >> x;
    }
    return v;
  }
  template<typename T>
  [[maybe_unused]] static vector<vector<T>> readVecVec(const int n, const int m) {
    vector<vector<T>> a(n);
    for (vector<T> &v : a) {
      v = readVec<T>(m);
    }
    return a;
  }

  //outputting stuff (cout)
  [[maybe_unused]] static void println() { cout << '\n'; }
  [[maybe_unused]] static void printsp() { cout << ' '; }
  [[maybe_unused]] static void print(const int x) { cout << x; }
  [[maybe_unused]] static void print(const unsigned int x) { print(int(x)); }
  [[maybe_unused]] static void print(const int64 x) { cout << x; }
  [[maybe_unused]] static void print(const double d, const int precision = 10) { cout << fixed << setprecision(precision) << d; }
  [[maybe_unused]] static void print(const ld d, const int precision = 10) { cout << fixed << setprecision(precision) << d; }
  [[maybe_unused]] static void print(const char c) { cout << c; }
  [[maybe_unused]] static void print(const string &s) { cout << s; }
  template<typename T1, typename T2>
  [[maybe_unused]] static void print(const pair<T1, T2> &p) { print(p.first), printsp(), print(p.second); }
  template<typename T>
  [[maybe_unused]] static void print(const vector<T> &v) {
    for (const T &x : v) {
      print(x), printsp();
    }
    println();
  }
  template<typename T>
  [[maybe_unused]] static void print(const vector<vector<T>> &a) {
    for (const vector<T> &v : a) {
      print(v);
    }
  }

  //debugging stuff (cerr)
  [[maybe_unused]] static void _println() { cerr << '\n'; }
  [[maybe_unused]] static void _printsp() { cerr << ' '; }
  [[maybe_unused]] static void _print(const int x) { cerr << x; }
  [[maybe_unused]] static void _print(const int64 x) { cerr << x; }
  [[maybe_unused]] static void _print(const unsigned int x) { cerr << x; }
  [[maybe_unused]] static void _print(const double d, const int precision = 10) { cerr << fixed << setprecision(precision) << d; }
  [[maybe_unused]] static void _print(const ld d, const int precision = 10) { cerr << fixed << setprecision(precision) << d; }
  [[maybe_unused]] static void _print(const char c) { cerr << '\'' << c << '\''; }
  [[maybe_unused]] static void _print(const string &s) { cerr << '\"' << s << '\"'; }
  template<typename T1, typename T2>
  [[maybe_unused]] static void _print(const pair<T1, T2> &p) {
    cerr << '[';
    _print(p.first);
    cerr << ", ";
    _print(p.second);
    cerr << ']';
  }
  template<typename T>
  [[maybe_unused]] static void _print(const vector<T> &v) {
    const int n = v.size();
    cerr << '{';
    for (int i = 0; i < n; i++) {
      _print(v[i]);
      cerr << (i != n - 1 ? ", " : "");
    }
    cerr << '}';
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);

  const auto begin = std::chrono::high_resolution_clock::now();

  //  freopen(".in", "r", stdin);
  //  freopen(".out", "w", stdout);

  int t = 1;
  //cin >> t;
  for (int tc = 1; tc <= t; tc++) {
    solution();
  }

  const auto end = std::chrono::high_resolution_clock::now();
  const auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
  cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 252 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2568 KB Output is correct
2 Correct 19 ms 2496 KB Output is correct
3 Correct 29 ms 2512 KB Output is correct
4 Correct 20 ms 2528 KB Output is correct
5 Correct 20 ms 2508 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2664 KB Output is correct
2 Correct 23 ms 2588 KB Output is correct
3 Correct 22 ms 2568 KB Output is correct
4 Correct 33 ms 2504 KB Output is correct
5 Correct 34 ms 2624 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2540 KB Output is correct
2 Correct 33 ms 2536 KB Output is correct
3 Correct 23 ms 2440 KB Output is correct
4 Correct 27 ms 2604 KB Output is correct
5 Correct 25 ms 2508 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 252 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 252 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 20 ms 2568 KB Output is correct
7 Correct 19 ms 2496 KB Output is correct
8 Correct 29 ms 2512 KB Output is correct
9 Correct 20 ms 2528 KB Output is correct
10 Correct 20 ms 2508 KB Output is correct
11 Correct 21 ms 2664 KB Output is correct
12 Correct 23 ms 2588 KB Output is correct
13 Correct 22 ms 2568 KB Output is correct
14 Correct 33 ms 2504 KB Output is correct
15 Correct 34 ms 2624 KB Output is correct
16 Correct 22 ms 2540 KB Output is correct
17 Correct 33 ms 2536 KB Output is correct
18 Correct 23 ms 2440 KB Output is correct
19 Correct 27 ms 2604 KB Output is correct
20 Correct 25 ms 2508 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 21 ms 2624 KB Output is correct
27 Correct 26 ms 2572 KB Output is correct
28 Correct 26 ms 2492 KB Output is correct
29 Correct 21 ms 2512 KB Output is correct
30 Correct 23 ms 2552 KB Output is correct