Submission #918519

#TimeUsernameProblemLanguageResultExecution timeMemory
918519viwlesxqXylophone (JOI18_xylophone)C++17
Compilation error
0 ms0 KiB
#include "xylophone.h" #include <bits/stdc++.h> using namespace std; #define int long long #define all(x) x.begin(), x.end() #define size(x) (int)x.size() template<class S, class T> bool chmin(S &a, const T &b) { return a > b && (a = b) == b; } template<class S, class T> bool chmax(S &a, const T &b) { return a < b && (a = b) == b; } const int inf = 1e9 + 7; const int INF = 1e18 + 7; const int mod = 1e9 + 7; void solve(int n) { vector<int> a(n); int min = 0, max = n - 1; for (int i = 1; i < n; ++i) { if (query(i + 1, n) != n - 1) break; min = i; } for (int i = n - 2; i >= 0; --i) { if (query(1, i + 1) != n - 1) break; max = i; } a[min] = 1, a[max] = n; int last = min, val = 0; bool increasing = true; for (int i = min - 1; i >= 0; --i) { int diff = query(i + 1, last + 1); if (diff == val) { last = i + 1; diff = query(i + 1, last + 1); increasing ^= true; } a[i] = a[last] + (increasing ? diff : -diff); val = diff; } last = min, val = 0; increasing = true; for (int i = min + 1; i < max; ++i) { int diff = query(last + 1, i + 1); if (diff == val) { last = i + 1; diff = query(last + 1, i + 1); increasing ^= true; } a[i] = a[last] + (increasing ? diff : -diff); val = diff; } last = max, val = 0; increasing = false; for (int i = max + 1; i < n; ++i) { int diff = query(last + 1, i + 1); if (diff == val) { last = i - 1; diff = query(last + 1, i + 1); increasing ^= true; } a[i] = a[last] + (increasing ? diff : -diff); val = diff; } for (int i = 0; i < n; ++i) { answer(i + 1, a[i]); } }

Compilation message (stderr)

/usr/bin/ld: /tmp/ccn6fy1o.o: in function `main':
grader.cpp:(.text.startup+0x30): undefined reference to `solve(int)'
collect2: error: ld returned 1 exit status