| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354573 | SulA | Xylophone (JOI18_xylophone) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define popcount __builtin_popcount
#define all(a) (a).begin(), (a).end()
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T,null_type,less_equal<>,rb_tree_tag,tree_order_statistics_node_update>;
int query(int l, int r);
void answer(int i, int ai);
void solve(int n) {
int dif[n+1];
for (int i = 1; i < n; i++) {
dif[i] = query(i, i+1);
}
int comp[n+1];
comp[1] = 1;
for (int i = 2; i < n; i++) {
comp[i] = comp[i-1];
if (dif[i-1] + dif[i] != query(i-1, i+1))
comp[i] *= -1;
}
int a[n+1];
a[1] = 1;
for (int i = 1; i < n; i++)
a[i+1] = a[i] + comp[i]*dif[i];
int mn = *min_element(a+1, a+n+1);
for (int i = 1; i <= n; i++)
a[i] += 1 - mn;
int p1 = find(a+1, a+n+1, 1) - a;
int pn = find(a+1, a+n+1, n) - a;
if (p1 > pn) {
for (int i = 1; i <= n; i++) {
a[i] = n+1 - a[i];
}
}
for (int i = 1; i <= n; i++)
answer(i, a[i]);
}
int a[] = { 0, 2, 1, 5, 6, 3, 4 };
int query(int l, int r) {
int res = *max_element(a + l, a + r + 1) - *min_element(a + l, a + r + 1);
cout<<l<<' '<<r<<' '<<res<<'\n';
return res;
}
void answer(int i, int ai) { cout << i << " " << ai << endl; }
// int main() {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// int n; cin >> n;
// solve(n);
// }