oj.uz

Submission #784229

# Submission time Handle Problem Language Result Execution time Memory
784229 2023-07-15T21:39:00 Z tvladm2009 Xylophone (JOI18_xylophone) C++17
47 / 100
 85 ms 896 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

map<pair<int, int>, int> mp;

int ask(int l, int r) {
  if (mp.count({l, r}) > 0) {
    return mp[{l, r}];
  }
  int x = query(l, r);
  mp[{l, r}] = x;
  return x;
}
void solve(int n) {
  mp.clear();
  int mx = -1;
  int low = 1, high = n;
  while (low <= high) {
    int mid = (low + high) / 2;
    if (ask(1, mid) == n - 1) {
      mx = mid;
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  assert(mx != -1);
  vector<int> sol(n + 1, 0);
  vector<bool> used(n + 1, 0);
  sol[mx] = n;
  used[n] = 1;
  if (mx > 1) {
    sol[mx - 1] = sol[mx] - ask(mx - 1, mx);
    used[sol[mx - 1]] = 1;
  }
  for (int i = mx - 2; i >= 1; i--) {
    if (sol[i + 1] < sol[i + 2]) {
      int x = ask(i, i + 2);
      if (x != sol[i + 2] - sol[i + 1]) {
        ///its less than sol[i + 1] or greater than sol[i + 2]
        int delta = sol[i + 2] - x;
        if (1 <= delta && delta <= sol[i + 1] && used[delta] == 0 && sol[i + 1] - delta == ask(i, i + 1)) {
          sol[i] = delta;
          used[delta] = 1;
        } else {
          delta = sol[i + 1] + x;
          assert(sol[i + 2] <= delta && delta <= n && used[delta] == 0);
          used[delta] = 1;
          sol[i] = delta;
        }
      } else {
        int val = sol[i + 1] + ask(i, i + 1);
        assert(used[val] == 0);
        used[val] = 1;
        sol[i] = val;
      }
    } else { /// sol[i + 1] > sol[i + 2]
      int x = ask(i, i + 2);
      if (x != sol[i + 1] - sol[i + 2]) {
        ///its less than sol[i + 2] or greater than sol[i + 1]
        int delta = sol[i + 1] - x;
        if (delta >= 1 && delta <= sol[i + 2] && used[delta] == 0 && ask(i, i + 1) == x) {
          used[delta] = 1;
          sol[i] = delta;
        } else {
          delta = sol[i + 2] + x;
          assert(delta <= n && delta >= sol[i + 1] && used[delta] == 0);
          used[delta] = 1;
          sol[i] = delta;
        }
      } else {
        int val = sol[i + 1] - ask(i, i + 1);
        assert(used[val] == 0);
        used[val] = 1;
        sol[i] = val;
      }
    }
  }
  if (mx + 1 <= n) {
    sol[mx + 1] = sol[mx] - ask(mx, mx + 1);
    used[sol[mx + 1]] = 1;
  }
  for (int i = mx + 2; i <= n; i++) {
    if (i == mx) {
      continue;
    }
    if (sol[i - 1] > sol[i - 2]) {
      int x = ask(i - 2, i);
      if (x != sol[i - 1] - sol[i - 2]) {
        ///its less than sol[i - 2] or greater than sol[i - 1]
        int delta = sol[i - 2] + x;
        if (delta <= n && delta >= sol[i - 1] && used[delta] == 0 && delta - sol[i - 1] == ask(i - 1, i)) {
          sol[i] = delta;
          used[delta] = 1;
        } else {
          sol[i] = sol[i - 1] - x;
          assert(1 <= sol[i] && sol[i] < sol[i - 2] && used[sol[i]] == 0);
          used[sol[i]] = 1;
        }
      } else {
        int val = sol[i - 1] - ask(i - 1, i);
        sol[i] = val;
        assert(used[val] == 0);
        used[val] = 1;
      }
    } else { /// sol[i - 2] > sol[i - 1]
      int x = ask(i - 2, i);
      if (x != sol[i - 2] - sol[i - 1]) {
        ///its less than sol[i - 1] or greater than sol[i - 2]
        int delta = sol[i - 1] + x;
        if (delta <= n && delta >= sol[i - 2] && used[delta] == 0 && delta - sol[i - 1] == ask(i - 1, i)) {
          sol[i] = delta;
          used[delta] = 1;
        } else {
          sol[i] = sol[i - 2] - x;
          assert(1 <= sol[i] && sol[i] < sol[i - 1] && used[sol[i]] == 0);
          used[sol[i]] = 1;
        }
      } else {
        int val = sol[i - 1] + ask(i - 1, i);
        assert(used[val] == 0);
        used[val] = 1;
        sol[i] = val;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    answer(i, sol[i]);
  }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 300 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 300 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 300 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 300 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 12 ms 368 KB Output is correct
19 Correct 12 ms 340 KB Output is correct
20 Correct 19 ms 340 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 300 KB Output is correct
23 Correct 16 ms 404 KB Output is correct
24 Correct 18 ms 360 KB Output is correct
25 Correct 17 ms 336 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 10 ms 336 KB Output is correct
28 Correct 16 ms 340 KB Output is correct
29 Correct 15 ms 340 KB Output is correct
30 Correct 16 ms 360 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 300 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 2 ms 308 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 300 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 336 KB Output is correct
18 Correct 12 ms 368 KB Output is correct
19 Correct 12 ms 340 KB Output is correct
20 Correct 19 ms 340 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 7 ms 300 KB Output is correct
23 Correct 16 ms 404 KB Output is correct
24 Correct 18 ms 360 KB Output is correct
25 Correct 17 ms 336 KB Output is correct
26 Correct 17 ms 340 KB Output is correct
27 Correct 10 ms 336 KB Output is correct
28 Correct 16 ms 340 KB Output is correct
29 Correct 15 ms 340 KB Output is correct
30 Correct 16 ms 360 KB Output is correct
31 Correct 23 ms 440 KB Output is correct
32 Correct 29 ms 648 KB Output is correct
33 Correct 53 ms 784 KB Output is correct
34 Correct 77 ms 872 KB Output is correct
35 Correct 85 ms 760 KB Output is correct
36 Incorrect 55 ms 896 KB Wrong Answer [2]
37 Halted 0 ms 0 KB -