oj.uz

Submission #915091

# Submission time Handle Problem Language Result Execution time Memory
915091 2024-01-23T10:28:30 Z OAleksa Xylophone (JOI18_xylophone) C++14
0 / 100
 1 ms 592 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5069;
int ans[MAXN], vis[MAXN];
void solve(int N) {
  int n = N;
	int l = 1, r = n, mx = -1;
	while (l <= r) {
    int mid = (l + r) / 2;
    if (query(1, mid) == n - 1) {
      mx = mid;
      r = mid - 1;
    }
    else
      l = mid + 1;
	}
	assert(mx != -1);
	ans[mx] = n;
	vis[n] = 1;
	if (mx < n) {
    int x = query(mx, mx + 1);
    ans[mx + 1] = n - x;
    vis[n - x] = 1;
	}
  if (mx > 1) {
    int x = query(mx - 1, mx);
    ans[mx - 1] = n - x;
    vis[n - x] = 1;
  }
  for (int i = mx - 2;i >= 1;i--) {
    int x = query(i, i + 1);
    if (ans[i + 1] + x > n || vis[ans[i + 1] + x]) {
      ans[i] = ans[i + 1] - x;
      vis[ans[i + 1] - x] = 1;
    }
    else if (ans[i + 1] - x < 1 || vis[ans[i + 1] - x]) {
      ans[i] = ans[i + 1] + x;
      vis[ans[i + 1] + x] = 1;
    }
    else {
      int y = query(i, i + 2);
      if ((y != x && ans[i + 2] < ans[i + 1]) || (y == x && ans[i + 2] > ans[i + 1]))  {
        ans[i] = ans[i + 1] + x;
        vis[ans[i + 1] + x] = 1;
      }
      else {
        ans[i] = ans[i + 1] - x;
        vis[ans[i + 1] - x] = 1;
      }
    }
  }
  for (int i = mx + 2;i <= n;i++) {
    int x = query(i - 1, i);
    if (ans[i - 1] + x > n || vis[ans[i - 1] + x]) {
      ans[i] = ans[i - 1] - x;
     // vis[ans[i - 1] - x] = 1;
    }
    else if (ans[i - 1] - x < 1 || vis[ans[i - 1] - x]) {
      ans[i] = ans[i - 1] + x;
      vis[ans[i - 1] + x] = 1;
    }
    else {
      int y = query(i - 2, i);
      if ((y != x && ans[i - 2] < ans[i - 1]) || (y == x && ans[i - 2] > ans[i - 1]))  {
        ans[i] = ans[i - 1] + x;
        vis[ans[i - 1] + x] = 1;
      }
      else {
        ans[i] = ans[i - 1] - x;
        vis[ans[i - 1] - x] = 1;
      }
    }
  }
	for(int i = 1; i <= n; i++) {
		answer(i, ans[i]);
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Incorrect 0 ms 440 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Incorrect 0 ms 440 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 592 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Incorrect 0 ms 440 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -