Submission #777014

#TimeUsernameProblemLanguageResultExecution timeMemory
777014CookieArt Collections (BOI22_art)C++17
Compilation error
0 ms0 KiB
#include<bits/stdc++.h> #include<fstream> using namespace std; ifstream fin("HAMMING.INP"); ofstream fout("HAMMING.OUT"); #define sz(a) (int)a.size() #define ll long long #define pb push_back #define forr(i, a, b) for(int i = a; i < b; i++) #define dorr(i, a, b) for(int i = a; i >= b; i--) #define ld long double #define vt vector #include<fstream> #define fi first #define se second #define pll pair<ll, ll> #define pii pair<int, int> const ld PI = 3.14159265359; using u128 = __uint128_t; const int x[4] = {1, -1, 0, 0}; const int y[4] = {0, 0, 1, -1}; const ll mod = 1e18 + 7, inf = 1e9 + 5; const int mxn = 2e5 + 5, sq = 400; void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) { va_list args; va_start(args, msg); vfprintf(stdout, msg, args); fprintf(stdout, "\n"); va_end(args); exit(0); } namespace { int N; int Q = 0; const int MAX_Q = 4000; const int MAX_N = 4000; vector<int> solution; } // namespace int publish(vector<int> R) { printf("publish({"); for(int i = 0; i < int(R.size()); ++i) { if(i == 0) printf("%d", R[i]); else printf(", %d", R[i]); } printf("})\n"); fflush(stdout); if (++Q > MAX_Q) result("Too many published rankings!"); if (int(R.size()) != N) result("Invalid published ranking!"); set<int> chosen; for(auto &x : R) { if(x < 1 || x > N || chosen.count(x)) result("Invalid published ranking!"); chosen.insert(x); } vector<int> positions(N+1); for(int i = 0; i < N; ++i) positions[R[i]] = i; int complaints = 0; for(int i = 0; i < N; ++i) { for(int j = i+1; j < N; ++j) { if(positions[solution[i]] > positions[solution[j]]) ++complaints; } } return complaints; } void __attribute__((noreturn)) answer(vector<int> R) { printf("answer({"); for(int i = 0; i < int(R.size()); ++i) { if(i == 0) printf("%d", R[i]); else printf(", %d", R[i]); } printf("})\n"); fflush(stdout); if(R == solution) result("Correct: %d published ranking(s).", Q); else result("Wrong answer!"); } void solve(int n){ vt<int>curr; for(int i = 1; i <= n; i++){ curr.pb(i); } ll last = publish(curr); vt<bool>seen(n); vt<int>res(n); for(int i = 1; i < n; i++){ curr.clear(); for(int j = i + 1; j <= n; j++)curr.pb(j); for(int j = 1; j <= i; j++)curr.pb(j); ll nw = publish(curr); ll pos = (n - 1 + last - nw) / 2; res[pos] = i; seen[pos] = 1; last = nw; } for(int i = 0; i < n; i++){ if(!seen[i]){ res[i] = n; } } answer(res); } int main() { if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N) result("Invalid input!"); solution.resize(N); set<int> chosen; for(auto &x : solution) { if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x)) result("Invalid input!"); chosen.insert(x); } solve(N); result("No answer!"); }

Compilation message (stderr)

interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
/usr/bin/ld: /tmp/ccaBHFqg.o: in function `publish(std::vector<int, std::allocator<int> >)':
interface.cpp:(.text+0x60): multiple definition of `publish(std::vector<int, std::allocator<int> >)'; /tmp/ccoqmmUi.o:art.cpp:(.text+0x3b0): first defined here
/usr/bin/ld: /tmp/ccaBHFqg.o: in function `answer(std::vector<int, std::allocator<int> >)':
interface.cpp:(.text+0x170): multiple definition of `answer(std::vector<int, std::allocator<int> >)'; /tmp/ccoqmmUi.o:art.cpp:(.text+0x2b0): first defined here
/usr/bin/ld: /tmp/ccaBHFqg.o: in function `main':
interface.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccoqmmUi.o:art.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status