oj.uz

Submission #789067

# Submission time Handle Problem Language Result Execution time Memory
789067 2023-07-21T00:59:25 Z tvladm2009 Street Lamps (APIO19_street_lamps) C++17
60 / 100
 223 ms 39076 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = (int) 3e5 + 7;
int sol[107][107];
int n, q;
string s;

struct Operation {
  bool type;
  int a;
  int b;
};

vector<Operation> op;

int subtask() {
  if (n <= 100 && q <= 100) {
    return 1;
  }
  for (auto &it : op) {
    if (it.type == 1 && it.b - it.a != 1) {
      return 3;
    }
  }
  return 2;
}

int nodes = 0;

struct DSU { /// partially persistent dsu
  vector<vector<pair<int, int>>> par;
  int time = 0;
  DSU(int n) : par(n + 1, {{-1, 0}}) {

  }

  bool unite(int u, int v) {
    time++;
    if ((u = root(u, time)) == (v = root(v, time))) return 0;
    if (par[u].back().first > par[v].back().first) {
      swap(u, v);
    }
    par[u].push_back({par[u].back().first + par[v].back().first, time});
    par[v].push_back({u, time});
    return 1;
  }

  bool same(int u, int v, int t) {
    return root(u, t) == root(v, t);
  }

  int root(int u, int t) { /// root of u at time t
    if (par[u].back().first >= 0 && par[u].back().second <= t) {
      return root(par[u].back().first, t);
    }
    return u;
  }

  int size(int u, int t) { /// size of the component of u at time t
    u = root(u, t);
    int low = 0, high = (int) par[u].size() - 1, ans = 0;
    while (low <= high) {
      int mid = (low + high) / 2;
      if (par[u][mid].second <= t) {
        ans = mid;
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
    return -par[u][ans].first;
  }
};

int a[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  // freopen("input", "r", stdin);

  cin >> n >> q >> s;
  s = "#" + s;
  for (int iq = 1; iq <= q; iq++) {
    string t;
    cin >> t;
    if (t == "toggle") {
      int a;
      cin >> a;
      op.push_back({0, a, -1});
    } else {
      int a, b;
      cin >> a >> b;
      op.push_back({1, a, b});
    }
  }
  if (subtask() == 1) {
    for (int i = 1; i <= n; i++) {
      if (s[i] == '1') {
        int j = i;
        while (j <= n && s[j] == '1') {
          sol[i][j + 1]++;
          j++;
        }
      }
    }
    for (auto &it : op) {
      if (it.type == 1) {
        cout << sol[it.a][it.b] << "\n";
      } else {
        int pos = it.a;
        s[pos] ^= '0' ^ '1';
      }

      for (int i = 1; i <= n; i++) {
        if (s[i] == '1') {
          int j = i;
          while (j <= n && s[j] == '1') {
            sol[i][j + 1]++;
            j++;
          }
        }
      }
    }
    return 0;
  }
  if (subtask() == 2) {
    vector<vector<pair<int, int>>> active(n + 1);
    for (int i = 1; i <= n; i++) {
      if (s[i] == '1') {
        active[i].push_back({0, -1});
      }
    }
    for (int i = 0; i < q; i++) {
      if (op[i].type == 0) {
        int pos = op[i].a;
        if (s[pos] == '0') {
          s[pos] = '1';
          active[pos].push_back({i + 1, -1});
        } else {
          s[pos] = '0';
          active[pos].back().second = i;
        }
      }
    }
    vector<vector<int>> sp(n + 1);
    for (int i = 1; i <= n; i++) {
      if (s[i] == '1') {
        active[i].back().second = q;
      }
      if ((int) active[i].size() == 0) {
        continue;
      }
      sp[i].resize((int) active[i].size());
      sp[i][0] = active[i][0].second - active[i][0].first + 1;
      for (int j = 1; j < (int) active[i].size(); j++) {
        sp[i][j] = sp[i][j - 1] + active[i][j].second - active[i][j].first + 1;
      }
    }
    function<int(int, int)> get = [&](int pos, int t) {
      int low = 0, high = (int) active[pos].size() - 1, x = -1;
      while (low <= high) {
        int mid = (low + high) / 2;
        if (active[pos][mid].second <= t) {
          low = mid + 1;
          x = mid;
        } else {
          high = mid - 1;
        }
      }
      int sol = 0;
      if (x != -1) {
        sol += sp[pos][x];
      }
      if (x + 1 < (int) active[pos].size() && active[pos][x + 1].first <= t) {
        sol += t - active[pos][x + 1].first + 1;
      }
      return sol;
    };
    for (int i = 0; i < q; i++) {
      if (op[i].type == 1) {
        assert(op[i].a + 1 == op[i].b);
        cout << get(op[i].a, i) << "\n";
      }
    }
    return 0;
  }
  if (subtask() == 3) {
    DSU t(n + 1);
    for (int i = 1; i <= n; i++) {
      if (s[i] == '1') {
        t.unite(i, i + 1);
        a[t.time] = 1;
      }
    }
    for (int i = 2; i <= q + 1; i++) {
      if (op[i - 2].type == 0) {
        t.unite(op[i - 2].a, op[i - 2].a + 1);
        a[t.time] = i;
      } else {
        int low = 0, high = t.time, sol = -1;
        while (low <= high) {
          int mid = (low + high) / 2;
          if (t.same(op[i - 2].a, op[i - 2].b, mid)) {
            sol = a[mid];
            high = mid - 1;
          } else {
            low = mid + 1;
          }
        }
        if (sol == -1) {
          cout << "0\n";
        } else {
          cout << i - sol << "\n";
        }
      }
    }
    return 0;
  }
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 6608 KB Output is correct
2 Correct 79 ms 6608 KB Output is correct
3 Correct 69 ms 6508 KB Output is correct
4 Correct 140 ms 32036 KB Output is correct
5 Correct 130 ms 37960 KB Output is correct
6 Correct 117 ms 32540 KB Output is correct
7 Correct 84 ms 19572 KB Output is correct
8 Correct 144 ms 39076 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 143 ms 32368 KB Output is correct
6 Correct 188 ms 33116 KB Output is correct
7 Correct 184 ms 33508 KB Output is correct
8 Correct 221 ms 36112 KB Output is correct
9 Correct 56 ms 6900 KB Output is correct
10 Correct 61 ms 9632 KB Output is correct
11 Correct 62 ms 9788 KB Output is correct
12 Correct 112 ms 27040 KB Output is correct
13 Correct 223 ms 36112 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 63 ms 6608 KB Output is correct
9 Correct 79 ms 6608 KB Output is correct
10 Correct 69 ms 6508 KB Output is correct
11 Correct 140 ms 32036 KB Output is correct
12 Correct 130 ms 37960 KB Output is correct
13 Correct 117 ms 32540 KB Output is correct
14 Correct 84 ms 19572 KB Output is correct
15 Correct 144 ms 39076 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 143 ms 32368 KB Output is correct
21 Correct 188 ms 33116 KB Output is correct
22 Correct 184 ms 33508 KB Output is correct
23 Correct 221 ms 36112 KB Output is correct
24 Correct 56 ms 6900 KB Output is correct
25 Correct 61 ms 9632 KB Output is correct
26 Correct 62 ms 9788 KB Output is correct
27 Correct 112 ms 27040 KB Output is correct
28 Correct 223 ms 36112 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Incorrect 1 ms 340 KB Output isn't correct
31 Halted 0 ms 0 KB -